/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-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 23:50:00,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 23:50:00,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 23:50:00,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 23:50:00,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 23:50:00,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 23:50:00,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 23:50:00,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 23:50:00,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 23:50:00,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 23:50:00,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 23:50:00,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 23:50:00,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 23:50:00,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 23:50:00,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 23:50:00,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 23:50:00,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 23:50:00,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 23:50:00,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 23:50:00,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 23:50:00,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 23:50:00,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 23:50:00,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 23:50:00,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 23:50:00,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 23:50:00,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 23:50:00,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 23:50:00,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 23:50:00,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 23:50:00,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 23:50:00,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 23:50:00,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 23:50:00,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 23:50:00,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 23:50:00,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 23:50:00,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 23:50:00,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 23:50:00,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 23:50:00,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 23:50:00,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 23:50:00,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 23:50:00,839 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-PN-SemanticLbe.epf [2021-06-10 23:50:00,866 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 23:50:00,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 23:50:00,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 23:50:00,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 23:50:00,867 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 23:50:00,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 23:50:00,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 23:50:00,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 23:50:00,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 23:50:00,869 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 23:50:00,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 23:50:00,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 23:50:00,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 23:50:00,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 23:50:00,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 23:50:00,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 23:50:00,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 23:50:00,869 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 23:50:00,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-10 23:50:01,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 23:50:01,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 23:50:01,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 23:50:01,094 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-10 23:50:01,098 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-10 23:50:01,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl [2021-06-10 23:50:01,098 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl' [2021-06-10 23:50:01,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 23:50:01,138 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-10 23:50:01,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 23:50:01,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 23:50:01,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 23:50:01,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/1) ... [2021-06-10 23:50:01,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/1) ... [2021-06-10 23:50:01,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 23:50:01,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 23:50:01,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 23:50:01,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 23:50:01,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/1) ... [2021-06-10 23:50:01,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/1) ... [2021-06-10 23:50:01,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/1) ... [2021-06-10 23:50:01,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/1) ... [2021-06-10 23:50:01,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/1) ... [2021-06-10 23:50:01,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/1) ... [2021-06-10 23:50:01,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/1) ... [2021-06-10 23:50:01,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 23:50:01,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 23:50:01,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 23:50:01,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 23:50:01,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 23:50:01,282 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-10 23:50:01,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 23:50:01,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 23:50:01,283 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2021-06-10 23:50:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2021-06-10 23:50:01,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2021-06-10 23:50:01,284 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 23:50:01,367 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 23:50:01,368 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-06-10 23:50:01,369 INFO L202 PluginConnector]: Adding new model fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 11:50:01 BoogieIcfgContainer [2021-06-10 23:50:01,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 23:50:01,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 23:50:01,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 23:50:01,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 23:50:01,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.06 11:50:01" (1/2) ... [2021-06-10 23:50:01,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0527d and model type fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 11:50:01, skipping insertion in model container [2021-06-10 23:50:01,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 11:50:01" (2/2) ... [2021-06-10 23:50:01,375 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_loop_noop.bpl [2021-06-10 23:50:01,380 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 23:50:01,384 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-06-10 23:50:01,384 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 23:50:01,408 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:01,421 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:01,445 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:01,445 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:01,446 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:01,446 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:01,446 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:01,446 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:01,446 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:01,446 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:01,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 11 places, 8 transitions, 21 flow [2021-06-10 23:50:01,463 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-06-10 23:50:01,463 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,464 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-06-10 23:50:01,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 11 places, 8 transitions, 21 flow [2021-06-10 23:50:01,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 9 places, 6 transitions, 17 flow [2021-06-10 23:50:01,468 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:01,478 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 9 places, 6 transitions, 17 flow [2021-06-10 23:50:01,482 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 9 places, 6 transitions, 17 flow [2021-06-10 23:50:01,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 9 places, 6 transitions, 17 flow [2021-06-10 23:50:01,488 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2021-06-10 23:50:01,489 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12 conditions, 7 events. 0/7 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 8 event pairs, 0 based on Foata normal form. 0/7 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-10 23:50:01,491 INFO L151 LiptonReduction]: Number of co-enabled transitions 8 [2021-06-10 23:50:01,531 INFO L163 LiptonReduction]: Checked pairs total: 2 [2021-06-10 23:50:01,531 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-10 23:50:01,533 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-06-10 23:50:01,538 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:01,538 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,538 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:01,539 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:01,545 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:01,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:01,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1315, now seen corresponding path program 1 times [2021-06-10 23:50:01,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:01,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609091930] [2021-06-10 23:50:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:01,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:01,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:01,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609091930] [2021-06-10 23:50:01,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:01,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:01,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942891236] [2021-06-10 23:50:01,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:01,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:01,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:01,654 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 9 [2021-06-10 23:50:01,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 8 places, 5 transitions, 15 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:01,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 9 [2021-06-10 23:50:01,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:01,660 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2021-06-10 23:50:01,660 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11 conditions, 4 events. 0/4 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 event pairs, 0 based on Foata normal form. 2/6 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-10 23:50:01,661 INFO L132 encePairwiseOnDemand]: 7/9 looper letters, 0 selfloop transitions, 1 changer transitions 0/4 dead transitions. [2021-06-10 23:50:01,661 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 9 places, 4 transitions, 15 flow [2021-06-10 23:50:01,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2021-06-10 23:50:01,668 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2021-06-10 23:50:01,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 20 transitions. [2021-06-10 23:50:01,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 20 transitions. [2021-06-10 23:50:01,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:01,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 20 transitions. [2021-06-10 23:50:01,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,676 INFO L185 Difference]: Start difference. First operand has 8 places, 5 transitions, 15 flow. Second operand 3 states and 20 transitions. [2021-06-10 23:50:01,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 9 places, 4 transitions, 15 flow [2021-06-10 23:50:01,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 9 places, 4 transitions, 15 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:01,680 INFO L241 Difference]: Finished difference. Result has 9 places, 4 transitions, 15 flow [2021-06-10 23:50:01,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=9, PETRI_DIFFERENCE_MINUEND_FLOW=13, PETRI_DIFFERENCE_MINUEND_PLACES=7, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=15, PETRI_PLACES=9, PETRI_TRANSITIONS=4} [2021-06-10 23:50:01,682 INFO L343 CegarLoopForPetriNet]: 8 programPoint places, 1 predicate places. [2021-06-10 23:50:01,682 INFO L480 AbstractCegarLoop]: Abstraction has has 9 places, 4 transitions, 15 flow [2021-06-10 23:50:01,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,682 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:01,682 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-10 23:50:01,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-10 23:50:01,682 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:01,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:01,683 INFO L82 PathProgramCache]: Analyzing trace with hash 41033, now seen corresponding path program 1 times [2021-06-10 23:50:01,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:01,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802235518] [2021-06-10 23:50:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:01,690 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:01,694 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:01,703 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:01,703 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:01,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-10 23:50:01,704 WARN L342 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:01,705 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-10 23:50:01,725 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:01,725 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:01,726 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:01,726 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:01,726 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:01,726 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:01,726 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:01,726 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:01,727 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:01,727 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:01,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 16 places, 11 transitions, 34 flow [2021-06-10 23:50:01,742 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-06-10 23:50:01,742 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,743 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 38 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-06-10 23:50:01,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 16 places, 11 transitions, 34 flow [2021-06-10 23:50:01,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 9 transitions, 30 flow [2021-06-10 23:50:01,743 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:01,743 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 14 places, 9 transitions, 30 flow [2021-06-10 23:50:01,743 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 14 places, 9 transitions, 30 flow [2021-06-10 23:50:01,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 14 places, 9 transitions, 30 flow [2021-06-10 23:50:01,745 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-06-10 23:50:01,745 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21 conditions, 11 events. 0/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 11 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-10 23:50:01,746 INFO L151 LiptonReduction]: Number of co-enabled transitions 28 [2021-06-10 23:50:01,784 INFO L163 LiptonReduction]: Checked pairs total: 9 [2021-06-10 23:50:01,784 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-10 23:50:01,784 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-06-10 23:50:01,786 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:01,786 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,792 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:01,792 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:01,793 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:01,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2021-06-10 23:50:01,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:01,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37491298] [2021-06-10 23:50:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:01,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:01,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:01,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37491298] [2021-06-10 23:50:01,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:01,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:01,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460281179] [2021-06-10 23:50:01,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:01,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:01,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:01,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:01,810 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 13 [2021-06-10 23:50:01,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 7 transitions, 26 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:01,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 13 [2021-06-10 23:50:01,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:01,812 INFO L129 PetriNetUnfolder]: 0/6 cut-off events. [2021-06-10 23:50:01,812 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 2 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-10 23:50:01,812 INFO L132 encePairwiseOnDemand]: 11/13 looper letters, 0 selfloop transitions, 1 changer transitions 0/6 dead transitions. [2021-06-10 23:50:01,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 6 transitions, 26 flow [2021-06-10 23:50:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2021-06-10 23:50:01,813 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2021-06-10 23:50:01,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 32 transitions. [2021-06-10 23:50:01,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 32 transitions. [2021-06-10 23:50:01,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:01,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 32 transitions. [2021-06-10 23:50:01,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,814 INFO L185 Difference]: Start difference. First operand has 12 places, 7 transitions, 26 flow. Second operand 3 states and 32 transitions. [2021-06-10 23:50:01,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 6 transitions, 26 flow [2021-06-10 23:50:01,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 6 transitions, 24 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:01,815 INFO L241 Difference]: Finished difference. Result has 13 places, 6 transitions, 24 flow [2021-06-10 23:50:01,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=22, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=24, PETRI_PLACES=13, PETRI_TRANSITIONS=6} [2021-06-10 23:50:01,815 INFO L343 CegarLoopForPetriNet]: 12 programPoint places, 1 predicate places. [2021-06-10 23:50:01,816 INFO L480 AbstractCegarLoop]: Abstraction has has 13 places, 6 transitions, 24 flow [2021-06-10 23:50:01,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,816 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:01,816 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2021-06-10 23:50:01,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-10 23:50:01,816 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1643499, now seen corresponding path program 1 times [2021-06-10 23:50:01,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:01,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245734443] [2021-06-10 23:50:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:01,819 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:01,820 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:01,821 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:01,821 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:01,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-10 23:50:01,822 WARN L342 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:01,822 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-06-10 23:50:01,827 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:01,827 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:01,828 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:01,828 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:01,828 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:01,828 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:01,828 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:01,828 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:01,828 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:01,828 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:01,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 14 transitions, 49 flow [2021-06-10 23:50:01,832 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-10 23:50:01,832 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,832 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 65 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-06-10 23:50:01,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 14 transitions, 49 flow [2021-06-10 23:50:01,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 12 transitions, 45 flow [2021-06-10 23:50:01,833 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:01,833 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 12 transitions, 45 flow [2021-06-10 23:50:01,833 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 12 transitions, 45 flow [2021-06-10 23:50:01,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 19 places, 12 transitions, 45 flow [2021-06-10 23:50:01,836 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-06-10 23:50:01,836 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-06-10 23:50:01,836 INFO L151 LiptonReduction]: Number of co-enabled transitions 60 [2021-06-10 23:50:01,893 INFO L163 LiptonReduction]: Checked pairs total: 21 [2021-06-10 23:50:01,894 INFO L165 LiptonReduction]: Total number of compositions: 3 [2021-06-10 23:50:01,894 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 61 [2021-06-10 23:50:01,895 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:01,895 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,895 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:01,895 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:01,896 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2211, now seen corresponding path program 1 times [2021-06-10 23:50:01,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:01,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181960863] [2021-06-10 23:50:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:01,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:01,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:01,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181960863] [2021-06-10 23:50:01,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:01,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:01,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681720928] [2021-06-10 23:50:01,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:01,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:01,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:01,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:01,905 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 17 [2021-06-10 23:50:01,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 9 transitions, 39 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,905 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:01,905 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 17 [2021-06-10 23:50:01,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:01,910 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-06-10 23:50:01,910 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 8 events. 0/8 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 4/12 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-06-10 23:50:01,910 INFO L132 encePairwiseOnDemand]: 15/17 looper letters, 0 selfloop transitions, 1 changer transitions 0/8 dead transitions. [2021-06-10 23:50:01,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 8 transitions, 39 flow [2021-06-10 23:50:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2021-06-10 23:50:01,911 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8627450980392157 [2021-06-10 23:50:01,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 44 transitions. [2021-06-10 23:50:01,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 44 transitions. [2021-06-10 23:50:01,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:01,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 44 transitions. [2021-06-10 23:50:01,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,913 INFO L185 Difference]: Start difference. First operand has 16 places, 9 transitions, 39 flow. Second operand 3 states and 44 transitions. [2021-06-10 23:50:01,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 8 transitions, 39 flow [2021-06-10 23:50:01,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 8 transitions, 33 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:01,915 INFO L241 Difference]: Finished difference. Result has 17 places, 8 transitions, 33 flow [2021-06-10 23:50:01,915 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=31, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=33, PETRI_PLACES=17, PETRI_TRANSITIONS=8} [2021-06-10 23:50:01,916 INFO L343 CegarLoopForPetriNet]: 16 programPoint places, 1 predicate places. [2021-06-10 23:50:01,916 INFO L480 AbstractCegarLoop]: Abstraction has has 17 places, 8 transitions, 33 flow [2021-06-10 23:50:01,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:01,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:01,916 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-10 23:50:01,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 23:50:01,916 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash 66279044, now seen corresponding path program 1 times [2021-06-10 23:50:01,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:01,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797962353] [2021-06-10 23:50:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:01,920 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:01,921 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:01,922 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:01,923 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:01,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 23:50:01,923 WARN L342 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:01,923 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-06-10 23:50:01,938 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:01,938 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:01,939 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:01,939 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:01,939 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:01,940 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:01,940 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:01,940 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:01,940 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:01,940 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:01,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 66 flow [2021-06-10 23:50:01,954 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-06-10 23:50:01,955 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,955 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-06-10 23:50:01,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 17 transitions, 66 flow [2021-06-10 23:50:01,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 15 transitions, 62 flow [2021-06-10 23:50:01,956 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:01,956 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 15 transitions, 62 flow [2021-06-10 23:50:01,956 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 15 transitions, 62 flow [2021-06-10 23:50:01,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 15 transitions, 62 flow [2021-06-10 23:50:01,962 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-06-10 23:50:01,962 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:01,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2021-06-10 23:50:01,962 INFO L151 LiptonReduction]: Number of co-enabled transitions 104 [2021-06-10 23:50:02,032 INFO L163 LiptonReduction]: Checked pairs total: 38 [2021-06-10 23:50:02,032 INFO L165 LiptonReduction]: Total number of compositions: 4 [2021-06-10 23:50:02,032 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-06-10 23:50:02,033 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:02,033 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,033 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:02,034 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:02,034 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:02,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:02,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2021-06-10 23:50:02,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:02,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163812893] [2021-06-10 23:50:02,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:02,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:02,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:02,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163812893] [2021-06-10 23:50:02,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:02,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:02,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813474429] [2021-06-10 23:50:02,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:02,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:02,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:02,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:02,073 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 21 [2021-06-10 23:50:02,073 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 11 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:02,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 21 [2021-06-10 23:50:02,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:02,076 INFO L129 PetriNetUnfolder]: 0/10 cut-off events. [2021-06-10 23:50:02,076 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 10 events. 0/10 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 6 event pairs, 0 based on Foata normal form. 5/15 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2021-06-10 23:50:02,076 INFO L132 encePairwiseOnDemand]: 19/21 looper letters, 0 selfloop transitions, 1 changer transitions 0/10 dead transitions. [2021-06-10 23:50:02,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 10 transitions, 54 flow [2021-06-10 23:50:02,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2021-06-10 23:50:02,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-06-10 23:50:02,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 56 transitions. [2021-06-10 23:50:02,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 56 transitions. [2021-06-10 23:50:02,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:02,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 56 transitions. [2021-06-10 23:50:02,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,078 INFO L185 Difference]: Start difference. First operand has 20 places, 11 transitions, 54 flow. Second operand 3 states and 56 transitions. [2021-06-10 23:50:02,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 10 transitions, 54 flow [2021-06-10 23:50:02,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 10 transitions, 42 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:02,079 INFO L241 Difference]: Finished difference. Result has 21 places, 10 transitions, 42 flow [2021-06-10 23:50:02,079 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=21, PETRI_TRANSITIONS=10} [2021-06-10 23:50:02,079 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2021-06-10 23:50:02,080 INFO L480 AbstractCegarLoop]: Abstraction has has 21 places, 10 transitions, 42 flow [2021-06-10 23:50:02,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,080 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:02,080 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2021-06-10 23:50:02,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 23:50:02,080 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1646739026, now seen corresponding path program 1 times [2021-06-10 23:50:02,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:02,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996808913] [2021-06-10 23:50:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:02,083 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:02,085 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:02,086 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:02,086 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:02,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 23:50:02,087 WARN L342 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:02,087 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2021-06-10 23:50:02,093 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:02,093 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:02,094 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:02,094 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:02,094 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:02,094 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:02,094 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:02,094 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:02,095 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:02,095 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:02,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 85 flow [2021-06-10 23:50:02,098 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-06-10 23:50:02,098 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,099 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 111 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-06-10 23:50:02,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 20 transitions, 85 flow [2021-06-10 23:50:02,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 18 transitions, 81 flow [2021-06-10 23:50:02,099 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:02,099 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 18 transitions, 81 flow [2021-06-10 23:50:02,099 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 18 transitions, 81 flow [2021-06-10 23:50:02,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 18 transitions, 81 flow [2021-06-10 23:50:02,102 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-10 23:50:02,102 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2021-06-10 23:50:02,103 INFO L151 LiptonReduction]: Number of co-enabled transitions 160 [2021-06-10 23:50:02,175 INFO L163 LiptonReduction]: Checked pairs total: 60 [2021-06-10 23:50:02,175 INFO L165 LiptonReduction]: Total number of compositions: 5 [2021-06-10 23:50:02,176 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 77 [2021-06-10 23:50:02,177 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:02,177 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,177 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:02,177 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:02,177 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:02,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 1 times [2021-06-10 23:50:02,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:02,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836420672] [2021-06-10 23:50:02,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:02,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:02,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:02,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836420672] [2021-06-10 23:50:02,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:02,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:02,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737065931] [2021-06-10 23:50:02,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:02,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:02,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:02,186 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 25 [2021-06-10 23:50:02,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 13 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:02,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 25 [2021-06-10 23:50:02,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:02,189 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-06-10 23:50:02,189 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 12 events. 0/12 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 7 event pairs, 0 based on Foata normal form. 6/18 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2021-06-10 23:50:02,189 INFO L132 encePairwiseOnDemand]: 23/25 looper letters, 0 selfloop transitions, 1 changer transitions 0/12 dead transitions. [2021-06-10 23:50:02,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 12 transitions, 71 flow [2021-06-10 23:50:02,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2021-06-10 23:50:02,190 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2021-06-10 23:50:02,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 68 transitions. [2021-06-10 23:50:02,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 68 transitions. [2021-06-10 23:50:02,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:02,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 68 transitions. [2021-06-10 23:50:02,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,192 INFO L185 Difference]: Start difference. First operand has 24 places, 13 transitions, 71 flow. Second operand 3 states and 68 transitions. [2021-06-10 23:50:02,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 12 transitions, 71 flow [2021-06-10 23:50:02,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 12 transitions, 51 flow, removed 10 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:02,193 INFO L241 Difference]: Finished difference. Result has 25 places, 12 transitions, 51 flow [2021-06-10 23:50:02,193 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=25, PETRI_TRANSITIONS=12} [2021-06-10 23:50:02,193 INFO L343 CegarLoopForPetriNet]: 24 programPoint places, 1 predicate places. [2021-06-10 23:50:02,193 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 12 transitions, 51 flow [2021-06-10 23:50:02,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,194 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:02,194 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:02,194 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 23:50:02,194 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1085119695, now seen corresponding path program 1 times [2021-06-10 23:50:02,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:02,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292827459] [2021-06-10 23:50:02,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:02,198 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:02,200 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:02,201 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:02,201 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:02,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 23:50:02,201 WARN L342 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:02,202 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2021-06-10 23:50:02,210 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:02,210 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:02,211 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:02,211 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:02,211 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:02,211 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:02,211 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:02,211 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:02,211 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:02,211 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:02,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 106 flow [2021-06-10 23:50:02,216 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-06-10 23:50:02,216 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,216 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-06-10 23:50:02,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 23 transitions, 106 flow [2021-06-10 23:50:02,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 21 transitions, 102 flow [2021-06-10 23:50:02,217 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:02,217 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 102 flow [2021-06-10 23:50:02,217 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 102 flow [2021-06-10 23:50:02,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 102 flow [2021-06-10 23:50:02,220 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-06-10 23:50:02,220 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2021-06-10 23:50:02,221 INFO L151 LiptonReduction]: Number of co-enabled transitions 228 [2021-06-10 23:50:02,362 INFO L163 LiptonReduction]: Checked pairs total: 87 [2021-06-10 23:50:02,362 INFO L165 LiptonReduction]: Total number of compositions: 6 [2021-06-10 23:50:02,362 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 145 [2021-06-10 23:50:02,363 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:02,363 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,364 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:02,364 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:02,364 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:02,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:02,364 INFO L82 PathProgramCache]: Analyzing trace with hash 4515, now seen corresponding path program 1 times [2021-06-10 23:50:02,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:02,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089405684] [2021-06-10 23:50:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:02,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:02,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:02,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089405684] [2021-06-10 23:50:02,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:02,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:02,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412777750] [2021-06-10 23:50:02,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:02,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:02,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:02,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:02,382 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 29 [2021-06-10 23:50:02,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 15 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:02,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 29 [2021-06-10 23:50:02,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:02,385 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-06-10 23:50:02,385 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 14 events. 0/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 0 based on Foata normal form. 7/21 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2021-06-10 23:50:02,385 INFO L132 encePairwiseOnDemand]: 27/29 looper letters, 0 selfloop transitions, 1 changer transitions 0/14 dead transitions. [2021-06-10 23:50:02,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 14 transitions, 90 flow [2021-06-10 23:50:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2021-06-10 23:50:02,386 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9195402298850575 [2021-06-10 23:50:02,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 80 transitions. [2021-06-10 23:50:02,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 80 transitions. [2021-06-10 23:50:02,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:02,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 80 transitions. [2021-06-10 23:50:02,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,387 INFO L185 Difference]: Start difference. First operand has 28 places, 15 transitions, 90 flow. Second operand 3 states and 80 transitions. [2021-06-10 23:50:02,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 14 transitions, 90 flow [2021-06-10 23:50:02,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 14 transitions, 60 flow, removed 15 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:02,389 INFO L241 Difference]: Finished difference. Result has 29 places, 14 transitions, 60 flow [2021-06-10 23:50:02,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=14} [2021-06-10 23:50:02,389 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2021-06-10 23:50:02,389 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 14 transitions, 60 flow [2021-06-10 23:50:02,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,389 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:02,389 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:02,389 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-10 23:50:02,390 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1719135375, now seen corresponding path program 1 times [2021-06-10 23:50:02,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:02,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443944296] [2021-06-10 23:50:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:02,399 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:02,401 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:02,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:02,403 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:02,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-10 23:50:02,403 WARN L342 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:02,403 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2021-06-10 23:50:02,417 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:02,417 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:02,421 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:02,421 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:02,421 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:02,421 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:02,421 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:02,422 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:02,422 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:02,422 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:02,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 26 transitions, 129 flow [2021-06-10 23:50:02,431 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-06-10 23:50:02,432 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,432 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-06-10 23:50:02,432 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 26 transitions, 129 flow [2021-06-10 23:50:02,432 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 24 transitions, 125 flow [2021-06-10 23:50:02,432 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:02,432 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 125 flow [2021-06-10 23:50:02,433 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 125 flow [2021-06-10 23:50:02,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 24 transitions, 125 flow [2021-06-10 23:50:02,436 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-06-10 23:50:02,436 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-06-10 23:50:02,436 INFO L151 LiptonReduction]: Number of co-enabled transitions 308 [2021-06-10 23:50:02,603 INFO L163 LiptonReduction]: Checked pairs total: 119 [2021-06-10 23:50:02,603 INFO L165 LiptonReduction]: Total number of compositions: 7 [2021-06-10 23:50:02,603 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 171 [2021-06-10 23:50:02,607 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:02,607 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:02,607 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:02,607 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash 5539, now seen corresponding path program 1 times [2021-06-10 23:50:02,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:02,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238918092] [2021-06-10 23:50:02,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:02,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:02,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:02,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238918092] [2021-06-10 23:50:02,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:02,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:02,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32487535] [2021-06-10 23:50:02,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:02,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:02,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:02,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:02,620 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 33 [2021-06-10 23:50:02,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:02,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 33 [2021-06-10 23:50:02,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:02,623 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-06-10 23:50:02,623 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 8/24 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-06-10 23:50:02,623 INFO L132 encePairwiseOnDemand]: 31/33 looper letters, 0 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2021-06-10 23:50:02,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 16 transitions, 111 flow [2021-06-10 23:50:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2021-06-10 23:50:02,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2021-06-10 23:50:02,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2021-06-10 23:50:02,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2021-06-10 23:50:02,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:02,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2021-06-10 23:50:02,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,626 INFO L185 Difference]: Start difference. First operand has 32 places, 17 transitions, 111 flow. Second operand 3 states and 92 transitions. [2021-06-10 23:50:02,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 16 transitions, 111 flow [2021-06-10 23:50:02,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 16 transitions, 69 flow, removed 21 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:02,628 INFO L241 Difference]: Finished difference. Result has 33 places, 16 transitions, 69 flow [2021-06-10 23:50:02,628 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=33, PETRI_TRANSITIONS=16} [2021-06-10 23:50:02,628 INFO L343 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2021-06-10 23:50:02,628 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 16 transitions, 69 flow [2021-06-10 23:50:02,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,628 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:02,628 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:02,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-10 23:50:02,628 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:02,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash 779611434, now seen corresponding path program 1 times [2021-06-10 23:50:02,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:02,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002760663] [2021-06-10 23:50:02,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:02,636 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:02,638 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:02,639 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:02,639 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:02,639 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-10 23:50:02,640 WARN L342 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:02,640 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2021-06-10 23:50:02,653 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:02,654 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:02,654 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:02,654 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:02,654 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:02,655 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:02,655 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:02,655 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:02,655 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:02,655 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:02,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 29 transitions, 154 flow [2021-06-10 23:50:02,660 INFO L129 PetriNetUnfolder]: 0/53 cut-off events. [2021-06-10 23:50:02,660 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,660 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 191 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-06-10 23:50:02,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 29 transitions, 154 flow [2021-06-10 23:50:02,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 27 transitions, 150 flow [2021-06-10 23:50:02,661 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:02,661 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 27 transitions, 150 flow [2021-06-10 23:50:02,661 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 27 transitions, 150 flow [2021-06-10 23:50:02,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 27 transitions, 150 flow [2021-06-10 23:50:02,664 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-06-10 23:50:02,664 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2021-06-10 23:50:02,665 INFO L151 LiptonReduction]: Number of co-enabled transitions 400 [2021-06-10 23:50:02,829 INFO L163 LiptonReduction]: Checked pairs total: 156 [2021-06-10 23:50:02,829 INFO L165 LiptonReduction]: Total number of compositions: 8 [2021-06-10 23:50:02,829 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 168 [2021-06-10 23:50:02,831 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:02,831 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,831 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:02,831 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:02,831 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:02,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:02,831 INFO L82 PathProgramCache]: Analyzing trace with hash 6691, now seen corresponding path program 1 times [2021-06-10 23:50:02,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:02,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840359914] [2021-06-10 23:50:02,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:02,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:02,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:02,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840359914] [2021-06-10 23:50:02,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:02,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:02,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737345526] [2021-06-10 23:50:02,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:02,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:02,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:02,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:02,845 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 37 [2021-06-10 23:50:02,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 19 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:02,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 37 [2021-06-10 23:50:02,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:02,848 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-06-10 23:50:02,848 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 9/27 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2021-06-10 23:50:02,848 INFO L132 encePairwiseOnDemand]: 35/37 looper letters, 0 selfloop transitions, 1 changer transitions 0/18 dead transitions. [2021-06-10 23:50:02,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 18 transitions, 134 flow [2021-06-10 23:50:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2021-06-10 23:50:02,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2021-06-10 23:50:02,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 104 transitions. [2021-06-10 23:50:02,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 104 transitions. [2021-06-10 23:50:02,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:02,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 104 transitions. [2021-06-10 23:50:02,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,851 INFO L185 Difference]: Start difference. First operand has 36 places, 19 transitions, 134 flow. Second operand 3 states and 104 transitions. [2021-06-10 23:50:02,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 18 transitions, 134 flow [2021-06-10 23:50:02,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 18 transitions, 78 flow, removed 28 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:02,853 INFO L241 Difference]: Finished difference. Result has 37 places, 18 transitions, 78 flow [2021-06-10 23:50:02,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2021-06-10 23:50:02,853 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2021-06-10 23:50:02,853 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 18 transitions, 78 flow [2021-06-10 23:50:02,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:02,853 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:02,853 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:02,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-10 23:50:02,854 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2053304524, now seen corresponding path program 1 times [2021-06-10 23:50:02,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:02,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176008284] [2021-06-10 23:50:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:02,857 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:02,860 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:02,861 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:02,861 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:02,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-10 23:50:02,862 WARN L342 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:02,862 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2021-06-10 23:50:02,879 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:02,879 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:02,880 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:02,880 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:02,880 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:02,880 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:02,880 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:02,880 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:02,880 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:02,880 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:02,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 32 transitions, 181 flow [2021-06-10 23:50:02,885 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2021-06-10 23:50:02,885 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,885 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 212 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-06-10 23:50:02,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 32 transitions, 181 flow [2021-06-10 23:50:02,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 30 transitions, 177 flow [2021-06-10 23:50:02,886 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:02,886 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 30 transitions, 177 flow [2021-06-10 23:50:02,886 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 30 transitions, 177 flow [2021-06-10 23:50:02,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 30 transitions, 177 flow [2021-06-10 23:50:02,889 INFO L129 PetriNetUnfolder]: 0/39 cut-off events. [2021-06-10 23:50:02,889 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:02,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2021-06-10 23:50:02,890 INFO L151 LiptonReduction]: Number of co-enabled transitions 504 [2021-06-10 23:50:03,059 INFO L163 LiptonReduction]: Checked pairs total: 198 [2021-06-10 23:50:03,059 INFO L165 LiptonReduction]: Total number of compositions: 9 [2021-06-10 23:50:03,059 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 173 [2021-06-10 23:50:03,060 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:03,060 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,060 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:03,060 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:03,060 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:03,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash 7971, now seen corresponding path program 1 times [2021-06-10 23:50:03,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:03,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210902967] [2021-06-10 23:50:03,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:03,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:03,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:03,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210902967] [2021-06-10 23:50:03,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:03,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:03,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834369764] [2021-06-10 23:50:03,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:03,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:03,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:03,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:03,068 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 41 [2021-06-10 23:50:03,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 21 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:03,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 41 [2021-06-10 23:50:03,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:03,070 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-06-10 23:50:03,070 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 10/30 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2021-06-10 23:50:03,071 INFO L132 encePairwiseOnDemand]: 39/41 looper letters, 0 selfloop transitions, 1 changer transitions 0/20 dead transitions. [2021-06-10 23:50:03,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 20 transitions, 159 flow [2021-06-10 23:50:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2021-06-10 23:50:03,071 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.943089430894309 [2021-06-10 23:50:03,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2021-06-10 23:50:03,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2021-06-10 23:50:03,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:03,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2021-06-10 23:50:03,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,073 INFO L185 Difference]: Start difference. First operand has 40 places, 21 transitions, 159 flow. Second operand 3 states and 116 transitions. [2021-06-10 23:50:03,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 20 transitions, 159 flow [2021-06-10 23:50:03,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 20 transitions, 87 flow, removed 36 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:03,074 INFO L241 Difference]: Finished difference. Result has 41 places, 20 transitions, 87 flow [2021-06-10 23:50:03,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=20} [2021-06-10 23:50:03,075 INFO L343 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2021-06-10 23:50:03,075 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 20 transitions, 87 flow [2021-06-10 23:50:03,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:03,075 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:03,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-10 23:50:03,075 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:03,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:03,075 INFO L82 PathProgramCache]: Analyzing trace with hash -607272555, now seen corresponding path program 1 times [2021-06-10 23:50:03,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:03,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989132746] [2021-06-10 23:50:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:03,083 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:03,085 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:03,087 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:03,087 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:03,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-10 23:50:03,087 WARN L342 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:03,087 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2021-06-10 23:50:03,108 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:03,108 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:03,109 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:03,109 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:03,109 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:03,109 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:03,109 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:03,109 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:03,109 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:03,109 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:03,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 35 transitions, 210 flow [2021-06-10 23:50:03,115 INFO L129 PetriNetUnfolder]: 0/65 cut-off events. [2021-06-10 23:50:03,115 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,115 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-06-10 23:50:03,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 35 transitions, 210 flow [2021-06-10 23:50:03,115 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 33 transitions, 206 flow [2021-06-10 23:50:03,115 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:03,116 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 33 transitions, 206 flow [2021-06-10 23:50:03,116 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 33 transitions, 206 flow [2021-06-10 23:50:03,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 33 transitions, 206 flow [2021-06-10 23:50:03,118 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-06-10 23:50:03,118 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 110 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2021-06-10 23:50:03,119 INFO L151 LiptonReduction]: Number of co-enabled transitions 620 [2021-06-10 23:50:03,335 INFO L163 LiptonReduction]: Checked pairs total: 245 [2021-06-10 23:50:03,335 INFO L165 LiptonReduction]: Total number of compositions: 10 [2021-06-10 23:50:03,336 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 221 [2021-06-10 23:50:03,336 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:03,337 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,337 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:03,337 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:03,337 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:03,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:03,337 INFO L82 PathProgramCache]: Analyzing trace with hash 9379, now seen corresponding path program 1 times [2021-06-10 23:50:03,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:03,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399268472] [2021-06-10 23:50:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:03,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:03,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:03,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399268472] [2021-06-10 23:50:03,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:03,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:03,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577794320] [2021-06-10 23:50:03,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:03,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:03,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:03,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:03,350 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 45 [2021-06-10 23:50:03,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 23 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:03,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 45 [2021-06-10 23:50:03,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:03,354 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-06-10 23:50:03,354 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 11/33 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2021-06-10 23:50:03,355 INFO L132 encePairwiseOnDemand]: 43/45 looper letters, 0 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2021-06-10 23:50:03,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 22 transitions, 186 flow [2021-06-10 23:50:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2021-06-10 23:50:03,356 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9481481481481482 [2021-06-10 23:50:03,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 128 transitions. [2021-06-10 23:50:03,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 128 transitions. [2021-06-10 23:50:03,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:03,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 128 transitions. [2021-06-10 23:50:03,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,359 INFO L185 Difference]: Start difference. First operand has 44 places, 23 transitions, 186 flow. Second operand 3 states and 128 transitions. [2021-06-10 23:50:03,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 22 transitions, 186 flow [2021-06-10 23:50:03,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 22 transitions, 96 flow, removed 45 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:03,363 INFO L241 Difference]: Finished difference. Result has 45 places, 22 transitions, 96 flow [2021-06-10 23:50:03,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=45, PETRI_TRANSITIONS=22} [2021-06-10 23:50:03,364 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2021-06-10 23:50:03,364 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 22 transitions, 96 flow [2021-06-10 23:50:03,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,364 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:03,364 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:03,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-10 23:50:03,365 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:03,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1208304905, now seen corresponding path program 1 times [2021-06-10 23:50:03,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:03,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673776147] [2021-06-10 23:50:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:03,368 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:03,370 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:03,371 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:03,371 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:03,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-10 23:50:03,372 WARN L342 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:03,372 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2021-06-10 23:50:03,381 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:03,382 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:03,382 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:03,382 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:03,382 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:03,382 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:03,382 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:03,382 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:03,382 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:03,382 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:03,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 38 transitions, 241 flow [2021-06-10 23:50:03,387 INFO L129 PetriNetUnfolder]: 0/71 cut-off events. [2021-06-10 23:50:03,387 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,387 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-06-10 23:50:03,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 38 transitions, 241 flow [2021-06-10 23:50:03,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 36 transitions, 237 flow [2021-06-10 23:50:03,387 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:03,387 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 36 transitions, 237 flow [2021-06-10 23:50:03,388 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 36 transitions, 237 flow [2021-06-10 23:50:03,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 36 transitions, 237 flow [2021-06-10 23:50:03,390 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-06-10 23:50:03,390 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 142 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2021-06-10 23:50:03,391 INFO L151 LiptonReduction]: Number of co-enabled transitions 748 [2021-06-10 23:50:03,593 INFO L163 LiptonReduction]: Checked pairs total: 297 [2021-06-10 23:50:03,593 INFO L165 LiptonReduction]: Total number of compositions: 11 [2021-06-10 23:50:03,593 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 206 [2021-06-10 23:50:03,594 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:03,594 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,594 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:03,594 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:03,594 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:03,594 INFO L82 PathProgramCache]: Analyzing trace with hash 10915, now seen corresponding path program 1 times [2021-06-10 23:50:03,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:03,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570419670] [2021-06-10 23:50:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:03,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:03,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:03,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570419670] [2021-06-10 23:50:03,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:03,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:03,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893349863] [2021-06-10 23:50:03,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:03,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:03,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:03,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:03,601 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 49 [2021-06-10 23:50:03,601 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 25 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,601 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:03,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 49 [2021-06-10 23:50:03,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:03,604 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-06-10 23:50:03,604 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 12/36 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2021-06-10 23:50:03,604 INFO L132 encePairwiseOnDemand]: 47/49 looper letters, 0 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2021-06-10 23:50:03,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 24 transitions, 215 flow [2021-06-10 23:50:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2021-06-10 23:50:03,605 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2021-06-10 23:50:03,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2021-06-10 23:50:03,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2021-06-10 23:50:03,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:03,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2021-06-10 23:50:03,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,606 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,606 INFO L185 Difference]: Start difference. First operand has 48 places, 25 transitions, 215 flow. Second operand 3 states and 140 transitions. [2021-06-10 23:50:03,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 24 transitions, 215 flow [2021-06-10 23:50:03,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 24 transitions, 105 flow, removed 55 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:03,607 INFO L241 Difference]: Finished difference. Result has 49 places, 24 transitions, 105 flow [2021-06-10 23:50:03,608 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=49, PETRI_TRANSITIONS=24} [2021-06-10 23:50:03,608 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2021-06-10 23:50:03,608 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 24 transitions, 105 flow [2021-06-10 23:50:03,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,608 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:03,608 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:03,608 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-10 23:50:03,608 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:03,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:03,608 INFO L82 PathProgramCache]: Analyzing trace with hash 941462544, now seen corresponding path program 1 times [2021-06-10 23:50:03,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:03,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316333270] [2021-06-10 23:50:03,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:03,611 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:03,613 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:03,615 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:03,615 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:03,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-10 23:50:03,615 WARN L342 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:03,615 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2021-06-10 23:50:03,626 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:03,626 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:03,627 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:03,627 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:03,627 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:03,627 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:03,627 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:03,627 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:03,627 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:03,627 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:03,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 41 transitions, 274 flow [2021-06-10 23:50:03,632 INFO L129 PetriNetUnfolder]: 0/77 cut-off events. [2021-06-10 23:50:03,632 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,632 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 294 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-06-10 23:50:03,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 41 transitions, 274 flow [2021-06-10 23:50:03,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 39 transitions, 270 flow [2021-06-10 23:50:03,632 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:03,633 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 39 transitions, 270 flow [2021-06-10 23:50:03,633 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 39 transitions, 270 flow [2021-06-10 23:50:03,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 39 transitions, 270 flow [2021-06-10 23:50:03,636 INFO L129 PetriNetUnfolder]: 0/51 cut-off events. [2021-06-10 23:50:03,636 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 51 events. 0/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 153 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 0. Up to 13 conditions per place. [2021-06-10 23:50:03,637 INFO L151 LiptonReduction]: Number of co-enabled transitions 888 [2021-06-10 23:50:03,883 INFO L163 LiptonReduction]: Checked pairs total: 354 [2021-06-10 23:50:03,883 INFO L165 LiptonReduction]: Total number of compositions: 12 [2021-06-10 23:50:03,883 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 251 [2021-06-10 23:50:03,884 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:03,884 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,884 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:03,884 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:03,884 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:03,885 INFO L82 PathProgramCache]: Analyzing trace with hash 12579, now seen corresponding path program 1 times [2021-06-10 23:50:03,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:03,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956624372] [2021-06-10 23:50:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:03,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:03,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:03,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956624372] [2021-06-10 23:50:03,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:03,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:03,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940807598] [2021-06-10 23:50:03,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:03,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:03,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:03,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:03,893 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 53 [2021-06-10 23:50:03,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 27 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:03,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 53 [2021-06-10 23:50:03,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:03,896 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-06-10 23:50:03,896 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 13/39 useless extension candidates. Maximal degree in co-relation 0. Up to 13 conditions per place. [2021-06-10 23:50:03,896 INFO L132 encePairwiseOnDemand]: 51/53 looper letters, 0 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2021-06-10 23:50:03,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 26 transitions, 246 flow [2021-06-10 23:50:03,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2021-06-10 23:50:03,896 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9559748427672956 [2021-06-10 23:50:03,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2021-06-10 23:50:03,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2021-06-10 23:50:03,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:03,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2021-06-10 23:50:03,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,898 INFO L185 Difference]: Start difference. First operand has 52 places, 27 transitions, 246 flow. Second operand 3 states and 152 transitions. [2021-06-10 23:50:03,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 26 transitions, 246 flow [2021-06-10 23:50:03,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 26 transitions, 114 flow, removed 66 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:03,899 INFO L241 Difference]: Finished difference. Result has 53 places, 26 transitions, 114 flow [2021-06-10 23:50:03,899 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=53, PETRI_TRANSITIONS=26} [2021-06-10 23:50:03,899 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2021-06-10 23:50:03,899 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 26 transitions, 114 flow [2021-06-10 23:50:03,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:03,900 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:03,900 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:03,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-10 23:50:03,900 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:03,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:03,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1127292090, now seen corresponding path program 1 times [2021-06-10 23:50:03,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:03,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840356894] [2021-06-10 23:50:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:03,903 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:03,905 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:03,906 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:03,906 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:03,906 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-10 23:50:03,907 WARN L342 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:03,907 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2021-06-10 23:50:03,918 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:03,918 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:03,918 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:03,918 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:03,919 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:03,919 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:03,919 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:03,919 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:03,919 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:03,919 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:03,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 44 transitions, 309 flow [2021-06-10 23:50:03,923 INFO L129 PetriNetUnfolder]: 0/83 cut-off events. [2021-06-10 23:50:03,923 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,924 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-06-10 23:50:03,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 44 transitions, 309 flow [2021-06-10 23:50:03,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 42 transitions, 305 flow [2021-06-10 23:50:03,924 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:03,924 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 42 transitions, 305 flow [2021-06-10 23:50:03,924 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 42 transitions, 305 flow [2021-06-10 23:50:03,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 42 transitions, 305 flow [2021-06-10 23:50:03,927 INFO L129 PetriNetUnfolder]: 0/55 cut-off events. [2021-06-10 23:50:03,927 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:03,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 55 events. 0/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 126 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 0. Up to 14 conditions per place. [2021-06-10 23:50:03,928 INFO L151 LiptonReduction]: Number of co-enabled transitions 1040 [2021-06-10 23:50:04,207 INFO L163 LiptonReduction]: Checked pairs total: 416 [2021-06-10 23:50:04,208 INFO L165 LiptonReduction]: Total number of compositions: 13 [2021-06-10 23:50:04,208 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 284 [2021-06-10 23:50:04,208 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:04,209 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:04,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:04,209 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:04,209 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash 14371, now seen corresponding path program 1 times [2021-06-10 23:50:04,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:04,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523648051] [2021-06-10 23:50:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:04,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:04,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:04,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523648051] [2021-06-10 23:50:04,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:04,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:04,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843046883] [2021-06-10 23:50:04,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:04,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:04,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:04,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:04,221 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 57 [2021-06-10 23:50:04,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 29 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:04,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:04,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 57 [2021-06-10 23:50:04,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:04,225 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-06-10 23:50:04,225 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:04,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 14/42 useless extension candidates. Maximal degree in co-relation 0. Up to 14 conditions per place. [2021-06-10 23:50:04,225 INFO L132 encePairwiseOnDemand]: 55/57 looper letters, 0 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2021-06-10 23:50:04,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 28 transitions, 279 flow [2021-06-10 23:50:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2021-06-10 23:50:04,226 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9590643274853801 [2021-06-10 23:50:04,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 164 transitions. [2021-06-10 23:50:04,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 164 transitions. [2021-06-10 23:50:04,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:04,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 164 transitions. [2021-06-10 23:50:04,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:04,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:04,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:04,227 INFO L185 Difference]: Start difference. First operand has 56 places, 29 transitions, 279 flow. Second operand 3 states and 164 transitions. [2021-06-10 23:50:04,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 28 transitions, 279 flow [2021-06-10 23:50:04,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 28 transitions, 123 flow, removed 78 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:04,228 INFO L241 Difference]: Finished difference. Result has 57 places, 28 transitions, 123 flow [2021-06-10 23:50:04,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=57, PETRI_TRANSITIONS=28} [2021-06-10 23:50:04,229 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 1 predicate places. [2021-06-10 23:50:04,229 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 28 transitions, 123 flow [2021-06-10 23:50:04,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:04,229 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:04,229 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:04,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-10 23:50:04,229 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:04,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1451810459, now seen corresponding path program 1 times [2021-06-10 23:50:04,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:04,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207606453] [2021-06-10 23:50:04,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:04,234 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:04,242 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:04,244 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:04,244 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:04,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-10 23:50:04,244 WARN L342 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:04,245 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2021-06-10 23:50:04,266 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:04,266 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:04,267 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:04,267 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:04,267 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:04,267 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:04,267 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:04,267 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:04,267 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:04,267 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:04,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 47 transitions, 346 flow [2021-06-10 23:50:04,273 INFO L129 PetriNetUnfolder]: 0/89 cut-off events. [2021-06-10 23:50:04,273 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:04,273 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-06-10 23:50:04,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 47 transitions, 346 flow [2021-06-10 23:50:04,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 45 transitions, 342 flow [2021-06-10 23:50:04,274 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:04,274 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 45 transitions, 342 flow [2021-06-10 23:50:04,274 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 45 transitions, 342 flow [2021-06-10 23:50:04,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 45 transitions, 342 flow [2021-06-10 23:50:04,278 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2021-06-10 23:50:04,278 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:04,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 59 events. 0/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 167 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. [2021-06-10 23:50:04,279 INFO L151 LiptonReduction]: Number of co-enabled transitions 1204 [2021-06-10 23:50:04,656 INFO L163 LiptonReduction]: Checked pairs total: 483 [2021-06-10 23:50:04,656 INFO L165 LiptonReduction]: Total number of compositions: 14 [2021-06-10 23:50:04,656 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 382 [2021-06-10 23:50:04,657 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:04,657 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:04,657 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:04,657 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:04,658 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:04,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:04,658 INFO L82 PathProgramCache]: Analyzing trace with hash 16291, now seen corresponding path program 1 times [2021-06-10 23:50:04,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:04,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901251362] [2021-06-10 23:50:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:04,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:04,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:04,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901251362] [2021-06-10 23:50:04,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:04,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:04,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621413936] [2021-06-10 23:50:04,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:04,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:04,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:04,673 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 61 [2021-06-10 23:50:04,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 31 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:04,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:04,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 61 [2021-06-10 23:50:04,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:04,713 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-06-10 23:50:04,713 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:04,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 15/45 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. [2021-06-10 23:50:04,713 INFO L132 encePairwiseOnDemand]: 59/61 looper letters, 0 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2021-06-10 23:50:04,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 30 transitions, 314 flow [2021-06-10 23:50:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2021-06-10 23:50:04,714 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9617486338797814 [2021-06-10 23:50:04,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 176 transitions. [2021-06-10 23:50:04,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 176 transitions. [2021-06-10 23:50:04,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:04,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 176 transitions. [2021-06-10 23:50:04,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:04,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:04,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:04,715 INFO L185 Difference]: Start difference. First operand has 60 places, 31 transitions, 314 flow. Second operand 3 states and 176 transitions. [2021-06-10 23:50:04,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 30 transitions, 314 flow [2021-06-10 23:50:04,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 30 transitions, 132 flow, removed 91 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:04,717 INFO L241 Difference]: Finished difference. Result has 61 places, 30 transitions, 132 flow [2021-06-10 23:50:04,717 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=61, PETRI_TRANSITIONS=30} [2021-06-10 23:50:04,717 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2021-06-10 23:50:04,717 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 30 transitions, 132 flow [2021-06-10 23:50:04,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:04,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:04,718 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:04,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-10 23:50:04,718 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:04,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:04,718 INFO L82 PathProgramCache]: Analyzing trace with hash -138593667, now seen corresponding path program 1 times [2021-06-10 23:50:04,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:04,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015771648] [2021-06-10 23:50:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:04,740 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:04,744 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:04,746 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:04,746 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:04,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-10 23:50:04,746 WARN L342 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:04,746 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2021-06-10 23:50:04,760 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:04,760 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:04,760 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:04,760 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:04,760 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:04,760 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:04,761 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:04,761 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:04,761 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:04,761 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:04,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 50 transitions, 385 flow [2021-06-10 23:50:04,766 INFO L129 PetriNetUnfolder]: 0/95 cut-off events. [2021-06-10 23:50:04,766 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:04,766 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 296 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-06-10 23:50:04,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 50 transitions, 385 flow [2021-06-10 23:50:04,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 48 transitions, 381 flow [2021-06-10 23:50:04,767 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:04,767 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 48 transitions, 381 flow [2021-06-10 23:50:04,767 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 48 transitions, 381 flow [2021-06-10 23:50:04,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 48 transitions, 381 flow [2021-06-10 23:50:04,771 INFO L129 PetriNetUnfolder]: 0/63 cut-off events. [2021-06-10 23:50:04,771 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:04,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 63 events. 0/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 179 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 0. Up to 16 conditions per place. [2021-06-10 23:50:04,772 INFO L151 LiptonReduction]: Number of co-enabled transitions 1380 [2021-06-10 23:50:05,195 INFO L163 LiptonReduction]: Checked pairs total: 555 [2021-06-10 23:50:05,195 INFO L165 LiptonReduction]: Total number of compositions: 15 [2021-06-10 23:50:05,195 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 428 [2021-06-10 23:50:05,196 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:05,196 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:05,196 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:05,196 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:05,198 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash 18339, now seen corresponding path program 1 times [2021-06-10 23:50:05,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:05,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610069832] [2021-06-10 23:50:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:05,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:05,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:05,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610069832] [2021-06-10 23:50:05,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:05,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:05,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331094762] [2021-06-10 23:50:05,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:05,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:05,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:05,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:05,221 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 65 [2021-06-10 23:50:05,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 33 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:05,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:05,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 65 [2021-06-10 23:50:05,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:05,225 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-06-10 23:50:05,225 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:05,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 16/48 useless extension candidates. Maximal degree in co-relation 0. Up to 16 conditions per place. [2021-06-10 23:50:05,225 INFO L132 encePairwiseOnDemand]: 63/65 looper letters, 0 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2021-06-10 23:50:05,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 32 transitions, 351 flow [2021-06-10 23:50:05,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2021-06-10 23:50:05,226 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9641025641025641 [2021-06-10 23:50:05,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 188 transitions. [2021-06-10 23:50:05,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 188 transitions. [2021-06-10 23:50:05,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:05,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 188 transitions. [2021-06-10 23:50:05,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:05,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:05,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:05,227 INFO L185 Difference]: Start difference. First operand has 64 places, 33 transitions, 351 flow. Second operand 3 states and 188 transitions. [2021-06-10 23:50:05,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 32 transitions, 351 flow [2021-06-10 23:50:05,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 32 transitions, 141 flow, removed 105 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:05,229 INFO L241 Difference]: Finished difference. Result has 65 places, 32 transitions, 141 flow [2021-06-10 23:50:05,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=65, PETRI_TRANSITIONS=32} [2021-06-10 23:50:05,229 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2021-06-10 23:50:05,229 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 32 transitions, 141 flow [2021-06-10 23:50:05,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:05,229 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:05,229 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:05,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-10 23:50:05,229 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1465640138, now seen corresponding path program 1 times [2021-06-10 23:50:05,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:05,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849337564] [2021-06-10 23:50:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:05,244 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:05,266 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:05,268 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:05,268 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:05,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-10 23:50:05,268 WARN L342 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:05,268 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2021-06-10 23:50:05,285 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:05,285 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:05,286 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:05,286 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:05,286 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:05,286 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:05,286 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:05,286 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:05,286 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:05,286 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:05,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 53 transitions, 426 flow [2021-06-10 23:50:05,292 INFO L129 PetriNetUnfolder]: 0/101 cut-off events. [2021-06-10 23:50:05,292 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:05,292 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 329 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-06-10 23:50:05,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 53 transitions, 426 flow [2021-06-10 23:50:05,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 51 transitions, 422 flow [2021-06-10 23:50:05,293 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:05,293 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 51 transitions, 422 flow [2021-06-10 23:50:05,293 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 51 transitions, 422 flow [2021-06-10 23:50:05,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 51 transitions, 422 flow [2021-06-10 23:50:05,297 INFO L129 PetriNetUnfolder]: 0/67 cut-off events. [2021-06-10 23:50:05,297 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:05,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 67 events. 0/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 175 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 0. Up to 17 conditions per place. [2021-06-10 23:50:05,299 INFO L151 LiptonReduction]: Number of co-enabled transitions 1568 [2021-06-10 23:50:05,696 INFO L163 LiptonReduction]: Checked pairs total: 632 [2021-06-10 23:50:05,697 INFO L165 LiptonReduction]: Total number of compositions: 16 [2021-06-10 23:50:05,697 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 404 [2021-06-10 23:50:05,698 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:05,698 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:05,698 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:05,698 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:05,698 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:05,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:05,698 INFO L82 PathProgramCache]: Analyzing trace with hash 20515, now seen corresponding path program 1 times [2021-06-10 23:50:05,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:05,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110064757] [2021-06-10 23:50:05,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:05,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:05,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:05,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110064757] [2021-06-10 23:50:05,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:05,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:05,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101149867] [2021-06-10 23:50:05,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:05,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:05,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:05,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:05,705 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 69 [2021-06-10 23:50:05,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 35 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:05,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:05,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 69 [2021-06-10 23:50:05,705 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:05,709 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-06-10 23:50:05,709 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:05,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 17/51 useless extension candidates. Maximal degree in co-relation 0. Up to 17 conditions per place. [2021-06-10 23:50:05,710 INFO L132 encePairwiseOnDemand]: 67/69 looper letters, 0 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2021-06-10 23:50:05,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 34 transitions, 390 flow [2021-06-10 23:50:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2021-06-10 23:50:05,710 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.966183574879227 [2021-06-10 23:50:05,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 200 transitions. [2021-06-10 23:50:05,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 200 transitions. [2021-06-10 23:50:05,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:05,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 200 transitions. [2021-06-10 23:50:05,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:05,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:05,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:05,742 INFO L185 Difference]: Start difference. First operand has 68 places, 35 transitions, 390 flow. Second operand 3 states and 200 transitions. [2021-06-10 23:50:05,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 34 transitions, 390 flow [2021-06-10 23:50:05,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 34 transitions, 150 flow, removed 120 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:05,746 INFO L241 Difference]: Finished difference. Result has 69 places, 34 transitions, 150 flow [2021-06-10 23:50:05,746 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=69, PETRI_TRANSITIONS=34} [2021-06-10 23:50:05,746 INFO L343 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2021-06-10 23:50:05,747 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 34 transitions, 150 flow [2021-06-10 23:50:05,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:05,747 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:05,747 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:05,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-10 23:50:05,747 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:05,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:05,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1833507392, now seen corresponding path program 1 times [2021-06-10 23:50:05,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:05,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081388736] [2021-06-10 23:50:05,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:05,753 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:05,759 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:05,761 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:05,761 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:05,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-10 23:50:05,762 WARN L342 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:05,764 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2021-06-10 23:50:05,775 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:05,775 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:05,776 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:05,776 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:05,776 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:05,776 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:05,776 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:05,776 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:05,776 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:05,776 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:05,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 56 transitions, 469 flow [2021-06-10 23:50:05,782 INFO L129 PetriNetUnfolder]: 0/107 cut-off events. [2021-06-10 23:50:05,783 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:05,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 107 events. 0/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 345 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 0. Up to 18 conditions per place. [2021-06-10 23:50:05,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 56 transitions, 469 flow [2021-06-10 23:50:05,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 54 transitions, 465 flow [2021-06-10 23:50:05,783 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:05,783 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 54 transitions, 465 flow [2021-06-10 23:50:05,784 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 54 transitions, 465 flow [2021-06-10 23:50:05,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 54 transitions, 465 flow [2021-06-10 23:50:05,788 INFO L129 PetriNetUnfolder]: 0/71 cut-off events. [2021-06-10 23:50:05,788 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:05,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 71 events. 0/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 185 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 0. Up to 18 conditions per place. [2021-06-10 23:50:05,789 INFO L151 LiptonReduction]: Number of co-enabled transitions 1768 [2021-06-10 23:50:06,214 INFO L163 LiptonReduction]: Checked pairs total: 714 [2021-06-10 23:50:06,215 INFO L165 LiptonReduction]: Total number of compositions: 17 [2021-06-10 23:50:06,215 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 432 [2021-06-10 23:50:06,215 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:06,216 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:06,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:06,216 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:06,216 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:06,216 INFO L82 PathProgramCache]: Analyzing trace with hash 22819, now seen corresponding path program 1 times [2021-06-10 23:50:06,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:06,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123176878] [2021-06-10 23:50:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:06,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:06,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:06,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123176878] [2021-06-10 23:50:06,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:06,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:06,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000010109] [2021-06-10 23:50:06,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:06,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:06,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:06,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:06,224 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 73 [2021-06-10 23:50:06,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 37 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:06,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:06,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 73 [2021-06-10 23:50:06,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:06,228 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-06-10 23:50:06,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:06,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 18/54 useless extension candidates. Maximal degree in co-relation 0. Up to 18 conditions per place. [2021-06-10 23:50:06,229 INFO L132 encePairwiseOnDemand]: 71/73 looper letters, 0 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2021-06-10 23:50:06,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 36 transitions, 431 flow [2021-06-10 23:50:06,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2021-06-10 23:50:06,229 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9680365296803652 [2021-06-10 23:50:06,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 212 transitions. [2021-06-10 23:50:06,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 212 transitions. [2021-06-10 23:50:06,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:06,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 212 transitions. [2021-06-10 23:50:06,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:06,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:06,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:06,231 INFO L185 Difference]: Start difference. First operand has 72 places, 37 transitions, 431 flow. Second operand 3 states and 212 transitions. [2021-06-10 23:50:06,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 36 transitions, 431 flow [2021-06-10 23:50:06,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 36 transitions, 159 flow, removed 136 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:06,233 INFO L241 Difference]: Finished difference. Result has 73 places, 36 transitions, 159 flow [2021-06-10 23:50:06,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=73, PETRI_TRANSITIONS=36} [2021-06-10 23:50:06,233 INFO L343 CegarLoopForPetriNet]: 72 programPoint places, 1 predicate places. [2021-06-10 23:50:06,233 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 36 transitions, 159 flow [2021-06-10 23:50:06,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:06,233 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:06,233 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:06,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-10 23:50:06,234 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:06,234 INFO L82 PathProgramCache]: Analyzing trace with hash 825672673, now seen corresponding path program 1 times [2021-06-10 23:50:06,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:06,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584171006] [2021-06-10 23:50:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:06,237 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:06,238 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:06,240 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:06,240 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:06,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-10 23:50:06,240 WARN L342 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:06,240 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2021-06-10 23:50:06,269 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:06,270 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:06,270 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:06,270 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:06,270 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:06,270 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:06,270 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:06,270 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:06,270 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:06,270 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:06,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 59 transitions, 514 flow [2021-06-10 23:50:06,277 INFO L129 PetriNetUnfolder]: 0/113 cut-off events. [2021-06-10 23:50:06,277 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:06,277 INFO L84 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 113 events. 0/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 366 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 0. Up to 19 conditions per place. [2021-06-10 23:50:06,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 59 transitions, 514 flow [2021-06-10 23:50:06,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 57 transitions, 510 flow [2021-06-10 23:50:06,278 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:06,278 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 57 transitions, 510 flow [2021-06-10 23:50:06,278 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 57 transitions, 510 flow [2021-06-10 23:50:06,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 57 transitions, 510 flow [2021-06-10 23:50:06,282 INFO L129 PetriNetUnfolder]: 0/75 cut-off events. [2021-06-10 23:50:06,282 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:06,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 75 events. 0/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 185 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 0. Up to 19 conditions per place. [2021-06-10 23:50:06,284 INFO L151 LiptonReduction]: Number of co-enabled transitions 1980 [2021-06-10 23:50:06,732 INFO L163 LiptonReduction]: Checked pairs total: 801 [2021-06-10 23:50:06,733 INFO L165 LiptonReduction]: Total number of compositions: 18 [2021-06-10 23:50:06,733 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 456 [2021-06-10 23:50:06,734 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:06,734 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:06,734 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:06,734 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:06,734 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:06,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:06,734 INFO L82 PathProgramCache]: Analyzing trace with hash 25251, now seen corresponding path program 1 times [2021-06-10 23:50:06,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:06,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237221712] [2021-06-10 23:50:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:06,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:06,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:06,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237221712] [2021-06-10 23:50:06,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:06,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:06,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593043561] [2021-06-10 23:50:06,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:06,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:06,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:06,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:06,742 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 77 [2021-06-10 23:50:06,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 39 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:06,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:06,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 77 [2021-06-10 23:50:06,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:06,747 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-06-10 23:50:06,747 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:06,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 19/57 useless extension candidates. Maximal degree in co-relation 0. Up to 19 conditions per place. [2021-06-10 23:50:06,747 INFO L132 encePairwiseOnDemand]: 75/77 looper letters, 0 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2021-06-10 23:50:06,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 38 transitions, 474 flow [2021-06-10 23:50:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2021-06-10 23:50:06,748 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2021-06-10 23:50:06,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2021-06-10 23:50:06,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2021-06-10 23:50:06,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:06,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2021-06-10 23:50:06,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:06,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:06,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:06,749 INFO L185 Difference]: Start difference. First operand has 76 places, 39 transitions, 474 flow. Second operand 3 states and 224 transitions. [2021-06-10 23:50:06,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 38 transitions, 474 flow [2021-06-10 23:50:06,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 38 transitions, 168 flow, removed 153 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:06,751 INFO L241 Difference]: Finished difference. Result has 77 places, 38 transitions, 168 flow [2021-06-10 23:50:06,751 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=77, PETRI_TRANSITIONS=38} [2021-06-10 23:50:06,752 INFO L343 CegarLoopForPetriNet]: 76 programPoint places, 1 predicate places. [2021-06-10 23:50:06,752 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 38 transitions, 168 flow [2021-06-10 23:50:06,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:06,752 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:06,752 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:06,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-10 23:50:06,752 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:06,752 INFO L82 PathProgramCache]: Analyzing trace with hash 334217731, now seen corresponding path program 1 times [2021-06-10 23:50:06,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:06,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585357921] [2021-06-10 23:50:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:06,755 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:06,757 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:06,758 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:06,759 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:06,759 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-10 23:50:06,759 WARN L342 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:06,759 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2021-06-10 23:50:06,773 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:06,774 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:06,774 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:06,774 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:06,774 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:06,774 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:06,774 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:06,774 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:06,774 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:06,774 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:06,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 62 transitions, 561 flow [2021-06-10 23:50:06,781 INFO L129 PetriNetUnfolder]: 0/119 cut-off events. [2021-06-10 23:50:06,782 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:06,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 119 events. 0/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 380 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 0. Up to 20 conditions per place. [2021-06-10 23:50:06,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 62 transitions, 561 flow [2021-06-10 23:50:06,782 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 60 transitions, 557 flow [2021-06-10 23:50:06,782 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:06,782 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 60 transitions, 557 flow [2021-06-10 23:50:06,783 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 60 transitions, 557 flow [2021-06-10 23:50:06,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 60 transitions, 557 flow [2021-06-10 23:50:06,788 INFO L129 PetriNetUnfolder]: 0/79 cut-off events. [2021-06-10 23:50:06,788 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:06,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 79 events. 0/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 207 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 0. Up to 20 conditions per place. [2021-06-10 23:50:06,789 INFO L151 LiptonReduction]: Number of co-enabled transitions 2204 [2021-06-10 23:50:07,705 INFO L163 LiptonReduction]: Checked pairs total: 893 [2021-06-10 23:50:07,705 INFO L165 LiptonReduction]: Total number of compositions: 19 [2021-06-10 23:50:07,706 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 924 [2021-06-10 23:50:07,706 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:07,706 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:07,706 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:07,706 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:07,707 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash 27811, now seen corresponding path program 1 times [2021-06-10 23:50:07,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:07,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046120449] [2021-06-10 23:50:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:07,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:07,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:07,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046120449] [2021-06-10 23:50:07,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:07,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:07,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459538114] [2021-06-10 23:50:07,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:07,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:07,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:07,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:07,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 81 [2021-06-10 23:50:07,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 41 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:07,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:07,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 81 [2021-06-10 23:50:07,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:07,718 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-06-10 23:50:07,718 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:07,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 20/60 useless extension candidates. Maximal degree in co-relation 0. Up to 20 conditions per place. [2021-06-10 23:50:07,719 INFO L132 encePairwiseOnDemand]: 79/81 looper letters, 0 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2021-06-10 23:50:07,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 40 transitions, 519 flow [2021-06-10 23:50:07,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2021-06-10 23:50:07,719 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9711934156378601 [2021-06-10 23:50:07,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 236 transitions. [2021-06-10 23:50:07,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 236 transitions. [2021-06-10 23:50:07,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:07,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 236 transitions. [2021-06-10 23:50:07,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:07,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:07,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:07,721 INFO L185 Difference]: Start difference. First operand has 80 places, 41 transitions, 519 flow. Second operand 3 states and 236 transitions. [2021-06-10 23:50:07,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 40 transitions, 519 flow [2021-06-10 23:50:07,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 40 transitions, 177 flow, removed 171 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:07,724 INFO L241 Difference]: Finished difference. Result has 81 places, 40 transitions, 177 flow [2021-06-10 23:50:07,724 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=81, PETRI_TRANSITIONS=40} [2021-06-10 23:50:07,724 INFO L343 CegarLoopForPetriNet]: 80 programPoint places, 1 predicate places. [2021-06-10 23:50:07,724 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 40 transitions, 177 flow [2021-06-10 23:50:07,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:07,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:07,724 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:07,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-10 23:50:07,724 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:07,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:07,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1359261028, now seen corresponding path program 1 times [2021-06-10 23:50:07,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:07,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661929579] [2021-06-10 23:50:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:07,728 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:07,729 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:07,731 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:07,731 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:07,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-10 23:50:07,731 WARN L342 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:07,731 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2021-06-10 23:50:07,748 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:07,748 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:07,748 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:07,748 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:07,748 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:07,748 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:07,748 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:07,748 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:07,748 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:07,748 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:07,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 65 transitions, 610 flow [2021-06-10 23:50:07,769 INFO L129 PetriNetUnfolder]: 0/125 cut-off events. [2021-06-10 23:50:07,770 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:07,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 125 events. 0/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 402 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 0. Up to 21 conditions per place. [2021-06-10 23:50:07,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 65 transitions, 610 flow [2021-06-10 23:50:07,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 63 transitions, 606 flow [2021-06-10 23:50:07,771 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:07,771 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 63 transitions, 606 flow [2021-06-10 23:50:07,771 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 63 transitions, 606 flow [2021-06-10 23:50:07,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 63 transitions, 606 flow [2021-06-10 23:50:07,777 INFO L129 PetriNetUnfolder]: 0/83 cut-off events. [2021-06-10 23:50:07,777 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:07,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 83 events. 0/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 223 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 0. Up to 21 conditions per place. [2021-06-10 23:50:07,779 INFO L151 LiptonReduction]: Number of co-enabled transitions 2440 [2021-06-10 23:50:08,518 INFO L163 LiptonReduction]: Checked pairs total: 990 [2021-06-10 23:50:08,519 INFO L165 LiptonReduction]: Total number of compositions: 20 [2021-06-10 23:50:08,519 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 748 [2021-06-10 23:50:08,520 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:08,520 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:08,520 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:08,520 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:08,520 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash 30499, now seen corresponding path program 1 times [2021-06-10 23:50:08,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:08,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214283981] [2021-06-10 23:50:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:08,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:08,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:08,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214283981] [2021-06-10 23:50:08,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:08,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:08,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308678202] [2021-06-10 23:50:08,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:08,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:08,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:08,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:08,527 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 85 [2021-06-10 23:50:08,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 43 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:08,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:08,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 85 [2021-06-10 23:50:08,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:08,532 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-06-10 23:50:08,532 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:08,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 21/63 useless extension candidates. Maximal degree in co-relation 0. Up to 21 conditions per place. [2021-06-10 23:50:08,532 INFO L132 encePairwiseOnDemand]: 83/85 looper letters, 0 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2021-06-10 23:50:08,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 42 transitions, 566 flow [2021-06-10 23:50:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2021-06-10 23:50:08,533 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9725490196078431 [2021-06-10 23:50:08,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2021-06-10 23:50:08,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2021-06-10 23:50:08,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:08,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2021-06-10 23:50:08,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:08,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:08,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:08,534 INFO L185 Difference]: Start difference. First operand has 84 places, 43 transitions, 566 flow. Second operand 3 states and 248 transitions. [2021-06-10 23:50:08,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 42 transitions, 566 flow [2021-06-10 23:50:08,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 42 transitions, 186 flow, removed 190 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:08,538 INFO L241 Difference]: Finished difference. Result has 85 places, 42 transitions, 186 flow [2021-06-10 23:50:08,538 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=85, PETRI_TRANSITIONS=42} [2021-06-10 23:50:08,538 INFO L343 CegarLoopForPetriNet]: 84 programPoint places, 1 predicate places. [2021-06-10 23:50:08,538 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 42 transitions, 186 flow [2021-06-10 23:50:08,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:08,538 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:08,539 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:08,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-10 23:50:08,539 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:08,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:08,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1298741190, now seen corresponding path program 1 times [2021-06-10 23:50:08,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:08,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218643630] [2021-06-10 23:50:08,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:08,542 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:08,543 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:08,545 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:08,545 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:08,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-10 23:50:08,545 WARN L342 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:08,545 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2021-06-10 23:50:08,562 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:08,562 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:08,562 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:08,562 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:08,562 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:08,562 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:08,563 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:08,563 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:08,563 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:08,563 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:08,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 68 transitions, 661 flow [2021-06-10 23:50:08,570 INFO L129 PetriNetUnfolder]: 0/131 cut-off events. [2021-06-10 23:50:08,571 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:08,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 131 events. 0/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 418 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 0. Up to 22 conditions per place. [2021-06-10 23:50:08,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 68 transitions, 661 flow [2021-06-10 23:50:08,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 66 transitions, 657 flow [2021-06-10 23:50:08,571 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:08,571 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 66 transitions, 657 flow [2021-06-10 23:50:08,572 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 66 transitions, 657 flow [2021-06-10 23:50:08,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 66 transitions, 657 flow [2021-06-10 23:50:08,577 INFO L129 PetriNetUnfolder]: 0/87 cut-off events. [2021-06-10 23:50:08,577 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:08,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 87 events. 0/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 257 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 0. Up to 22 conditions per place. [2021-06-10 23:50:08,579 INFO L151 LiptonReduction]: Number of co-enabled transitions 2688 [2021-06-10 23:50:09,227 INFO L163 LiptonReduction]: Checked pairs total: 1092 [2021-06-10 23:50:09,228 INFO L165 LiptonReduction]: Total number of compositions: 21 [2021-06-10 23:50:09,228 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 657 [2021-06-10 23:50:09,228 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:09,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:09,229 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:09,229 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:09,229 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:09,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:09,229 INFO L82 PathProgramCache]: Analyzing trace with hash 33315, now seen corresponding path program 1 times [2021-06-10 23:50:09,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:09,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649477129] [2021-06-10 23:50:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:09,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:09,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:09,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649477129] [2021-06-10 23:50:09,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:09,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:09,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207043229] [2021-06-10 23:50:09,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:09,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:09,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:09,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:09,235 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 89 [2021-06-10 23:50:09,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 45 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:09,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:09,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 89 [2021-06-10 23:50:09,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:09,240 INFO L129 PetriNetUnfolder]: 0/44 cut-off events. [2021-06-10 23:50:09,240 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:09,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 44 events. 0/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 22/66 useless extension candidates. Maximal degree in co-relation 0. Up to 22 conditions per place. [2021-06-10 23:50:09,241 INFO L132 encePairwiseOnDemand]: 87/89 looper letters, 0 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2021-06-10 23:50:09,241 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 44 transitions, 615 flow [2021-06-10 23:50:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2021-06-10 23:50:09,241 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9737827715355806 [2021-06-10 23:50:09,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2021-06-10 23:50:09,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2021-06-10 23:50:09,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:09,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2021-06-10 23:50:09,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:09,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:09,243 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:09,243 INFO L185 Difference]: Start difference. First operand has 88 places, 45 transitions, 615 flow. Second operand 3 states and 260 transitions. [2021-06-10 23:50:09,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 44 transitions, 615 flow [2021-06-10 23:50:09,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 44 transitions, 195 flow, removed 210 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:09,247 INFO L241 Difference]: Finished difference. Result has 89 places, 44 transitions, 195 flow [2021-06-10 23:50:09,247 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=89, PETRI_TRANSITIONS=44} [2021-06-10 23:50:09,247 INFO L343 CegarLoopForPetriNet]: 88 programPoint places, 1 predicate places. [2021-06-10 23:50:09,247 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 44 transitions, 195 flow [2021-06-10 23:50:09,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:09,248 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:09,248 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:09,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-10 23:50:09,248 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:09,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:09,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1084276377, now seen corresponding path program 1 times [2021-06-10 23:50:09,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:09,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303216860] [2021-06-10 23:50:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:09,251 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:09,252 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:09,254 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:09,254 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:09,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-10 23:50:09,254 WARN L342 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:09,254 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2021-06-10 23:50:09,275 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:09,275 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:09,275 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:09,275 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:09,275 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:09,275 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:09,275 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:09,276 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:09,276 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:09,276 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:09,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 71 transitions, 714 flow [2021-06-10 23:50:09,284 INFO L129 PetriNetUnfolder]: 0/137 cut-off events. [2021-06-10 23:50:09,284 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:09,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 137 events. 0/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 447 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 0. Up to 23 conditions per place. [2021-06-10 23:50:09,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 71 transitions, 714 flow [2021-06-10 23:50:09,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 69 transitions, 710 flow [2021-06-10 23:50:09,285 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:09,286 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 69 transitions, 710 flow [2021-06-10 23:50:09,286 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 69 transitions, 710 flow [2021-06-10 23:50:09,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 69 transitions, 710 flow [2021-06-10 23:50:09,292 INFO L129 PetriNetUnfolder]: 0/91 cut-off events. [2021-06-10 23:50:09,292 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:09,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 91 events. 0/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 281 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 0. Up to 23 conditions per place. [2021-06-10 23:50:09,294 INFO L151 LiptonReduction]: Number of co-enabled transitions 2948 [2021-06-10 23:50:09,946 INFO L163 LiptonReduction]: Checked pairs total: 1199 [2021-06-10 23:50:09,946 INFO L165 LiptonReduction]: Total number of compositions: 22 [2021-06-10 23:50:09,946 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 661 [2021-06-10 23:50:09,948 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:09,948 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:09,948 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:09,949 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:09,949 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash 36259, now seen corresponding path program 1 times [2021-06-10 23:50:09,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:09,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8511357] [2021-06-10 23:50:09,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:09,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:09,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:09,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8511357] [2021-06-10 23:50:09,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:09,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:09,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878459263] [2021-06-10 23:50:09,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:09,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:09,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:09,958 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 93 [2021-06-10 23:50:09,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 47 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:09,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:09,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 93 [2021-06-10 23:50:09,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:09,965 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-06-10 23:50:09,966 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:09,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 23/69 useless extension candidates. Maximal degree in co-relation 0. Up to 23 conditions per place. [2021-06-10 23:50:09,966 INFO L132 encePairwiseOnDemand]: 91/93 looper letters, 0 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2021-06-10 23:50:09,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 46 transitions, 666 flow [2021-06-10 23:50:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2021-06-10 23:50:09,967 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.974910394265233 [2021-06-10 23:50:09,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2021-06-10 23:50:09,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2021-06-10 23:50:09,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:09,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2021-06-10 23:50:09,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:09,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:09,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:09,968 INFO L185 Difference]: Start difference. First operand has 92 places, 47 transitions, 666 flow. Second operand 3 states and 272 transitions. [2021-06-10 23:50:09,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 46 transitions, 666 flow [2021-06-10 23:50:09,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 46 transitions, 204 flow, removed 231 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:09,973 INFO L241 Difference]: Finished difference. Result has 93 places, 46 transitions, 204 flow [2021-06-10 23:50:09,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=93, PETRI_TRANSITIONS=46} [2021-06-10 23:50:09,974 INFO L343 CegarLoopForPetriNet]: 92 programPoint places, 1 predicate places. [2021-06-10 23:50:09,974 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 46 transitions, 204 flow [2021-06-10 23:50:09,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:09,974 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:09,974 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:09,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-10 23:50:09,974 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1905098359, now seen corresponding path program 1 times [2021-06-10 23:50:09,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:09,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651659447] [2021-06-10 23:50:09,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:09,978 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:09,979 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:09,983 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:09,984 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:09,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-10 23:50:09,985 WARN L342 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:09,985 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2021-06-10 23:50:10,007 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:10,007 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:10,008 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:10,008 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:10,008 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:10,008 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:10,008 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:10,008 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:10,008 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:10,008 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:10,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 74 transitions, 769 flow [2021-06-10 23:50:10,019 INFO L129 PetriNetUnfolder]: 0/143 cut-off events. [2021-06-10 23:50:10,020 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:10,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 143 events. 0/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 469 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 0. Up to 24 conditions per place. [2021-06-10 23:50:10,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 74 transitions, 769 flow [2021-06-10 23:50:10,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 72 transitions, 765 flow [2021-06-10 23:50:10,022 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:10,023 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 72 transitions, 765 flow [2021-06-10 23:50:10,023 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 72 transitions, 765 flow [2021-06-10 23:50:10,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 72 transitions, 765 flow [2021-06-10 23:50:10,030 INFO L129 PetriNetUnfolder]: 0/95 cut-off events. [2021-06-10 23:50:10,030 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:10,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 95 events. 0/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 0. Up to 24 conditions per place. [2021-06-10 23:50:10,032 INFO L151 LiptonReduction]: Number of co-enabled transitions 3220 [2021-06-10 23:50:10,783 INFO L163 LiptonReduction]: Checked pairs total: 1311 [2021-06-10 23:50:10,783 INFO L165 LiptonReduction]: Total number of compositions: 23 [2021-06-10 23:50:10,783 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 761 [2021-06-10 23:50:10,784 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:10,784 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:10,784 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:10,784 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:10,784 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:10,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:10,785 INFO L82 PathProgramCache]: Analyzing trace with hash 39331, now seen corresponding path program 1 times [2021-06-10 23:50:10,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:10,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768539086] [2021-06-10 23:50:10,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:10,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:10,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:10,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768539086] [2021-06-10 23:50:10,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:10,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:10,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876419394] [2021-06-10 23:50:10,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:10,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:10,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:10,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:10,792 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 97 [2021-06-10 23:50:10,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 49 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:10,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:10,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 97 [2021-06-10 23:50:10,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:10,798 INFO L129 PetriNetUnfolder]: 0/48 cut-off events. [2021-06-10 23:50:10,798 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:10,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 48 events. 0/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 24/72 useless extension candidates. Maximal degree in co-relation 0. Up to 24 conditions per place. [2021-06-10 23:50:10,798 INFO L132 encePairwiseOnDemand]: 95/97 looper letters, 0 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2021-06-10 23:50:10,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 48 transitions, 719 flow [2021-06-10 23:50:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2021-06-10 23:50:10,799 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9759450171821306 [2021-06-10 23:50:10,799 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2021-06-10 23:50:10,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2021-06-10 23:50:10,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:10,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2021-06-10 23:50:10,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:10,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:10,801 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:10,801 INFO L185 Difference]: Start difference. First operand has 96 places, 49 transitions, 719 flow. Second operand 3 states and 284 transitions. [2021-06-10 23:50:10,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 48 transitions, 719 flow [2021-06-10 23:50:10,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 48 transitions, 213 flow, removed 253 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:10,806 INFO L241 Difference]: Finished difference. Result has 97 places, 48 transitions, 213 flow [2021-06-10 23:50:10,806 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=97, PETRI_TRANSITIONS=48} [2021-06-10 23:50:10,806 INFO L343 CegarLoopForPetriNet]: 96 programPoint places, 1 predicate places. [2021-06-10 23:50:10,806 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 48 transitions, 213 flow [2021-06-10 23:50:10,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:10,806 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:10,806 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:10,806 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-10 23:50:10,806 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:10,806 INFO L82 PathProgramCache]: Analyzing trace with hash -113046974, now seen corresponding path program 1 times [2021-06-10 23:50:10,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:10,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017854674] [2021-06-10 23:50:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:10,810 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:10,811 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:10,814 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:10,815 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:10,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-10 23:50:10,816 WARN L342 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:10,816 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2021-06-10 23:50:10,835 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:10,835 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:10,836 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:10,836 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:10,836 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:10,836 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:10,836 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:10,836 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:10,836 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:10,836 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:10,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 77 transitions, 826 flow [2021-06-10 23:50:10,846 INFO L129 PetriNetUnfolder]: 0/149 cut-off events. [2021-06-10 23:50:10,846 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:10,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 149 events. 0/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 472 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 0. Up to 25 conditions per place. [2021-06-10 23:50:10,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 77 transitions, 826 flow [2021-06-10 23:50:10,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 75 transitions, 822 flow [2021-06-10 23:50:10,847 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:10,847 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 75 transitions, 822 flow [2021-06-10 23:50:10,847 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 75 transitions, 822 flow [2021-06-10 23:50:10,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 75 transitions, 822 flow [2021-06-10 23:50:10,855 INFO L129 PetriNetUnfolder]: 0/99 cut-off events. [2021-06-10 23:50:10,855 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:10,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 99 events. 0/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 279 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 0. Up to 25 conditions per place. [2021-06-10 23:50:10,858 INFO L151 LiptonReduction]: Number of co-enabled transitions 3504 [2021-06-10 23:50:11,761 INFO L163 LiptonReduction]: Checked pairs total: 1428 [2021-06-10 23:50:11,761 INFO L165 LiptonReduction]: Total number of compositions: 24 [2021-06-10 23:50:11,762 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 915 [2021-06-10 23:50:11,762 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:11,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:11,762 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:11,762 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:11,763 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:11,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash 42531, now seen corresponding path program 1 times [2021-06-10 23:50:11,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:11,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22978688] [2021-06-10 23:50:11,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:11,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:11,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:11,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22978688] [2021-06-10 23:50:11,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:11,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:11,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270385399] [2021-06-10 23:50:11,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:11,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:11,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:11,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:11,770 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 101 [2021-06-10 23:50:11,770 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 51 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:11,770 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:11,770 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 101 [2021-06-10 23:50:11,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:11,776 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2021-06-10 23:50:11,776 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:11,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 50 events. 0/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 25/75 useless extension candidates. Maximal degree in co-relation 0. Up to 25 conditions per place. [2021-06-10 23:50:11,776 INFO L132 encePairwiseOnDemand]: 99/101 looper letters, 0 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2021-06-10 23:50:11,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 50 transitions, 774 flow [2021-06-10 23:50:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2021-06-10 23:50:11,777 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.976897689768977 [2021-06-10 23:50:11,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2021-06-10 23:50:11,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2021-06-10 23:50:11,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:11,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2021-06-10 23:50:11,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:11,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:11,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:11,778 INFO L185 Difference]: Start difference. First operand has 100 places, 51 transitions, 774 flow. Second operand 3 states and 296 transitions. [2021-06-10 23:50:11,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 50 transitions, 774 flow [2021-06-10 23:50:11,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 50 transitions, 222 flow, removed 276 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:11,783 INFO L241 Difference]: Finished difference. Result has 101 places, 50 transitions, 222 flow [2021-06-10 23:50:11,783 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=101, PETRI_TRANSITIONS=50} [2021-06-10 23:50:11,783 INFO L343 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2021-06-10 23:50:11,783 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 50 transitions, 222 flow [2021-06-10 23:50:11,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:11,783 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:11,784 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:11,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-10 23:50:11,784 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:11,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2014993076, now seen corresponding path program 1 times [2021-06-10 23:50:11,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:11,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882953828] [2021-06-10 23:50:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:11,787 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:11,789 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:11,791 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:11,791 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:11,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-10 23:50:11,791 WARN L342 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:11,791 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2021-06-10 23:50:11,819 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:11,820 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:11,820 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:11,820 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:11,820 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:11,820 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:11,820 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:11,820 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:11,820 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:11,820 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:11,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 80 transitions, 885 flow [2021-06-10 23:50:11,831 INFO L129 PetriNetUnfolder]: 0/155 cut-off events. [2021-06-10 23:50:11,831 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:11,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 155 events. 0/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 516 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 0. Up to 26 conditions per place. [2021-06-10 23:50:11,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 80 transitions, 885 flow [2021-06-10 23:50:11,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 78 transitions, 881 flow [2021-06-10 23:50:11,832 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:11,832 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 78 transitions, 881 flow [2021-06-10 23:50:11,832 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 78 transitions, 881 flow [2021-06-10 23:50:11,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 78 transitions, 881 flow [2021-06-10 23:50:11,840 INFO L129 PetriNetUnfolder]: 0/103 cut-off events. [2021-06-10 23:50:11,840 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:11,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 103 events. 0/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 0. Up to 26 conditions per place. [2021-06-10 23:50:11,843 INFO L151 LiptonReduction]: Number of co-enabled transitions 3800 [2021-06-10 23:50:12,802 INFO L163 LiptonReduction]: Checked pairs total: 1550 [2021-06-10 23:50:12,802 INFO L165 LiptonReduction]: Total number of compositions: 25 [2021-06-10 23:50:12,802 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 970 [2021-06-10 23:50:12,803 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:12,803 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:12,803 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:12,803 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:12,803 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash 45859, now seen corresponding path program 1 times [2021-06-10 23:50:12,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:12,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468708874] [2021-06-10 23:50:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:12,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:12,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:12,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468708874] [2021-06-10 23:50:12,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:12,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:12,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305228461] [2021-06-10 23:50:12,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:12,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:12,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:12,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:12,811 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 105 [2021-06-10 23:50:12,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 53 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:12,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:12,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 105 [2021-06-10 23:50:12,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:12,818 INFO L129 PetriNetUnfolder]: 0/52 cut-off events. [2021-06-10 23:50:12,818 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:12,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 52 events. 0/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 26/78 useless extension candidates. Maximal degree in co-relation 0. Up to 26 conditions per place. [2021-06-10 23:50:12,818 INFO L132 encePairwiseOnDemand]: 103/105 looper letters, 0 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2021-06-10 23:50:12,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 52 transitions, 831 flow [2021-06-10 23:50:12,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2021-06-10 23:50:12,819 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9777777777777777 [2021-06-10 23:50:12,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2021-06-10 23:50:12,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2021-06-10 23:50:12,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:12,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2021-06-10 23:50:12,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:12,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:12,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:12,821 INFO L185 Difference]: Start difference. First operand has 104 places, 53 transitions, 831 flow. Second operand 3 states and 308 transitions. [2021-06-10 23:50:12,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 52 transitions, 831 flow [2021-06-10 23:50:12,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 52 transitions, 231 flow, removed 300 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:12,826 INFO L241 Difference]: Finished difference. Result has 105 places, 52 transitions, 231 flow [2021-06-10 23:50:12,827 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=105, PETRI_TRANSITIONS=52} [2021-06-10 23:50:12,827 INFO L343 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2021-06-10 23:50:12,827 INFO L480 AbstractCegarLoop]: Abstraction has has 105 places, 52 transitions, 231 flow [2021-06-10 23:50:12,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:12,827 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:12,827 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:12,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-10 23:50:12,827 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:12,828 INFO L82 PathProgramCache]: Analyzing trace with hash -4577491, now seen corresponding path program 1 times [2021-06-10 23:50:12,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:12,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523945643] [2021-06-10 23:50:12,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:12,831 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:12,833 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:12,835 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:12,835 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:12,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-10 23:50:12,835 WARN L342 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:12,835 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2021-06-10 23:50:12,855 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:12,855 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:12,855 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:12,855 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:12,856 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:12,856 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:12,856 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:12,856 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:12,856 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:12,856 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:12,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 136 places, 83 transitions, 946 flow [2021-06-10 23:50:12,866 INFO L129 PetriNetUnfolder]: 0/161 cut-off events. [2021-06-10 23:50:12,866 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:12,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 161 events. 0/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 506 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 0. Up to 27 conditions per place. [2021-06-10 23:50:12,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 83 transitions, 946 flow [2021-06-10 23:50:12,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 81 transitions, 942 flow [2021-06-10 23:50:12,868 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:12,868 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 81 transitions, 942 flow [2021-06-10 23:50:12,868 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 81 transitions, 942 flow [2021-06-10 23:50:12,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 81 transitions, 942 flow [2021-06-10 23:50:12,876 INFO L129 PetriNetUnfolder]: 0/107 cut-off events. [2021-06-10 23:50:12,876 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:12,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 107 events. 0/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 0. Up to 27 conditions per place. [2021-06-10 23:50:12,879 INFO L151 LiptonReduction]: Number of co-enabled transitions 4108 [2021-06-10 23:50:13,867 INFO L163 LiptonReduction]: Checked pairs total: 1677 [2021-06-10 23:50:13,868 INFO L165 LiptonReduction]: Total number of compositions: 26 [2021-06-10 23:50:13,868 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1000 [2021-06-10 23:50:13,869 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:13,869 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:13,869 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:13,869 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:13,869 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:13,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:13,869 INFO L82 PathProgramCache]: Analyzing trace with hash 49315, now seen corresponding path program 1 times [2021-06-10 23:50:13,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:13,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398202217] [2021-06-10 23:50:13,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:13,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:13,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:13,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398202217] [2021-06-10 23:50:13,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:13,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:13,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706920520] [2021-06-10 23:50:13,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:13,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:13,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:13,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:13,885 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 109 [2021-06-10 23:50:13,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 55 transitions, 890 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:13,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:13,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 109 [2021-06-10 23:50:13,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:13,891 INFO L129 PetriNetUnfolder]: 0/54 cut-off events. [2021-06-10 23:50:13,891 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:13,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 54 events. 0/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 27/81 useless extension candidates. Maximal degree in co-relation 0. Up to 27 conditions per place. [2021-06-10 23:50:13,892 INFO L132 encePairwiseOnDemand]: 107/109 looper letters, 0 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2021-06-10 23:50:13,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 54 transitions, 890 flow [2021-06-10 23:50:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2021-06-10 23:50:13,892 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9785932721712538 [2021-06-10 23:50:13,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2021-06-10 23:50:13,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2021-06-10 23:50:13,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:13,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2021-06-10 23:50:13,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:13,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:13,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:13,894 INFO L185 Difference]: Start difference. First operand has 108 places, 55 transitions, 890 flow. Second operand 3 states and 320 transitions. [2021-06-10 23:50:13,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 54 transitions, 890 flow [2021-06-10 23:50:13,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 54 transitions, 240 flow, removed 325 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:13,900 INFO L241 Difference]: Finished difference. Result has 109 places, 54 transitions, 240 flow [2021-06-10 23:50:13,900 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=109, PETRI_TRANSITIONS=54} [2021-06-10 23:50:13,900 INFO L343 CegarLoopForPetriNet]: 108 programPoint places, 1 predicate places. [2021-06-10 23:50:13,900 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 54 transitions, 240 flow [2021-06-10 23:50:13,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:13,901 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:13,901 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:13,901 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-10 23:50:13,901 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:13,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:13,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1477290255, now seen corresponding path program 1 times [2021-06-10 23:50:13,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:13,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371182464] [2021-06-10 23:50:13,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:13,910 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:13,911 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:13,917 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:13,917 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:13,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-10 23:50:13,917 WARN L342 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:13,918 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2021-06-10 23:50:13,935 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:13,935 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:13,935 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:13,936 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:13,936 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:13,936 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:13,936 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:13,936 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:13,936 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:13,936 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:13,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 141 places, 86 transitions, 1009 flow [2021-06-10 23:50:13,951 INFO L129 PetriNetUnfolder]: 0/167 cut-off events. [2021-06-10 23:50:13,951 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:13,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 167 events. 0/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 561 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 0. Up to 28 conditions per place. [2021-06-10 23:50:13,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 86 transitions, 1009 flow [2021-06-10 23:50:13,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 84 transitions, 1005 flow [2021-06-10 23:50:13,952 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:13,952 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 84 transitions, 1005 flow [2021-06-10 23:50:13,953 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 84 transitions, 1005 flow [2021-06-10 23:50:13,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 84 transitions, 1005 flow [2021-06-10 23:50:13,961 INFO L129 PetriNetUnfolder]: 0/111 cut-off events. [2021-06-10 23:50:13,961 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:13,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 111 events. 0/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 304 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 0. Up to 28 conditions per place. [2021-06-10 23:50:13,964 INFO L151 LiptonReduction]: Number of co-enabled transitions 4428 [2021-06-10 23:50:14,991 INFO L163 LiptonReduction]: Checked pairs total: 1809 [2021-06-10 23:50:14,991 INFO L165 LiptonReduction]: Total number of compositions: 27 [2021-06-10 23:50:14,991 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1039 [2021-06-10 23:50:14,992 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:14,992 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:14,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:14,992 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:14,992 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash 52899, now seen corresponding path program 1 times [2021-06-10 23:50:14,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:14,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959566579] [2021-06-10 23:50:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:15,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:15,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:15,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959566579] [2021-06-10 23:50:15,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:15,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:15,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873346175] [2021-06-10 23:50:15,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:15,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:15,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:15,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:15,004 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 113 [2021-06-10 23:50:15,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 57 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:15,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:15,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 113 [2021-06-10 23:50:15,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:15,011 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2021-06-10 23:50:15,011 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:15,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 56 events. 0/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 28/84 useless extension candidates. Maximal degree in co-relation 0. Up to 28 conditions per place. [2021-06-10 23:50:15,012 INFO L132 encePairwiseOnDemand]: 111/113 looper letters, 0 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2021-06-10 23:50:15,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 56 transitions, 951 flow [2021-06-10 23:50:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2021-06-10 23:50:15,012 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9793510324483776 [2021-06-10 23:50:15,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2021-06-10 23:50:15,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2021-06-10 23:50:15,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:15,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2021-06-10 23:50:15,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:15,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:15,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:15,014 INFO L185 Difference]: Start difference. First operand has 112 places, 57 transitions, 951 flow. Second operand 3 states and 332 transitions. [2021-06-10 23:50:15,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 56 transitions, 951 flow [2021-06-10 23:50:15,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 56 transitions, 249 flow, removed 351 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:15,020 INFO L241 Difference]: Finished difference. Result has 113 places, 56 transitions, 249 flow [2021-06-10 23:50:15,020 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=113, PETRI_TRANSITIONS=56} [2021-06-10 23:50:15,021 INFO L343 CegarLoopForPetriNet]: 112 programPoint places, 1 predicate places. [2021-06-10 23:50:15,021 INFO L480 AbstractCegarLoop]: Abstraction has has 113 places, 56 transitions, 249 flow [2021-06-10 23:50:15,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:15,021 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:15,021 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:15,021 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-10 23:50:15,021 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:15,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1932848600, now seen corresponding path program 1 times [2021-06-10 23:50:15,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:15,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357650608] [2021-06-10 23:50:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:15,026 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:15,028 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:15,030 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:15,030 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:15,030 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-10 23:50:15,030 WARN L342 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:15,030 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2021-06-10 23:50:15,052 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:15,052 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:15,053 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:15,053 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:15,053 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:15,053 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:15,053 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:15,053 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:15,053 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:15,053 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:15,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 89 transitions, 1074 flow [2021-06-10 23:50:15,084 INFO L129 PetriNetUnfolder]: 0/173 cut-off events. [2021-06-10 23:50:15,085 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:15,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 173 events. 0/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 571 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 0. Up to 29 conditions per place. [2021-06-10 23:50:15,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 89 transitions, 1074 flow [2021-06-10 23:50:15,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 87 transitions, 1070 flow [2021-06-10 23:50:15,086 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:15,086 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 87 transitions, 1070 flow [2021-06-10 23:50:15,086 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 87 transitions, 1070 flow [2021-06-10 23:50:15,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 144 places, 87 transitions, 1070 flow [2021-06-10 23:50:15,095 INFO L129 PetriNetUnfolder]: 0/115 cut-off events. [2021-06-10 23:50:15,095 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:15,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 115 events. 0/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 0. Up to 29 conditions per place. [2021-06-10 23:50:15,100 INFO L151 LiptonReduction]: Number of co-enabled transitions 4760 [2021-06-10 23:50:16,153 INFO L163 LiptonReduction]: Checked pairs total: 1946 [2021-06-10 23:50:16,154 INFO L165 LiptonReduction]: Total number of compositions: 28 [2021-06-10 23:50:16,154 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1068 [2021-06-10 23:50:16,154 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:16,155 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:16,155 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:16,155 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:16,155 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:16,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:16,155 INFO L82 PathProgramCache]: Analyzing trace with hash 56611, now seen corresponding path program 1 times [2021-06-10 23:50:16,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:16,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740894542] [2021-06-10 23:50:16,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:16,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:16,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:16,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740894542] [2021-06-10 23:50:16,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:16,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:16,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306842583] [2021-06-10 23:50:16,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:16,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:16,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:16,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:16,165 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 117 [2021-06-10 23:50:16,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 59 transitions, 1014 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:16,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:16,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 117 [2021-06-10 23:50:16,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:16,173 INFO L129 PetriNetUnfolder]: 0/58 cut-off events. [2021-06-10 23:50:16,173 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:16,173 INFO L84 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 58 events. 0/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 29/87 useless extension candidates. Maximal degree in co-relation 0. Up to 29 conditions per place. [2021-06-10 23:50:16,174 INFO L132 encePairwiseOnDemand]: 115/117 looper letters, 0 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2021-06-10 23:50:16,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 58 transitions, 1014 flow [2021-06-10 23:50:16,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2021-06-10 23:50:16,174 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.98005698005698 [2021-06-10 23:50:16,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2021-06-10 23:50:16,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2021-06-10 23:50:16,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:16,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2021-06-10 23:50:16,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:16,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:16,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:16,176 INFO L185 Difference]: Start difference. First operand has 116 places, 59 transitions, 1014 flow. Second operand 3 states and 344 transitions. [2021-06-10 23:50:16,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 58 transitions, 1014 flow [2021-06-10 23:50:16,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 58 transitions, 258 flow, removed 378 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:16,183 INFO L241 Difference]: Finished difference. Result has 117 places, 58 transitions, 258 flow [2021-06-10 23:50:16,183 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=117, PETRI_TRANSITIONS=58} [2021-06-10 23:50:16,183 INFO L343 CegarLoopForPetriNet]: 116 programPoint places, 1 predicate places. [2021-06-10 23:50:16,183 INFO L480 AbstractCegarLoop]: Abstraction has has 117 places, 58 transitions, 258 flow [2021-06-10 23:50:16,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:16,183 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:16,183 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:16,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-10 23:50:16,184 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1008561454, now seen corresponding path program 1 times [2021-06-10 23:50:16,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:16,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496488] [2021-06-10 23:50:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:16,188 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:16,189 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:16,191 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:16,191 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:16,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-10 23:50:16,191 WARN L342 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:16,192 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2021-06-10 23:50:16,211 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:16,212 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:16,212 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:16,212 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:16,212 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:16,212 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:16,212 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:16,212 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:16,212 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:16,212 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:16,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 92 transitions, 1141 flow [2021-06-10 23:50:16,225 INFO L129 PetriNetUnfolder]: 0/179 cut-off events. [2021-06-10 23:50:16,225 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:16,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 179 events. 0/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 587 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 0. Up to 30 conditions per place. [2021-06-10 23:50:16,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 92 transitions, 1141 flow [2021-06-10 23:50:16,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 90 transitions, 1137 flow [2021-06-10 23:50:16,226 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:16,226 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 90 transitions, 1137 flow [2021-06-10 23:50:16,226 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 90 transitions, 1137 flow [2021-06-10 23:50:16,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 90 transitions, 1137 flow [2021-06-10 23:50:16,236 INFO L129 PetriNetUnfolder]: 0/119 cut-off events. [2021-06-10 23:50:16,236 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:16,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 119 events. 0/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 333 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 0. Up to 30 conditions per place. [2021-06-10 23:50:16,240 INFO L151 LiptonReduction]: Number of co-enabled transitions 5104 [2021-06-10 23:50:18,097 INFO L163 LiptonReduction]: Checked pairs total: 2088 [2021-06-10 23:50:18,097 INFO L165 LiptonReduction]: Total number of compositions: 29 [2021-06-10 23:50:18,097 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1871 [2021-06-10 23:50:18,098 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:18,098 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:18,098 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:18,098 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:18,098 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:18,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash 60451, now seen corresponding path program 1 times [2021-06-10 23:50:18,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:18,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164626444] [2021-06-10 23:50:18,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:18,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:18,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:18,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164626444] [2021-06-10 23:50:18,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:18,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:18,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508485991] [2021-06-10 23:50:18,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:18,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:18,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:18,120 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 121 [2021-06-10 23:50:18,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 61 transitions, 1079 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:18,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:18,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 121 [2021-06-10 23:50:18,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:18,127 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-06-10 23:50:18,127 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:18,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 60 events. 0/60 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 30/90 useless extension candidates. Maximal degree in co-relation 0. Up to 30 conditions per place. [2021-06-10 23:50:18,128 INFO L132 encePairwiseOnDemand]: 119/121 looper letters, 0 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2021-06-10 23:50:18,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 60 transitions, 1079 flow [2021-06-10 23:50:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2021-06-10 23:50:18,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9807162534435262 [2021-06-10 23:50:18,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2021-06-10 23:50:18,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2021-06-10 23:50:18,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:18,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2021-06-10 23:50:18,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:18,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:18,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:18,130 INFO L185 Difference]: Start difference. First operand has 120 places, 61 transitions, 1079 flow. Second operand 3 states and 356 transitions. [2021-06-10 23:50:18,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 60 transitions, 1079 flow [2021-06-10 23:50:18,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 60 transitions, 267 flow, removed 406 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:18,154 INFO L241 Difference]: Finished difference. Result has 121 places, 60 transitions, 267 flow [2021-06-10 23:50:18,154 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=121, PETRI_TRANSITIONS=60} [2021-06-10 23:50:18,164 INFO L343 CegarLoopForPetriNet]: 120 programPoint places, 1 predicate places. [2021-06-10 23:50:18,164 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 60 transitions, 267 flow [2021-06-10 23:50:18,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:18,164 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:18,164 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:18,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-10 23:50:18,164 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:18,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1949254963, now seen corresponding path program 1 times [2021-06-10 23:50:18,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:18,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454024359] [2021-06-10 23:50:18,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:18,169 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:18,170 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:18,173 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:18,173 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:18,173 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-10 23:50:18,173 WARN L342 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:18,173 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2021-06-10 23:50:18,210 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:18,210 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:18,211 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:18,211 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:18,211 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:18,211 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:18,211 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:18,211 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:18,211 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:18,211 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:18,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 95 transitions, 1210 flow [2021-06-10 23:50:18,240 INFO L129 PetriNetUnfolder]: 0/185 cut-off events. [2021-06-10 23:50:18,240 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:18,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 185 events. 0/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 599 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 0. Up to 31 conditions per place. [2021-06-10 23:50:18,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 95 transitions, 1210 flow [2021-06-10 23:50:18,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 93 transitions, 1206 flow [2021-06-10 23:50:18,242 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:18,242 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 93 transitions, 1206 flow [2021-06-10 23:50:18,242 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 93 transitions, 1206 flow [2021-06-10 23:50:18,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 93 transitions, 1206 flow [2021-06-10 23:50:18,268 INFO L129 PetriNetUnfolder]: 0/123 cut-off events. [2021-06-10 23:50:18,268 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:18,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 123 events. 0/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 0. Up to 31 conditions per place. [2021-06-10 23:50:18,271 INFO L151 LiptonReduction]: Number of co-enabled transitions 5460 [2021-06-10 23:50:19,674 INFO L163 LiptonReduction]: Checked pairs total: 2235 [2021-06-10 23:50:19,675 INFO L165 LiptonReduction]: Total number of compositions: 30 [2021-06-10 23:50:19,675 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1433 [2021-06-10 23:50:19,675 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:19,676 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:19,676 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:19,676 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:19,676 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:19,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash 64419, now seen corresponding path program 1 times [2021-06-10 23:50:19,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:19,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884451607] [2021-06-10 23:50:19,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:19,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:19,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:19,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884451607] [2021-06-10 23:50:19,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:19,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:19,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392846166] [2021-06-10 23:50:19,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:19,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:19,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:19,684 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 125 [2021-06-10 23:50:19,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 63 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:19,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:19,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 125 [2021-06-10 23:50:19,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:19,692 INFO L129 PetriNetUnfolder]: 0/62 cut-off events. [2021-06-10 23:50:19,692 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:19,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 62 events. 0/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 31/93 useless extension candidates. Maximal degree in co-relation 0. Up to 31 conditions per place. [2021-06-10 23:50:19,692 INFO L132 encePairwiseOnDemand]: 123/125 looper letters, 0 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2021-06-10 23:50:19,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 62 transitions, 1146 flow [2021-06-10 23:50:19,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2021-06-10 23:50:19,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9813333333333333 [2021-06-10 23:50:19,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2021-06-10 23:50:19,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2021-06-10 23:50:19,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:19,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2021-06-10 23:50:19,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:19,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:19,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:19,694 INFO L185 Difference]: Start difference. First operand has 124 places, 63 transitions, 1146 flow. Second operand 3 states and 368 transitions. [2021-06-10 23:50:19,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 62 transitions, 1146 flow [2021-06-10 23:50:19,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 62 transitions, 276 flow, removed 435 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:19,703 INFO L241 Difference]: Finished difference. Result has 125 places, 62 transitions, 276 flow [2021-06-10 23:50:19,703 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=125, PETRI_TRANSITIONS=62} [2021-06-10 23:50:19,703 INFO L343 CegarLoopForPetriNet]: 124 programPoint places, 1 predicate places. [2021-06-10 23:50:19,703 INFO L480 AbstractCegarLoop]: Abstraction has has 125 places, 62 transitions, 276 flow [2021-06-10 23:50:19,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:19,703 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:19,704 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:19,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-10 23:50:19,704 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:19,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:19,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2018076821, now seen corresponding path program 1 times [2021-06-10 23:50:19,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:19,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839135694] [2021-06-10 23:50:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:19,708 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:19,709 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:19,712 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:19,712 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:19,712 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-10 23:50:19,712 WARN L342 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:19,712 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2021-06-10 23:50:19,734 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:19,735 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:19,735 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:19,735 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:19,735 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:19,735 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:19,735 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:19,735 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:19,735 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:19,735 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:19,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 98 transitions, 1281 flow [2021-06-10 23:50:19,749 INFO L129 PetriNetUnfolder]: 0/191 cut-off events. [2021-06-10 23:50:19,750 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:19,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 191 events. 0/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 620 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 0. Up to 32 conditions per place. [2021-06-10 23:50:19,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 98 transitions, 1281 flow [2021-06-10 23:50:19,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 96 transitions, 1277 flow [2021-06-10 23:50:19,751 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:19,751 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 96 transitions, 1277 flow [2021-06-10 23:50:19,751 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 96 transitions, 1277 flow [2021-06-10 23:50:19,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 159 places, 96 transitions, 1277 flow [2021-06-10 23:50:19,761 INFO L129 PetriNetUnfolder]: 0/127 cut-off events. [2021-06-10 23:50:19,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:19,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 127 events. 0/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 353 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 0. Up to 32 conditions per place. [2021-06-10 23:50:19,765 INFO L151 LiptonReduction]: Number of co-enabled transitions 5828 [2021-06-10 23:50:21,000 INFO L163 LiptonReduction]: Checked pairs total: 2387 [2021-06-10 23:50:21,000 INFO L165 LiptonReduction]: Total number of compositions: 31 [2021-06-10 23:50:21,000 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1249 [2021-06-10 23:50:21,001 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:21,001 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:21,001 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:21,001 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:21,001 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:21,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:21,001 INFO L82 PathProgramCache]: Analyzing trace with hash 68515, now seen corresponding path program 1 times [2021-06-10 23:50:21,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:21,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637478033] [2021-06-10 23:50:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:21,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:21,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:21,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637478033] [2021-06-10 23:50:21,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:21,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:21,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129702630] [2021-06-10 23:50:21,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:21,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:21,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:21,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:21,010 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 129 [2021-06-10 23:50:21,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 65 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:21,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:21,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 129 [2021-06-10 23:50:21,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:21,018 INFO L129 PetriNetUnfolder]: 0/64 cut-off events. [2021-06-10 23:50:21,018 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:21,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 64 events. 0/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 32/96 useless extension candidates. Maximal degree in co-relation 0. Up to 32 conditions per place. [2021-06-10 23:50:21,018 INFO L132 encePairwiseOnDemand]: 127/129 looper letters, 0 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2021-06-10 23:50:21,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 64 transitions, 1215 flow [2021-06-10 23:50:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2021-06-10 23:50:21,019 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9819121447028424 [2021-06-10 23:50:21,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2021-06-10 23:50:21,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2021-06-10 23:50:21,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:21,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2021-06-10 23:50:21,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:21,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:21,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:21,021 INFO L185 Difference]: Start difference. First operand has 128 places, 65 transitions, 1215 flow. Second operand 3 states and 380 transitions. [2021-06-10 23:50:21,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 64 transitions, 1215 flow [2021-06-10 23:50:21,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 64 transitions, 285 flow, removed 465 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:21,030 INFO L241 Difference]: Finished difference. Result has 129 places, 64 transitions, 285 flow [2021-06-10 23:50:21,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=285, PETRI_PLACES=129, PETRI_TRANSITIONS=64} [2021-06-10 23:50:21,030 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2021-06-10 23:50:21,030 INFO L480 AbstractCegarLoop]: Abstraction has has 129 places, 64 transitions, 285 flow [2021-06-10 23:50:21,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:21,030 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:21,031 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:21,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-10 23:50:21,031 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:21,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1642907058, now seen corresponding path program 1 times [2021-06-10 23:50:21,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:21,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491792759] [2021-06-10 23:50:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:21,035 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:21,036 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:21,042 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:21,042 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:21,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-06-10 23:50:21,042 WARN L342 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:21,042 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2021-06-10 23:50:21,073 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:21,073 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:21,074 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:21,074 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:21,074 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:21,074 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:21,074 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:21,074 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:21,074 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:21,074 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:21,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 101 transitions, 1354 flow [2021-06-10 23:50:21,089 INFO L129 PetriNetUnfolder]: 0/197 cut-off events. [2021-06-10 23:50:21,089 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:21,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 197 events. 0/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 637 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 0. Up to 33 conditions per place. [2021-06-10 23:50:21,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 101 transitions, 1354 flow [2021-06-10 23:50:21,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 99 transitions, 1350 flow [2021-06-10 23:50:21,090 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:21,090 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 99 transitions, 1350 flow [2021-06-10 23:50:21,090 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 99 transitions, 1350 flow [2021-06-10 23:50:21,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 164 places, 99 transitions, 1350 flow [2021-06-10 23:50:21,102 INFO L129 PetriNetUnfolder]: 0/131 cut-off events. [2021-06-10 23:50:21,102 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:21,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 131 events. 0/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 0. Up to 33 conditions per place. [2021-06-10 23:50:21,105 INFO L151 LiptonReduction]: Number of co-enabled transitions 6208 [2021-06-10 23:50:22,509 INFO L163 LiptonReduction]: Checked pairs total: 2544 [2021-06-10 23:50:22,509 INFO L165 LiptonReduction]: Total number of compositions: 32 [2021-06-10 23:50:22,509 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1419 [2021-06-10 23:50:22,510 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:22,510 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:22,511 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:22,511 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:22,511 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:22,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:22,511 INFO L82 PathProgramCache]: Analyzing trace with hash 72739, now seen corresponding path program 1 times [2021-06-10 23:50:22,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:22,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967110119] [2021-06-10 23:50:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:22,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:22,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:22,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967110119] [2021-06-10 23:50:22,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:22,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:22,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486647181] [2021-06-10 23:50:22,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:22,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:22,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:22,527 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 133 [2021-06-10 23:50:22,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 67 transitions, 1286 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:22,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:22,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 133 [2021-06-10 23:50:22,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:22,536 INFO L129 PetriNetUnfolder]: 0/66 cut-off events. [2021-06-10 23:50:22,536 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:22,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 66 events. 0/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 33/99 useless extension candidates. Maximal degree in co-relation 0. Up to 33 conditions per place. [2021-06-10 23:50:22,553 INFO L132 encePairwiseOnDemand]: 131/133 looper letters, 0 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2021-06-10 23:50:22,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 66 transitions, 1286 flow [2021-06-10 23:50:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2021-06-10 23:50:22,554 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9824561403508771 [2021-06-10 23:50:22,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2021-06-10 23:50:22,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2021-06-10 23:50:22,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:22,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2021-06-10 23:50:22,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:22,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:22,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:22,556 INFO L185 Difference]: Start difference. First operand has 132 places, 67 transitions, 1286 flow. Second operand 3 states and 392 transitions. [2021-06-10 23:50:22,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 66 transitions, 1286 flow [2021-06-10 23:50:22,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 66 transitions, 294 flow, removed 496 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:22,566 INFO L241 Difference]: Finished difference. Result has 133 places, 66 transitions, 294 flow [2021-06-10 23:50:22,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=133, PETRI_TRANSITIONS=66} [2021-06-10 23:50:22,567 INFO L343 CegarLoopForPetriNet]: 132 programPoint places, 1 predicate places. [2021-06-10 23:50:22,567 INFO L480 AbstractCegarLoop]: Abstraction has has 133 places, 66 transitions, 294 flow [2021-06-10 23:50:22,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:22,567 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:22,584 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:22,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-06-10 23:50:22,585 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:22,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:22,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1398026328, now seen corresponding path program 1 times [2021-06-10 23:50:22,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:22,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112604791] [2021-06-10 23:50:22,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:22,592 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:22,593 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:22,597 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:22,597 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:22,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-06-10 23:50:22,597 WARN L342 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:22,597 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2021-06-10 23:50:22,634 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:22,635 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:22,635 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:22,635 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:22,635 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:22,635 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:22,635 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:22,635 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:22,635 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:22,635 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:22,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 104 transitions, 1429 flow [2021-06-10 23:50:22,652 INFO L129 PetriNetUnfolder]: 0/203 cut-off events. [2021-06-10 23:50:22,652 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:22,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 203 events. 0/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 653 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 0. Up to 34 conditions per place. [2021-06-10 23:50:22,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 104 transitions, 1429 flow [2021-06-10 23:50:22,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 102 transitions, 1425 flow [2021-06-10 23:50:22,653 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:22,653 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 102 transitions, 1425 flow [2021-06-10 23:50:22,653 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 102 transitions, 1425 flow [2021-06-10 23:50:22,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 102 transitions, 1425 flow [2021-06-10 23:50:22,665 INFO L129 PetriNetUnfolder]: 0/135 cut-off events. [2021-06-10 23:50:22,665 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:22,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 135 events. 0/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 432 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 0. Up to 34 conditions per place. [2021-06-10 23:50:22,670 INFO L151 LiptonReduction]: Number of co-enabled transitions 6600 [2021-06-10 23:50:24,098 INFO L163 LiptonReduction]: Checked pairs total: 2706 [2021-06-10 23:50:24,098 INFO L165 LiptonReduction]: Total number of compositions: 33 [2021-06-10 23:50:24,098 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1445 [2021-06-10 23:50:24,099 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:24,099 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:24,099 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:24,099 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:24,099 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:24,099 INFO L82 PathProgramCache]: Analyzing trace with hash 77091, now seen corresponding path program 1 times [2021-06-10 23:50:24,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:24,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836594749] [2021-06-10 23:50:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:24,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:24,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:24,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836594749] [2021-06-10 23:50:24,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:24,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:24,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54668153] [2021-06-10 23:50:24,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:24,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:24,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:24,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:24,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 137 [2021-06-10 23:50:24,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 69 transitions, 1359 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:24,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:24,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 137 [2021-06-10 23:50:24,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:24,117 INFO L129 PetriNetUnfolder]: 0/68 cut-off events. [2021-06-10 23:50:24,117 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:24,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 68 events. 0/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 34/102 useless extension candidates. Maximal degree in co-relation 0. Up to 34 conditions per place. [2021-06-10 23:50:24,117 INFO L132 encePairwiseOnDemand]: 135/137 looper letters, 0 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2021-06-10 23:50:24,117 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 68 transitions, 1359 flow [2021-06-10 23:50:24,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2021-06-10 23:50:24,118 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9829683698296837 [2021-06-10 23:50:24,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2021-06-10 23:50:24,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2021-06-10 23:50:24,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:24,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2021-06-10 23:50:24,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:24,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:24,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:24,120 INFO L185 Difference]: Start difference. First operand has 136 places, 69 transitions, 1359 flow. Second operand 3 states and 404 transitions. [2021-06-10 23:50:24,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 68 transitions, 1359 flow [2021-06-10 23:50:24,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 68 transitions, 303 flow, removed 528 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:24,130 INFO L241 Difference]: Finished difference. Result has 137 places, 68 transitions, 303 flow [2021-06-10 23:50:24,130 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=137, PETRI_TRANSITIONS=68} [2021-06-10 23:50:24,130 INFO L343 CegarLoopForPetriNet]: 136 programPoint places, 1 predicate places. [2021-06-10 23:50:24,130 INFO L480 AbstractCegarLoop]: Abstraction has has 137 places, 68 transitions, 303 flow [2021-06-10 23:50:24,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:24,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:24,131 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:24,131 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-06-10 23:50:24,131 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:24,131 INFO L82 PathProgramCache]: Analyzing trace with hash -103388295, now seen corresponding path program 1 times [2021-06-10 23:50:24,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:24,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683131695] [2021-06-10 23:50:24,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:24,135 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:24,136 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:24,140 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:24,140 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:24,140 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-06-10 23:50:24,140 WARN L342 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:24,140 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2021-06-10 23:50:24,164 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:24,164 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:24,164 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:24,164 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:24,164 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:24,164 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:24,164 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:24,164 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:24,164 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:24,165 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:24,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 176 places, 107 transitions, 1506 flow [2021-06-10 23:50:24,181 INFO L129 PetriNetUnfolder]: 0/209 cut-off events. [2021-06-10 23:50:24,181 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:24,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 209 events. 0/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 676 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 0. Up to 35 conditions per place. [2021-06-10 23:50:24,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 107 transitions, 1506 flow [2021-06-10 23:50:24,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 105 transitions, 1502 flow [2021-06-10 23:50:24,182 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:24,182 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 105 transitions, 1502 flow [2021-06-10 23:50:24,183 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 105 transitions, 1502 flow [2021-06-10 23:50:24,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 174 places, 105 transitions, 1502 flow [2021-06-10 23:50:24,196 INFO L129 PetriNetUnfolder]: 0/139 cut-off events. [2021-06-10 23:50:24,196 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:24,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 139 events. 0/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 359 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 0. Up to 35 conditions per place. [2021-06-10 23:50:24,200 INFO L151 LiptonReduction]: Number of co-enabled transitions 7004 [2021-06-10 23:50:25,760 INFO L163 LiptonReduction]: Checked pairs total: 2873 [2021-06-10 23:50:25,760 INFO L165 LiptonReduction]: Total number of compositions: 34 [2021-06-10 23:50:25,760 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1578 [2021-06-10 23:50:25,761 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:25,761 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:25,761 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:25,761 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:25,761 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:25,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:25,761 INFO L82 PathProgramCache]: Analyzing trace with hash 81571, now seen corresponding path program 1 times [2021-06-10 23:50:25,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:25,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418079608] [2021-06-10 23:50:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:25,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:25,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:25,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418079608] [2021-06-10 23:50:25,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:25,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:25,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276610154] [2021-06-10 23:50:25,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:25,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:25,769 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 141 [2021-06-10 23:50:25,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 71 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:25,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:25,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 141 [2021-06-10 23:50:25,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:25,779 INFO L129 PetriNetUnfolder]: 0/70 cut-off events. [2021-06-10 23:50:25,779 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:25,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 70 events. 0/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 35/105 useless extension candidates. Maximal degree in co-relation 0. Up to 35 conditions per place. [2021-06-10 23:50:25,779 INFO L132 encePairwiseOnDemand]: 139/141 looper letters, 0 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2021-06-10 23:50:25,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 70 transitions, 1434 flow [2021-06-10 23:50:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2021-06-10 23:50:25,780 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.983451536643026 [2021-06-10 23:50:25,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2021-06-10 23:50:25,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2021-06-10 23:50:25,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:25,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2021-06-10 23:50:25,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:25,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:25,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:25,782 INFO L185 Difference]: Start difference. First operand has 140 places, 71 transitions, 1434 flow. Second operand 3 states and 416 transitions. [2021-06-10 23:50:25,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 70 transitions, 1434 flow [2021-06-10 23:50:25,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 70 transitions, 312 flow, removed 561 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:25,793 INFO L241 Difference]: Finished difference. Result has 141 places, 70 transitions, 312 flow [2021-06-10 23:50:25,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=141, PETRI_TRANSITIONS=70} [2021-06-10 23:50:25,793 INFO L343 CegarLoopForPetriNet]: 140 programPoint places, 1 predicate places. [2021-06-10 23:50:25,793 INFO L480 AbstractCegarLoop]: Abstraction has has 141 places, 70 transitions, 312 flow [2021-06-10 23:50:25,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:25,793 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:25,793 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:25,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-06-10 23:50:25,793 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1249775589, now seen corresponding path program 1 times [2021-06-10 23:50:25,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:25,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102002971] [2021-06-10 23:50:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:25,798 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:25,800 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:25,803 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:25,803 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:25,803 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-06-10 23:50:25,803 WARN L342 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:25,803 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2021-06-10 23:50:25,830 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:25,830 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:25,830 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:25,831 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:25,831 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:25,831 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:25,831 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:25,831 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:25,831 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:25,831 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:25,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 181 places, 110 transitions, 1585 flow [2021-06-10 23:50:25,851 INFO L129 PetriNetUnfolder]: 0/215 cut-off events. [2021-06-10 23:50:25,851 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:25,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 215 events. 0/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 710 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 0. Up to 36 conditions per place. [2021-06-10 23:50:25,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 110 transitions, 1585 flow [2021-06-10 23:50:25,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 108 transitions, 1581 flow [2021-06-10 23:50:25,852 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:25,852 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 108 transitions, 1581 flow [2021-06-10 23:50:25,852 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 108 transitions, 1581 flow [2021-06-10 23:50:25,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 108 transitions, 1581 flow [2021-06-10 23:50:25,866 INFO L129 PetriNetUnfolder]: 0/143 cut-off events. [2021-06-10 23:50:25,866 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:25,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 143 events. 0/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 379 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 0. Up to 36 conditions per place. [2021-06-10 23:50:25,871 INFO L151 LiptonReduction]: Number of co-enabled transitions 7420 [2021-06-10 23:50:27,494 INFO L163 LiptonReduction]: Checked pairs total: 3045 [2021-06-10 23:50:27,494 INFO L165 LiptonReduction]: Total number of compositions: 35 [2021-06-10 23:50:27,494 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1642 [2021-06-10 23:50:27,495 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:27,495 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:27,495 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:27,495 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:27,495 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:27,495 INFO L82 PathProgramCache]: Analyzing trace with hash 86179, now seen corresponding path program 1 times [2021-06-10 23:50:27,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:27,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351525970] [2021-06-10 23:50:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:27,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:27,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:27,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351525970] [2021-06-10 23:50:27,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:27,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:27,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180856222] [2021-06-10 23:50:27,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:27,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:27,505 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 145 [2021-06-10 23:50:27,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 73 transitions, 1511 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:27,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:27,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 145 [2021-06-10 23:50:27,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:27,516 INFO L129 PetriNetUnfolder]: 0/72 cut-off events. [2021-06-10 23:50:27,516 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:27,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 72 events. 0/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 36/108 useless extension candidates. Maximal degree in co-relation 0. Up to 36 conditions per place. [2021-06-10 23:50:27,516 INFO L132 encePairwiseOnDemand]: 143/145 looper letters, 0 selfloop transitions, 1 changer transitions 0/72 dead transitions. [2021-06-10 23:50:27,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 72 transitions, 1511 flow [2021-06-10 23:50:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2021-06-10 23:50:27,517 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9839080459770115 [2021-06-10 23:50:27,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2021-06-10 23:50:27,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2021-06-10 23:50:27,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:27,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2021-06-10 23:50:27,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:27,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:27,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:27,518 INFO L185 Difference]: Start difference. First operand has 144 places, 73 transitions, 1511 flow. Second operand 3 states and 428 transitions. [2021-06-10 23:50:27,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 72 transitions, 1511 flow [2021-06-10 23:50:27,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 72 transitions, 321 flow, removed 595 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:27,528 INFO L241 Difference]: Finished difference. Result has 145 places, 72 transitions, 321 flow [2021-06-10 23:50:27,529 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=145, PETRI_TRANSITIONS=72} [2021-06-10 23:50:27,529 INFO L343 CegarLoopForPetriNet]: 144 programPoint places, 1 predicate places. [2021-06-10 23:50:27,529 INFO L480 AbstractCegarLoop]: Abstraction has has 145 places, 72 transitions, 321 flow [2021-06-10 23:50:27,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:27,529 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:27,529 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:27,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-06-10 23:50:27,529 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:27,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:27,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1758155444, now seen corresponding path program 1 times [2021-06-10 23:50:27,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:27,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886358956] [2021-06-10 23:50:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:27,534 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:27,535 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:27,538 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:27,538 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:27,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-06-10 23:50:27,539 WARN L342 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:27,539 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2021-06-10 23:50:27,563 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:27,563 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:27,563 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:27,563 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:27,563 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:27,563 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:27,563 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:27,563 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:27,563 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:27,564 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:27,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 186 places, 113 transitions, 1666 flow [2021-06-10 23:50:27,582 INFO L129 PetriNetUnfolder]: 0/221 cut-off events. [2021-06-10 23:50:27,582 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:27,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 221 events. 0/221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 732 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 0. Up to 37 conditions per place. [2021-06-10 23:50:27,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 113 transitions, 1666 flow [2021-06-10 23:50:27,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 111 transitions, 1662 flow [2021-06-10 23:50:27,584 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:27,584 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 111 transitions, 1662 flow [2021-06-10 23:50:27,584 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 111 transitions, 1662 flow [2021-06-10 23:50:27,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 184 places, 111 transitions, 1662 flow [2021-06-10 23:50:27,598 INFO L129 PetriNetUnfolder]: 0/147 cut-off events. [2021-06-10 23:50:27,598 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:27,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 147 events. 0/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 445 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 0. Up to 37 conditions per place. [2021-06-10 23:50:27,603 INFO L151 LiptonReduction]: Number of co-enabled transitions 7848 [2021-06-10 23:50:29,414 INFO L163 LiptonReduction]: Checked pairs total: 3222 [2021-06-10 23:50:29,414 INFO L165 LiptonReduction]: Total number of compositions: 36 [2021-06-10 23:50:29,415 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1831 [2021-06-10 23:50:29,415 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:29,415 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:29,415 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:29,415 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:29,415 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:29,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:29,416 INFO L82 PathProgramCache]: Analyzing trace with hash 90915, now seen corresponding path program 1 times [2021-06-10 23:50:29,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:29,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854653445] [2021-06-10 23:50:29,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:29,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:29,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:29,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854653445] [2021-06-10 23:50:29,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:29,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:29,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343317535] [2021-06-10 23:50:29,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:29,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:29,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:29,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:29,433 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 149 [2021-06-10 23:50:29,434 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 75 transitions, 1590 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:29,434 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:29,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 149 [2021-06-10 23:50:29,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:29,444 INFO L129 PetriNetUnfolder]: 0/74 cut-off events. [2021-06-10 23:50:29,444 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:29,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 74 events. 0/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 37/111 useless extension candidates. Maximal degree in co-relation 0. Up to 37 conditions per place. [2021-06-10 23:50:29,445 INFO L132 encePairwiseOnDemand]: 147/149 looper letters, 0 selfloop transitions, 1 changer transitions 0/74 dead transitions. [2021-06-10 23:50:29,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 74 transitions, 1590 flow [2021-06-10 23:50:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2021-06-10 23:50:29,445 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9843400447427293 [2021-06-10 23:50:29,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2021-06-10 23:50:29,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2021-06-10 23:50:29,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:29,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2021-06-10 23:50:29,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:29,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:29,447 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:29,447 INFO L185 Difference]: Start difference. First operand has 148 places, 75 transitions, 1590 flow. Second operand 3 states and 440 transitions. [2021-06-10 23:50:29,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 74 transitions, 1590 flow [2021-06-10 23:50:29,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 74 transitions, 330 flow, removed 630 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:29,458 INFO L241 Difference]: Finished difference. Result has 149 places, 74 transitions, 330 flow [2021-06-10 23:50:29,458 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=149, PETRI_TRANSITIONS=74} [2021-06-10 23:50:29,458 INFO L343 CegarLoopForPetriNet]: 148 programPoint places, 1 predicate places. [2021-06-10 23:50:29,458 INFO L480 AbstractCegarLoop]: Abstraction has has 149 places, 74 transitions, 330 flow [2021-06-10 23:50:29,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:29,458 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:29,459 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:29,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-06-10 23:50:29,459 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:29,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:29,459 INFO L82 PathProgramCache]: Analyzing trace with hash -620843554, now seen corresponding path program 1 times [2021-06-10 23:50:29,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:29,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071857871] [2021-06-10 23:50:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:29,464 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:29,466 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:29,469 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:29,469 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:29,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-06-10 23:50:29,470 WARN L342 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:29,470 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2021-06-10 23:50:29,498 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:29,498 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:29,499 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:29,499 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:29,499 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:29,499 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:29,499 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:29,499 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:29,499 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:29,499 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:29,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 191 places, 116 transitions, 1749 flow [2021-06-10 23:50:29,519 INFO L129 PetriNetUnfolder]: 0/227 cut-off events. [2021-06-10 23:50:29,519 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:29,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 227 events. 0/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 705 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 0. Up to 38 conditions per place. [2021-06-10 23:50:29,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 116 transitions, 1749 flow [2021-06-10 23:50:29,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 114 transitions, 1745 flow [2021-06-10 23:50:29,521 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:29,521 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 114 transitions, 1745 flow [2021-06-10 23:50:29,521 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 114 transitions, 1745 flow [2021-06-10 23:50:29,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 189 places, 114 transitions, 1745 flow [2021-06-10 23:50:29,536 INFO L129 PetriNetUnfolder]: 0/151 cut-off events. [2021-06-10 23:50:29,536 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:29,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 151 events. 0/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 480 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 0. Up to 38 conditions per place. [2021-06-10 23:50:29,541 INFO L151 LiptonReduction]: Number of co-enabled transitions 8288 [2021-06-10 23:50:31,453 INFO L163 LiptonReduction]: Checked pairs total: 3404 [2021-06-10 23:50:31,453 INFO L165 LiptonReduction]: Total number of compositions: 37 [2021-06-10 23:50:31,454 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1933 [2021-06-10 23:50:31,454 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:31,454 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:31,454 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:31,454 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:31,454 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:31,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:31,455 INFO L82 PathProgramCache]: Analyzing trace with hash 95779, now seen corresponding path program 1 times [2021-06-10 23:50:31,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:31,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106730510] [2021-06-10 23:50:31,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:31,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:31,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:31,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106730510] [2021-06-10 23:50:31,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:31,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:31,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009204698] [2021-06-10 23:50:31,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:31,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:31,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:31,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:31,464 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 153 [2021-06-10 23:50:31,464 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 77 transitions, 1671 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:31,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:31,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 153 [2021-06-10 23:50:31,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:31,475 INFO L129 PetriNetUnfolder]: 0/76 cut-off events. [2021-06-10 23:50:31,475 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:31,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 76 events. 0/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 38/114 useless extension candidates. Maximal degree in co-relation 0. Up to 38 conditions per place. [2021-06-10 23:50:31,476 INFO L132 encePairwiseOnDemand]: 151/153 looper letters, 0 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2021-06-10 23:50:31,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 76 transitions, 1671 flow [2021-06-10 23:50:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2021-06-10 23:50:31,476 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9847494553376906 [2021-06-10 23:50:31,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2021-06-10 23:50:31,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2021-06-10 23:50:31,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:31,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2021-06-10 23:50:31,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:31,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:31,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:31,478 INFO L185 Difference]: Start difference. First operand has 152 places, 77 transitions, 1671 flow. Second operand 3 states and 452 transitions. [2021-06-10 23:50:31,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 76 transitions, 1671 flow [2021-06-10 23:50:31,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 76 transitions, 339 flow, removed 666 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:31,489 INFO L241 Difference]: Finished difference. Result has 153 places, 76 transitions, 339 flow [2021-06-10 23:50:31,489 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=153, PETRI_TRANSITIONS=76} [2021-06-10 23:50:31,489 INFO L343 CegarLoopForPetriNet]: 152 programPoint places, 1 predicate places. [2021-06-10 23:50:31,489 INFO L480 AbstractCegarLoop]: Abstraction has has 153 places, 76 transitions, 339 flow [2021-06-10 23:50:31,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:31,490 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:31,490 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:31,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-06-10 23:50:31,490 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:31,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:31,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1594398209, now seen corresponding path program 1 times [2021-06-10 23:50:31,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:31,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882689471] [2021-06-10 23:50:31,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:31,495 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:31,496 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:31,499 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:31,499 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:31,499 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-06-10 23:50:31,499 WARN L342 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:31,499 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2021-06-10 23:50:31,524 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:31,524 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:31,524 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:31,525 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:31,525 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:31,525 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:31,525 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:31,525 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:31,525 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:31,525 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:31,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 196 places, 119 transitions, 1834 flow [2021-06-10 23:50:31,545 INFO L129 PetriNetUnfolder]: 0/233 cut-off events. [2021-06-10 23:50:31,546 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:31,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 233 events. 0/233 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 762 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 0. Up to 39 conditions per place. [2021-06-10 23:50:31,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 119 transitions, 1834 flow [2021-06-10 23:50:31,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 117 transitions, 1830 flow [2021-06-10 23:50:31,547 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:31,547 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 117 transitions, 1830 flow [2021-06-10 23:50:31,547 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 117 transitions, 1830 flow [2021-06-10 23:50:31,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 194 places, 117 transitions, 1830 flow [2021-06-10 23:50:31,563 INFO L129 PetriNetUnfolder]: 0/155 cut-off events. [2021-06-10 23:50:31,564 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:31,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 155 events. 0/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 0. Up to 39 conditions per place. [2021-06-10 23:50:31,569 INFO L151 LiptonReduction]: Number of co-enabled transitions 8740 [2021-06-10 23:50:33,532 INFO L163 LiptonReduction]: Checked pairs total: 3591 [2021-06-10 23:50:33,532 INFO L165 LiptonReduction]: Total number of compositions: 38 [2021-06-10 23:50:33,537 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1990 [2021-06-10 23:50:33,538 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:33,538 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:33,538 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:33,538 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:33,538 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash 100771, now seen corresponding path program 1 times [2021-06-10 23:50:33,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:33,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122906434] [2021-06-10 23:50:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:33,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:33,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:33,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122906434] [2021-06-10 23:50:33,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:33,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:33,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655375306] [2021-06-10 23:50:33,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:33,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:33,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:33,552 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 157 [2021-06-10 23:50:33,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 79 transitions, 1754 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:33,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:33,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 157 [2021-06-10 23:50:33,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:33,564 INFO L129 PetriNetUnfolder]: 0/78 cut-off events. [2021-06-10 23:50:33,564 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:33,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 78 events. 0/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 39/117 useless extension candidates. Maximal degree in co-relation 0. Up to 39 conditions per place. [2021-06-10 23:50:33,565 INFO L132 encePairwiseOnDemand]: 155/157 looper letters, 0 selfloop transitions, 1 changer transitions 0/78 dead transitions. [2021-06-10 23:50:33,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 78 transitions, 1754 flow [2021-06-10 23:50:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2021-06-10 23:50:33,565 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9851380042462845 [2021-06-10 23:50:33,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2021-06-10 23:50:33,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2021-06-10 23:50:33,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:33,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2021-06-10 23:50:33,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:33,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:33,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:33,567 INFO L185 Difference]: Start difference. First operand has 156 places, 79 transitions, 1754 flow. Second operand 3 states and 464 transitions. [2021-06-10 23:50:33,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 78 transitions, 1754 flow [2021-06-10 23:50:33,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 78 transitions, 348 flow, removed 703 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:33,579 INFO L241 Difference]: Finished difference. Result has 157 places, 78 transitions, 348 flow [2021-06-10 23:50:33,579 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=157, PETRI_TRANSITIONS=78} [2021-06-10 23:50:33,579 INFO L343 CegarLoopForPetriNet]: 156 programPoint places, 1 predicate places. [2021-06-10 23:50:33,579 INFO L480 AbstractCegarLoop]: Abstraction has has 157 places, 78 transitions, 348 flow [2021-06-10 23:50:33,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:33,580 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:33,580 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:33,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-06-10 23:50:33,580 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:33,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:33,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1021538209, now seen corresponding path program 1 times [2021-06-10 23:50:33,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:33,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318263212] [2021-06-10 23:50:33,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:33,585 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:33,586 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:33,590 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:33,590 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:33,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-06-10 23:50:33,590 WARN L342 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:33,590 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2021-06-10 23:50:33,619 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:33,619 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:33,619 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:33,619 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:33,619 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:33,619 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:33,620 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:33,620 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:33,620 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:33,620 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:33,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 201 places, 122 transitions, 1921 flow [2021-06-10 23:50:33,641 INFO L129 PetriNetUnfolder]: 0/239 cut-off events. [2021-06-10 23:50:33,641 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:33,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 239 events. 0/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 781 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 0. Up to 40 conditions per place. [2021-06-10 23:50:33,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 122 transitions, 1921 flow [2021-06-10 23:50:33,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 120 transitions, 1917 flow [2021-06-10 23:50:33,643 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:33,643 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 120 transitions, 1917 flow [2021-06-10 23:50:33,643 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 120 transitions, 1917 flow [2021-06-10 23:50:33,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 199 places, 120 transitions, 1917 flow [2021-06-10 23:50:33,660 INFO L129 PetriNetUnfolder]: 0/159 cut-off events. [2021-06-10 23:50:33,660 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:33,660 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 159 events. 0/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 379 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 0. Up to 40 conditions per place. [2021-06-10 23:50:33,666 INFO L151 LiptonReduction]: Number of co-enabled transitions 9204 [2021-06-10 23:50:35,700 INFO L163 LiptonReduction]: Checked pairs total: 3783 [2021-06-10 23:50:35,700 INFO L165 LiptonReduction]: Total number of compositions: 39 [2021-06-10 23:50:35,700 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2057 [2021-06-10 23:50:35,701 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:35,701 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:35,701 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:35,701 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:35,701 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:35,702 INFO L82 PathProgramCache]: Analyzing trace with hash 105891, now seen corresponding path program 1 times [2021-06-10 23:50:35,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:35,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865923429] [2021-06-10 23:50:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:35,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:35,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:35,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865923429] [2021-06-10 23:50:35,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:35,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:35,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234037524] [2021-06-10 23:50:35,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:35,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:35,711 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 161 [2021-06-10 23:50:35,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 81 transitions, 1839 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:35,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:35,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 161 [2021-06-10 23:50:35,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:35,723 INFO L129 PetriNetUnfolder]: 0/80 cut-off events. [2021-06-10 23:50:35,723 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:35,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 80 events. 0/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 40/120 useless extension candidates. Maximal degree in co-relation 0. Up to 40 conditions per place. [2021-06-10 23:50:35,723 INFO L132 encePairwiseOnDemand]: 159/161 looper letters, 0 selfloop transitions, 1 changer transitions 0/80 dead transitions. [2021-06-10 23:50:35,724 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 80 transitions, 1839 flow [2021-06-10 23:50:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2021-06-10 23:50:35,724 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9855072463768116 [2021-06-10 23:50:35,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2021-06-10 23:50:35,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2021-06-10 23:50:35,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:35,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2021-06-10 23:50:35,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:35,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:35,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:35,726 INFO L185 Difference]: Start difference. First operand has 160 places, 81 transitions, 1839 flow. Second operand 3 states and 476 transitions. [2021-06-10 23:50:35,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 80 transitions, 1839 flow [2021-06-10 23:50:35,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 80 transitions, 357 flow, removed 741 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:35,739 INFO L241 Difference]: Finished difference. Result has 161 places, 80 transitions, 357 flow [2021-06-10 23:50:35,739 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=161, PETRI_TRANSITIONS=80} [2021-06-10 23:50:35,739 INFO L343 CegarLoopForPetriNet]: 160 programPoint places, 1 predicate places. [2021-06-10 23:50:35,739 INFO L480 AbstractCegarLoop]: Abstraction has has 161 places, 80 transitions, 357 flow [2021-06-10 23:50:35,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:35,739 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:35,739 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:35,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-06-10 23:50:35,740 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:35,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:35,740 INFO L82 PathProgramCache]: Analyzing trace with hash 131279706, now seen corresponding path program 1 times [2021-06-10 23:50:35,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:35,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187709987] [2021-06-10 23:50:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:35,745 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:35,746 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:35,750 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:35,750 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:35,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-06-10 23:50:35,750 WARN L342 ceAbstractionStarter]: 39 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:35,750 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 40 thread instances. [2021-06-10 23:50:35,778 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:35,778 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:35,778 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:35,778 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:35,778 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:35,778 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:35,779 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:35,779 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:35,779 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:35,779 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:35,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 206 places, 125 transitions, 2010 flow [2021-06-10 23:50:35,801 INFO L129 PetriNetUnfolder]: 0/245 cut-off events. [2021-06-10 23:50:35,802 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:35,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 245 events. 0/245 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 816 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 0. Up to 41 conditions per place. [2021-06-10 23:50:35,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 125 transitions, 2010 flow [2021-06-10 23:50:35,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 123 transitions, 2006 flow [2021-06-10 23:50:35,804 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:35,804 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 123 transitions, 2006 flow [2021-06-10 23:50:35,804 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 123 transitions, 2006 flow [2021-06-10 23:50:35,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 123 transitions, 2006 flow [2021-06-10 23:50:35,822 INFO L129 PetriNetUnfolder]: 0/163 cut-off events. [2021-06-10 23:50:35,822 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:35,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 163 events. 0/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 456 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 0. Up to 41 conditions per place. [2021-06-10 23:50:35,828 INFO L151 LiptonReduction]: Number of co-enabled transitions 9680 [2021-06-10 23:50:38,128 INFO L163 LiptonReduction]: Checked pairs total: 3980 [2021-06-10 23:50:38,128 INFO L165 LiptonReduction]: Total number of compositions: 40 [2021-06-10 23:50:38,129 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2325 [2021-06-10 23:50:38,129 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:38,129 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:38,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:38,129 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:38,129 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash 111139, now seen corresponding path program 1 times [2021-06-10 23:50:38,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:38,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694909947] [2021-06-10 23:50:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:38,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:38,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:38,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694909947] [2021-06-10 23:50:38,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:38,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:38,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79181990] [2021-06-10 23:50:38,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:38,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:38,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:38,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:38,142 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 165 [2021-06-10 23:50:38,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 83 transitions, 1926 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:38,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:38,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 165 [2021-06-10 23:50:38,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:38,157 INFO L129 PetriNetUnfolder]: 0/82 cut-off events. [2021-06-10 23:50:38,157 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:38,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 41/123 useless extension candidates. Maximal degree in co-relation 0. Up to 41 conditions per place. [2021-06-10 23:50:38,158 INFO L132 encePairwiseOnDemand]: 163/165 looper letters, 0 selfloop transitions, 1 changer transitions 0/82 dead transitions. [2021-06-10 23:50:38,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 82 transitions, 1926 flow [2021-06-10 23:50:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2021-06-10 23:50:38,174 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9858585858585859 [2021-06-10 23:50:38,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2021-06-10 23:50:38,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2021-06-10 23:50:38,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:38,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2021-06-10 23:50:38,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:38,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:38,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:38,175 INFO L185 Difference]: Start difference. First operand has 164 places, 83 transitions, 1926 flow. Second operand 3 states and 488 transitions. [2021-06-10 23:50:38,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 82 transitions, 1926 flow [2021-06-10 23:50:38,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 82 transitions, 366 flow, removed 780 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:38,208 INFO L241 Difference]: Finished difference. Result has 165 places, 82 transitions, 366 flow [2021-06-10 23:50:38,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=165, PETRI_TRANSITIONS=82} [2021-06-10 23:50:38,209 INFO L343 CegarLoopForPetriNet]: 164 programPoint places, 1 predicate places. [2021-06-10 23:50:38,209 INFO L480 AbstractCegarLoop]: Abstraction has has 165 places, 82 transitions, 366 flow [2021-06-10 23:50:38,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:38,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:38,209 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:38,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-06-10 23:50:38,209 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:38,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash -92914844, now seen corresponding path program 1 times [2021-06-10 23:50:38,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:38,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89645832] [2021-06-10 23:50:38,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:38,215 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:38,240 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:38,257 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:38,258 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:38,258 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-06-10 23:50:38,258 WARN L342 ceAbstractionStarter]: 40 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:38,258 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 41 thread instances. [2021-06-10 23:50:38,300 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:38,300 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:38,301 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:38,301 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:38,301 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:38,301 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:38,301 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:38,301 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:38,301 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:38,301 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:38,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 211 places, 128 transitions, 2101 flow [2021-06-10 23:50:38,336 INFO L129 PetriNetUnfolder]: 0/251 cut-off events. [2021-06-10 23:50:38,336 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:38,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 251 events. 0/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 802 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 0. Up to 42 conditions per place. [2021-06-10 23:50:38,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 128 transitions, 2101 flow [2021-06-10 23:50:38,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 126 transitions, 2097 flow [2021-06-10 23:50:38,338 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:38,338 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 126 transitions, 2097 flow [2021-06-10 23:50:38,338 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 126 transitions, 2097 flow [2021-06-10 23:50:38,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 209 places, 126 transitions, 2097 flow [2021-06-10 23:50:38,374 INFO L129 PetriNetUnfolder]: 0/167 cut-off events. [2021-06-10 23:50:38,374 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:38,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 167 events. 0/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 495 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 0. Up to 42 conditions per place. [2021-06-10 23:50:38,380 INFO L151 LiptonReduction]: Number of co-enabled transitions 10168 [2021-06-10 23:50:40,634 INFO L163 LiptonReduction]: Checked pairs total: 4182 [2021-06-10 23:50:40,634 INFO L165 LiptonReduction]: Total number of compositions: 41 [2021-06-10 23:50:40,634 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2296 [2021-06-10 23:50:40,635 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:40,635 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:40,635 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:40,635 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:40,635 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:40,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:40,635 INFO L82 PathProgramCache]: Analyzing trace with hash 116515, now seen corresponding path program 1 times [2021-06-10 23:50:40,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:40,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011119844] [2021-06-10 23:50:40,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:40,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:40,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:40,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011119844] [2021-06-10 23:50:40,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:40,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:40,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254723122] [2021-06-10 23:50:40,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:40,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:40,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:40,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:40,645 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 169 [2021-06-10 23:50:40,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 85 transitions, 2015 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:40,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:40,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 169 [2021-06-10 23:50:40,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:40,658 INFO L129 PetriNetUnfolder]: 0/84 cut-off events. [2021-06-10 23:50:40,658 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:40,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 84 events. 0/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 42/126 useless extension candidates. Maximal degree in co-relation 0. Up to 42 conditions per place. [2021-06-10 23:50:40,659 INFO L132 encePairwiseOnDemand]: 167/169 looper letters, 0 selfloop transitions, 1 changer transitions 0/84 dead transitions. [2021-06-10 23:50:40,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 84 transitions, 2015 flow [2021-06-10 23:50:40,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2021-06-10 23:50:40,659 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9861932938856016 [2021-06-10 23:50:40,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2021-06-10 23:50:40,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2021-06-10 23:50:40,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:40,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2021-06-10 23:50:40,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:40,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:40,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:40,661 INFO L185 Difference]: Start difference. First operand has 168 places, 85 transitions, 2015 flow. Second operand 3 states and 500 transitions. [2021-06-10 23:50:40,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 84 transitions, 2015 flow [2021-06-10 23:50:40,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 84 transitions, 375 flow, removed 820 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:40,681 INFO L241 Difference]: Finished difference. Result has 169 places, 84 transitions, 375 flow [2021-06-10 23:50:40,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=169, PETRI_TRANSITIONS=84} [2021-06-10 23:50:40,681 INFO L343 CegarLoopForPetriNet]: 168 programPoint places, 1 predicate places. [2021-06-10 23:50:40,681 INFO L480 AbstractCegarLoop]: Abstraction has has 169 places, 84 transitions, 375 flow [2021-06-10 23:50:40,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:40,682 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:40,682 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:40,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-06-10 23:50:40,682 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:40,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:40,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2062937915, now seen corresponding path program 1 times [2021-06-10 23:50:40,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:40,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802506261] [2021-06-10 23:50:40,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:40,687 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:40,689 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:40,693 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:40,693 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:40,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-06-10 23:50:40,693 WARN L342 ceAbstractionStarter]: 41 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:40,693 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 42 thread instances. [2021-06-10 23:50:40,731 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:40,731 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:40,732 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:40,732 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:40,732 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:40,732 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:40,732 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:40,732 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:40,732 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:40,732 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:40,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 216 places, 131 transitions, 2194 flow [2021-06-10 23:50:40,757 INFO L129 PetriNetUnfolder]: 0/257 cut-off events. [2021-06-10 23:50:40,757 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:40,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 257 events. 0/257 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 808 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 0. Up to 43 conditions per place. [2021-06-10 23:50:40,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 131 transitions, 2194 flow [2021-06-10 23:50:40,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 129 transitions, 2190 flow [2021-06-10 23:50:40,758 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:40,758 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 129 transitions, 2190 flow [2021-06-10 23:50:40,758 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 129 transitions, 2190 flow [2021-06-10 23:50:40,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 214 places, 129 transitions, 2190 flow [2021-06-10 23:50:40,777 INFO L129 PetriNetUnfolder]: 0/171 cut-off events. [2021-06-10 23:50:40,777 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:40,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 171 events. 0/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 493 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 0. Up to 43 conditions per place. [2021-06-10 23:50:40,783 INFO L151 LiptonReduction]: Number of co-enabled transitions 10668 [2021-06-10 23:50:43,231 INFO L163 LiptonReduction]: Checked pairs total: 4389 [2021-06-10 23:50:43,231 INFO L165 LiptonReduction]: Total number of compositions: 42 [2021-06-10 23:50:43,231 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2473 [2021-06-10 23:50:43,232 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:43,232 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:43,232 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:43,232 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:43,232 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:43,232 INFO L82 PathProgramCache]: Analyzing trace with hash 122019, now seen corresponding path program 1 times [2021-06-10 23:50:43,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:43,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258135504] [2021-06-10 23:50:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:43,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:43,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:43,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258135504] [2021-06-10 23:50:43,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:43,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:43,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758128732] [2021-06-10 23:50:43,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:43,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:43,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:43,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:43,245 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 173 [2021-06-10 23:50:43,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 87 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:43,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:43,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 173 [2021-06-10 23:50:43,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:43,258 INFO L129 PetriNetUnfolder]: 0/86 cut-off events. [2021-06-10 23:50:43,258 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:43,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 86 events. 0/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 43/129 useless extension candidates. Maximal degree in co-relation 0. Up to 43 conditions per place. [2021-06-10 23:50:43,259 INFO L132 encePairwiseOnDemand]: 171/173 looper letters, 0 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2021-06-10 23:50:43,259 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 86 transitions, 2106 flow [2021-06-10 23:50:43,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2021-06-10 23:50:43,259 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9865125240847784 [2021-06-10 23:50:43,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2021-06-10 23:50:43,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2021-06-10 23:50:43,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:43,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2021-06-10 23:50:43,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:43,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:43,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:43,261 INFO L185 Difference]: Start difference. First operand has 172 places, 87 transitions, 2106 flow. Second operand 3 states and 512 transitions. [2021-06-10 23:50:43,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 86 transitions, 2106 flow [2021-06-10 23:50:43,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 86 transitions, 384 flow, removed 861 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:43,284 INFO L241 Difference]: Finished difference. Result has 173 places, 86 transitions, 384 flow [2021-06-10 23:50:43,284 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=173, PETRI_TRANSITIONS=86} [2021-06-10 23:50:43,285 INFO L343 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2021-06-10 23:50:43,285 INFO L480 AbstractCegarLoop]: Abstraction has has 173 places, 86 transitions, 384 flow [2021-06-10 23:50:43,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:43,285 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:43,285 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:43,285 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-06-10 23:50:43,285 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:43,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:43,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1248466727, now seen corresponding path program 1 times [2021-06-10 23:50:43,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:43,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221677698] [2021-06-10 23:50:43,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:43,291 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:43,292 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:43,298 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:43,298 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:43,298 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-06-10 23:50:43,298 WARN L342 ceAbstractionStarter]: 42 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:43,298 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 43 thread instances. [2021-06-10 23:50:43,347 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:43,347 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:43,348 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:43,348 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:43,348 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:43,348 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:43,348 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:43,348 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:43,348 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:43,348 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:43,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 221 places, 134 transitions, 2289 flow [2021-06-10 23:50:43,375 INFO L129 PetriNetUnfolder]: 0/263 cut-off events. [2021-06-10 23:50:43,375 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:43,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 263 events. 0/263 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 856 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 0. Up to 44 conditions per place. [2021-06-10 23:50:43,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 134 transitions, 2289 flow [2021-06-10 23:50:43,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 132 transitions, 2285 flow [2021-06-10 23:50:43,377 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:43,378 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 132 transitions, 2285 flow [2021-06-10 23:50:43,378 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 132 transitions, 2285 flow [2021-06-10 23:50:43,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 219 places, 132 transitions, 2285 flow [2021-06-10 23:50:43,403 INFO L129 PetriNetUnfolder]: 0/175 cut-off events. [2021-06-10 23:50:43,403 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:43,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 175 events. 0/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 491 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 0. Up to 44 conditions per place. [2021-06-10 23:50:43,411 INFO L151 LiptonReduction]: Number of co-enabled transitions 11180 [2021-06-10 23:50:45,877 INFO L163 LiptonReduction]: Checked pairs total: 4601 [2021-06-10 23:50:45,877 INFO L165 LiptonReduction]: Total number of compositions: 43 [2021-06-10 23:50:45,877 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2500 [2021-06-10 23:50:45,878 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:45,878 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:45,878 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:45,878 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:45,878 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:45,878 INFO L82 PathProgramCache]: Analyzing trace with hash 127651, now seen corresponding path program 1 times [2021-06-10 23:50:45,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:45,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880409614] [2021-06-10 23:50:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:45,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:45,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:45,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880409614] [2021-06-10 23:50:45,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:45,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:45,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647733902] [2021-06-10 23:50:45,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:45,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:45,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:45,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:45,889 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 177 [2021-06-10 23:50:45,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 89 transitions, 2199 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:45,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:45,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 177 [2021-06-10 23:50:45,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:45,903 INFO L129 PetriNetUnfolder]: 0/88 cut-off events. [2021-06-10 23:50:45,904 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:45,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 88 events. 0/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 44/132 useless extension candidates. Maximal degree in co-relation 0. Up to 44 conditions per place. [2021-06-10 23:50:45,904 INFO L132 encePairwiseOnDemand]: 175/177 looper letters, 0 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2021-06-10 23:50:45,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 88 transitions, 2199 flow [2021-06-10 23:50:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2021-06-10 23:50:45,905 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9868173258003766 [2021-06-10 23:50:45,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2021-06-10 23:50:45,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2021-06-10 23:50:45,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:45,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2021-06-10 23:50:45,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:45,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:45,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:45,906 INFO L185 Difference]: Start difference. First operand has 176 places, 89 transitions, 2199 flow. Second operand 3 states and 524 transitions. [2021-06-10 23:50:45,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 88 transitions, 2199 flow [2021-06-10 23:50:45,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 88 transitions, 393 flow, removed 903 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:45,931 INFO L241 Difference]: Finished difference. Result has 177 places, 88 transitions, 393 flow [2021-06-10 23:50:45,931 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=177, PETRI_TRANSITIONS=88} [2021-06-10 23:50:45,931 INFO L343 CegarLoopForPetriNet]: 176 programPoint places, 1 predicate places. [2021-06-10 23:50:45,931 INFO L480 AbstractCegarLoop]: Abstraction has has 177 places, 88 transitions, 393 flow [2021-06-10 23:50:45,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:45,932 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:45,932 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:45,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-06-10 23:50:45,932 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1295684672, now seen corresponding path program 1 times [2021-06-10 23:50:45,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:45,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336542842] [2021-06-10 23:50:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:45,939 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:45,940 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:45,944 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:45,944 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:45,945 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-06-10 23:50:45,945 WARN L342 ceAbstractionStarter]: 43 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:45,945 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 44 thread instances. [2021-06-10 23:50:45,975 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:45,975 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:45,976 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:45,976 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:45,976 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:45,976 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:45,976 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:45,976 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:45,976 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:45,976 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:45,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 226 places, 137 transitions, 2386 flow [2021-06-10 23:50:46,003 INFO L129 PetriNetUnfolder]: 0/269 cut-off events. [2021-06-10 23:50:46,004 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:46,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 269 events. 0/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 881 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 0. Up to 45 conditions per place. [2021-06-10 23:50:46,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 137 transitions, 2386 flow [2021-06-10 23:50:46,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 135 transitions, 2382 flow [2021-06-10 23:50:46,005 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:46,005 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 135 transitions, 2382 flow [2021-06-10 23:50:46,005 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 135 transitions, 2382 flow [2021-06-10 23:50:46,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 224 places, 135 transitions, 2382 flow [2021-06-10 23:50:46,026 INFO L129 PetriNetUnfolder]: 0/179 cut-off events. [2021-06-10 23:50:46,027 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:46,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 179 events. 0/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 557 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 0. Up to 45 conditions per place. [2021-06-10 23:50:46,034 INFO L151 LiptonReduction]: Number of co-enabled transitions 11704 [2021-06-10 23:50:48,682 INFO L163 LiptonReduction]: Checked pairs total: 4818 [2021-06-10 23:50:48,682 INFO L165 LiptonReduction]: Total number of compositions: 44 [2021-06-10 23:50:48,682 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2677 [2021-06-10 23:50:48,683 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:48,683 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:48,683 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:48,683 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:48,683 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:48,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash 133411, now seen corresponding path program 1 times [2021-06-10 23:50:48,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:48,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354952735] [2021-06-10 23:50:48,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:48,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:48,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:48,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354952735] [2021-06-10 23:50:48,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:48,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:48,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426466382] [2021-06-10 23:50:48,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:48,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:48,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:48,693 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 181 [2021-06-10 23:50:48,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 91 transitions, 2294 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:48,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:48,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 181 [2021-06-10 23:50:48,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:48,708 INFO L129 PetriNetUnfolder]: 0/90 cut-off events. [2021-06-10 23:50:48,708 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:48,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 90 events. 0/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 80 event pairs, 0 based on Foata normal form. 45/135 useless extension candidates. Maximal degree in co-relation 0. Up to 45 conditions per place. [2021-06-10 23:50:48,708 INFO L132 encePairwiseOnDemand]: 179/181 looper letters, 0 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2021-06-10 23:50:48,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 90 transitions, 2294 flow [2021-06-10 23:50:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2021-06-10 23:50:48,709 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9871086556169429 [2021-06-10 23:50:48,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 536 transitions. [2021-06-10 23:50:48,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 536 transitions. [2021-06-10 23:50:48,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:48,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 536 transitions. [2021-06-10 23:50:48,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:48,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:48,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:48,710 INFO L185 Difference]: Start difference. First operand has 180 places, 91 transitions, 2294 flow. Second operand 3 states and 536 transitions. [2021-06-10 23:50:48,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 90 transitions, 2294 flow [2021-06-10 23:50:48,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 90 transitions, 402 flow, removed 946 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:48,739 INFO L241 Difference]: Finished difference. Result has 181 places, 90 transitions, 402 flow [2021-06-10 23:50:48,739 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=181, PETRI_TRANSITIONS=90} [2021-06-10 23:50:48,739 INFO L343 CegarLoopForPetriNet]: 180 programPoint places, 1 predicate places. [2021-06-10 23:50:48,739 INFO L480 AbstractCegarLoop]: Abstraction has has 181 places, 90 transitions, 402 flow [2021-06-10 23:50:48,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:48,739 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:48,740 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:48,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-06-10 23:50:48,740 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:48,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:48,740 INFO L82 PathProgramCache]: Analyzing trace with hash -199292694, now seen corresponding path program 1 times [2021-06-10 23:50:48,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:48,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161810257] [2021-06-10 23:50:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:48,746 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:48,748 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:48,752 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:48,752 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:48,752 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-06-10 23:50:48,752 WARN L342 ceAbstractionStarter]: 44 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:48,752 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 45 thread instances. [2021-06-10 23:50:48,782 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:48,783 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:48,783 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:48,783 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:48,783 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:48,783 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:48,783 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:48,783 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:48,783 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:48,783 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:48,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 231 places, 140 transitions, 2485 flow [2021-06-10 23:50:48,811 INFO L129 PetriNetUnfolder]: 0/275 cut-off events. [2021-06-10 23:50:48,811 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:48,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 275 events. 0/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 874 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 0. Up to 46 conditions per place. [2021-06-10 23:50:48,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 140 transitions, 2485 flow [2021-06-10 23:50:48,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 138 transitions, 2481 flow [2021-06-10 23:50:48,813 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:48,813 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 138 transitions, 2481 flow [2021-06-10 23:50:48,813 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 138 transitions, 2481 flow [2021-06-10 23:50:48,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 229 places, 138 transitions, 2481 flow [2021-06-10 23:50:48,835 INFO L129 PetriNetUnfolder]: 0/183 cut-off events. [2021-06-10 23:50:48,835 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:48,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 183 events. 0/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 439 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 0. Up to 46 conditions per place. [2021-06-10 23:50:48,843 INFO L151 LiptonReduction]: Number of co-enabled transitions 12240 [2021-06-10 23:50:51,480 INFO L163 LiptonReduction]: Checked pairs total: 5040 [2021-06-10 23:50:51,481 INFO L165 LiptonReduction]: Total number of compositions: 45 [2021-06-10 23:50:51,481 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2668 [2021-06-10 23:50:51,481 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:51,481 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:51,482 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:51,482 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:51,482 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:51,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:51,482 INFO L82 PathProgramCache]: Analyzing trace with hash 139299, now seen corresponding path program 1 times [2021-06-10 23:50:51,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:51,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415629192] [2021-06-10 23:50:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:51,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:51,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:51,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415629192] [2021-06-10 23:50:51,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:51,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:51,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823172736] [2021-06-10 23:50:51,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:51,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:51,491 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 185 [2021-06-10 23:50:51,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 93 transitions, 2391 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:51,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:51,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 185 [2021-06-10 23:50:51,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:51,507 INFO L129 PetriNetUnfolder]: 0/92 cut-off events. [2021-06-10 23:50:51,507 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:51,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 92 events. 0/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 46/138 useless extension candidates. Maximal degree in co-relation 0. Up to 46 conditions per place. [2021-06-10 23:50:51,507 INFO L132 encePairwiseOnDemand]: 183/185 looper letters, 0 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2021-06-10 23:50:51,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 92 transitions, 2391 flow [2021-06-10 23:50:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2021-06-10 23:50:51,508 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9873873873873874 [2021-06-10 23:50:51,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 548 transitions. [2021-06-10 23:50:51,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 548 transitions. [2021-06-10 23:50:51,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:51,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 548 transitions. [2021-06-10 23:50:51,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:51,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:51,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:51,509 INFO L185 Difference]: Start difference. First operand has 184 places, 93 transitions, 2391 flow. Second operand 3 states and 548 transitions. [2021-06-10 23:50:51,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 92 transitions, 2391 flow [2021-06-10 23:50:51,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 92 transitions, 411 flow, removed 990 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:51,538 INFO L241 Difference]: Finished difference. Result has 185 places, 92 transitions, 411 flow [2021-06-10 23:50:51,539 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=185, PETRI_TRANSITIONS=92} [2021-06-10 23:50:51,539 INFO L343 CegarLoopForPetriNet]: 184 programPoint places, 1 predicate places. [2021-06-10 23:50:51,539 INFO L480 AbstractCegarLoop]: Abstraction has has 185 places, 92 transitions, 411 flow [2021-06-10 23:50:51,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:51,539 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:51,539 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:51,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-06-10 23:50:51,539 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:51,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:51,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564085, now seen corresponding path program 1 times [2021-06-10 23:50:51,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:51,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771765965] [2021-06-10 23:50:51,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:51,546 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:51,547 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:51,551 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:51,552 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:51,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-06-10 23:50:51,552 WARN L342 ceAbstractionStarter]: 45 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:51,552 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 46 thread instances. [2021-06-10 23:50:51,585 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:51,585 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:51,586 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:51,586 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:51,586 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:51,586 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:51,586 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:51,586 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:51,586 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:51,586 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:51,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 236 places, 143 transitions, 2586 flow [2021-06-10 23:50:51,615 INFO L129 PetriNetUnfolder]: 0/281 cut-off events. [2021-06-10 23:50:51,615 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:51,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 281 events. 0/281 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 939 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 0. Up to 47 conditions per place. [2021-06-10 23:50:51,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 143 transitions, 2586 flow [2021-06-10 23:50:51,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 141 transitions, 2582 flow [2021-06-10 23:50:51,617 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:51,617 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 141 transitions, 2582 flow [2021-06-10 23:50:51,617 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 141 transitions, 2582 flow [2021-06-10 23:50:51,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 234 places, 141 transitions, 2582 flow [2021-06-10 23:50:51,639 INFO L129 PetriNetUnfolder]: 0/187 cut-off events. [2021-06-10 23:50:51,640 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:51,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 187 events. 0/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 485 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 0. Up to 47 conditions per place. [2021-06-10 23:50:51,648 INFO L151 LiptonReduction]: Number of co-enabled transitions 12788 [2021-06-10 23:50:54,513 INFO L163 LiptonReduction]: Checked pairs total: 5267 [2021-06-10 23:50:54,514 INFO L165 LiptonReduction]: Total number of compositions: 46 [2021-06-10 23:50:54,514 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2897 [2021-06-10 23:50:54,514 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:50:54,515 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:54,515 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:54,515 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:54,515 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:54,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:54,515 INFO L82 PathProgramCache]: Analyzing trace with hash 145315, now seen corresponding path program 1 times [2021-06-10 23:50:54,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:54,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357978612] [2021-06-10 23:50:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:54,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:54,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:54,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357978612] [2021-06-10 23:50:54,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:54,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:54,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327210768] [2021-06-10 23:50:54,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:54,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:54,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:54,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:54,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 189 [2021-06-10 23:50:54,525 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 95 transitions, 2490 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:54,525 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:54,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 189 [2021-06-10 23:50:54,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:54,541 INFO L129 PetriNetUnfolder]: 0/94 cut-off events. [2021-06-10 23:50:54,541 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:54,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 94 events. 0/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 47/141 useless extension candidates. Maximal degree in co-relation 0. Up to 47 conditions per place. [2021-06-10 23:50:54,541 INFO L132 encePairwiseOnDemand]: 187/189 looper letters, 0 selfloop transitions, 1 changer transitions 0/94 dead transitions. [2021-06-10 23:50:54,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 94 transitions, 2490 flow [2021-06-10 23:50:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2021-06-10 23:50:54,542 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9876543209876543 [2021-06-10 23:50:54,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 560 transitions. [2021-06-10 23:50:54,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions. [2021-06-10 23:50:54,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:54,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions. [2021-06-10 23:50:54,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:54,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:54,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:54,544 INFO L185 Difference]: Start difference. First operand has 188 places, 95 transitions, 2490 flow. Second operand 3 states and 560 transitions. [2021-06-10 23:50:54,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 94 transitions, 2490 flow [2021-06-10 23:50:54,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 94 transitions, 420 flow, removed 1035 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:54,576 INFO L241 Difference]: Finished difference. Result has 189 places, 94 transitions, 420 flow [2021-06-10 23:50:54,576 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=189, PETRI_TRANSITIONS=94} [2021-06-10 23:50:54,576 INFO L343 CegarLoopForPetriNet]: 188 programPoint places, 1 predicate places. [2021-06-10 23:50:54,576 INFO L480 AbstractCegarLoop]: Abstraction has has 189 places, 94 transitions, 420 flow [2021-06-10 23:50:54,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:54,577 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:54,577 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:54,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-06-10 23:50:54,577 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:54,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:54,577 INFO L82 PathProgramCache]: Analyzing trace with hash -790489427, now seen corresponding path program 1 times [2021-06-10 23:50:54,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:54,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497995742] [2021-06-10 23:50:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:54,583 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:54,585 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:54,589 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:54,589 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:54,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-06-10 23:50:54,589 WARN L342 ceAbstractionStarter]: 46 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:54,589 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 47 thread instances. [2021-06-10 23:50:54,621 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:54,622 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:54,622 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:54,622 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:54,622 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:54,622 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:54,622 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:54,622 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:54,622 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:54,622 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:54,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 241 places, 146 transitions, 2689 flow [2021-06-10 23:50:54,653 INFO L129 PetriNetUnfolder]: 0/287 cut-off events. [2021-06-10 23:50:54,653 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:54,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 287 events. 0/287 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 908 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 0. Up to 48 conditions per place. [2021-06-10 23:50:54,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 146 transitions, 2689 flow [2021-06-10 23:50:54,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 144 transitions, 2685 flow [2021-06-10 23:50:54,654 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:54,655 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 144 transitions, 2685 flow [2021-06-10 23:50:54,655 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 144 transitions, 2685 flow [2021-06-10 23:50:54,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 239 places, 144 transitions, 2685 flow [2021-06-10 23:50:54,678 INFO L129 PetriNetUnfolder]: 0/191 cut-off events. [2021-06-10 23:50:54,678 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:54,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 191 events. 0/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 495 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 0. Up to 48 conditions per place. [2021-06-10 23:50:54,686 INFO L151 LiptonReduction]: Number of co-enabled transitions 13348 [2021-06-10 23:50:57,559 INFO L163 LiptonReduction]: Checked pairs total: 5499 [2021-06-10 23:50:57,559 INFO L165 LiptonReduction]: Total number of compositions: 47 [2021-06-10 23:50:57,559 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2905 [2021-06-10 23:50:57,560 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:50:57,560 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:57,560 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:57,560 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:50:57,560 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:57,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:57,560 INFO L82 PathProgramCache]: Analyzing trace with hash 151459, now seen corresponding path program 1 times [2021-06-10 23:50:57,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:57,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654992874] [2021-06-10 23:50:57,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:50:57,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:50:57,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:50:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:50:57,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654992874] [2021-06-10 23:50:57,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:50:57,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:50:57,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784525149] [2021-06-10 23:50:57,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:50:57,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:50:57,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:50:57,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:50:57,571 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 193 [2021-06-10 23:50:57,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 97 transitions, 2591 flow. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:57,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:50:57,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 193 [2021-06-10 23:50:57,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:50:57,588 INFO L129 PetriNetUnfolder]: 0/96 cut-off events. [2021-06-10 23:50:57,588 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:57,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 96 events. 0/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 48/144 useless extension candidates. Maximal degree in co-relation 0. Up to 48 conditions per place. [2021-06-10 23:50:57,588 INFO L132 encePairwiseOnDemand]: 191/193 looper letters, 0 selfloop transitions, 1 changer transitions 0/96 dead transitions. [2021-06-10 23:50:57,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 96 transitions, 2591 flow [2021-06-10 23:50:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:50:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:50:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2021-06-10 23:50:57,589 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9879101899827288 [2021-06-10 23:50:57,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2021-06-10 23:50:57,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2021-06-10 23:50:57,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:50:57,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2021-06-10 23:50:57,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:57,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:57,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:57,590 INFO L185 Difference]: Start difference. First operand has 192 places, 97 transitions, 2591 flow. Second operand 3 states and 572 transitions. [2021-06-10 23:50:57,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 96 transitions, 2591 flow [2021-06-10 23:50:57,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 96 transitions, 429 flow, removed 1081 selfloop flow, removed 0 redundant places. [2021-06-10 23:50:57,623 INFO L241 Difference]: Finished difference. Result has 193 places, 96 transitions, 429 flow [2021-06-10 23:50:57,623 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=193, PETRI_TRANSITIONS=96} [2021-06-10 23:50:57,623 INFO L343 CegarLoopForPetriNet]: 192 programPoint places, 1 predicate places. [2021-06-10 23:50:57,624 INFO L480 AbstractCegarLoop]: Abstraction has has 193 places, 96 transitions, 429 flow [2021-06-10 23:50:57,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:50:57,624 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:50:57,624 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:50:57,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-06-10 23:50:57,624 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:50:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:50:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1706992282, now seen corresponding path program 1 times [2021-06-10 23:50:57,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:50:57,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496007219] [2021-06-10 23:50:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:50:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:57,631 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:50:57,632 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:50:57,637 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:50:57,637 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:50:57,637 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-06-10 23:50:57,638 WARN L342 ceAbstractionStarter]: 47 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:50:57,638 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 48 thread instances. [2021-06-10 23:50:57,672 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:50:57,672 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:50:57,673 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:50:57,673 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:50:57,673 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:50:57,673 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:50:57,673 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:50:57,673 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:50:57,673 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:50:57,673 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:50:57,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 246 places, 149 transitions, 2794 flow [2021-06-10 23:50:57,705 INFO L129 PetriNetUnfolder]: 0/293 cut-off events. [2021-06-10 23:50:57,706 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:57,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 293 events. 0/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 964 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 0. Up to 49 conditions per place. [2021-06-10 23:50:57,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 149 transitions, 2794 flow [2021-06-10 23:50:57,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 147 transitions, 2790 flow [2021-06-10 23:50:57,707 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:50:57,707 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 147 transitions, 2790 flow [2021-06-10 23:50:57,707 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 147 transitions, 2790 flow [2021-06-10 23:50:57,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 244 places, 147 transitions, 2790 flow [2021-06-10 23:50:57,732 INFO L129 PetriNetUnfolder]: 0/195 cut-off events. [2021-06-10 23:50:57,732 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:50:57,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 195 events. 0/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 0. Up to 49 conditions per place. [2021-06-10 23:50:57,741 INFO L151 LiptonReduction]: Number of co-enabled transitions 13920 [2021-06-10 23:51:00,748 INFO L163 LiptonReduction]: Checked pairs total: 5736 [2021-06-10 23:51:00,748 INFO L165 LiptonReduction]: Total number of compositions: 48 [2021-06-10 23:51:00,748 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3041 [2021-06-10 23:51:00,749 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:51:00,749 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:00,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:00,749 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:00,749 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:00,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:00,749 INFO L82 PathProgramCache]: Analyzing trace with hash 157731, now seen corresponding path program 1 times [2021-06-10 23:51:00,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:00,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241876156] [2021-06-10 23:51:00,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:00,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:00,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:00,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241876156] [2021-06-10 23:51:00,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:00,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:00,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459502883] [2021-06-10 23:51:00,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:00,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:00,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:00,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:00,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 197 [2021-06-10 23:51:00,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 99 transitions, 2694 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:00,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:00,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 197 [2021-06-10 23:51:00,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:00,778 INFO L129 PetriNetUnfolder]: 0/98 cut-off events. [2021-06-10 23:51:00,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:00,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 98 events. 0/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 84 event pairs, 0 based on Foata normal form. 49/147 useless extension candidates. Maximal degree in co-relation 0. Up to 49 conditions per place. [2021-06-10 23:51:00,779 INFO L132 encePairwiseOnDemand]: 195/197 looper letters, 0 selfloop transitions, 1 changer transitions 0/98 dead transitions. [2021-06-10 23:51:00,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 98 transitions, 2694 flow [2021-06-10 23:51:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2021-06-10 23:51:00,779 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.988155668358714 [2021-06-10 23:51:00,779 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 584 transitions. [2021-06-10 23:51:00,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 584 transitions. [2021-06-10 23:51:00,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:00,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 584 transitions. [2021-06-10 23:51:00,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:00,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:00,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:00,781 INFO L185 Difference]: Start difference. First operand has 196 places, 99 transitions, 2694 flow. Second operand 3 states and 584 transitions. [2021-06-10 23:51:00,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 98 transitions, 2694 flow [2021-06-10 23:51:00,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 98 transitions, 438 flow, removed 1128 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:00,813 INFO L241 Difference]: Finished difference. Result has 197 places, 98 transitions, 438 flow [2021-06-10 23:51:00,813 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=197, PETRI_TRANSITIONS=98} [2021-06-10 23:51:00,813 INFO L343 CegarLoopForPetriNet]: 196 programPoint places, 1 predicate places. [2021-06-10 23:51:00,813 INFO L480 AbstractCegarLoop]: Abstraction has has 197 places, 98 transitions, 438 flow [2021-06-10 23:51:00,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:00,813 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:00,813 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:00,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-06-10 23:51:00,813 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:00,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:00,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1429030512, now seen corresponding path program 1 times [2021-06-10 23:51:00,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:00,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749089253] [2021-06-10 23:51:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:00,821 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:00,823 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:00,827 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:00,827 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:00,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-06-10 23:51:00,828 WARN L342 ceAbstractionStarter]: 48 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:00,828 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 49 thread instances. [2021-06-10 23:51:00,861 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:00,861 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:00,862 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:00,862 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:00,862 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:00,862 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:00,862 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:00,862 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:00,862 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:00,862 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:00,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 251 places, 152 transitions, 2901 flow [2021-06-10 23:51:00,895 INFO L129 PetriNetUnfolder]: 0/299 cut-off events. [2021-06-10 23:51:00,896 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:00,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 299 events. 0/299 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 994 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 0. Up to 50 conditions per place. [2021-06-10 23:51:00,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 251 places, 152 transitions, 2901 flow [2021-06-10 23:51:00,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 150 transitions, 2897 flow [2021-06-10 23:51:00,897 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:00,897 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 150 transitions, 2897 flow [2021-06-10 23:51:00,897 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 150 transitions, 2897 flow [2021-06-10 23:51:00,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 249 places, 150 transitions, 2897 flow [2021-06-10 23:51:00,923 INFO L129 PetriNetUnfolder]: 0/199 cut-off events. [2021-06-10 23:51:00,924 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:00,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 199 events. 0/199 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 548 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 0. Up to 50 conditions per place. [2021-06-10 23:51:00,933 INFO L151 LiptonReduction]: Number of co-enabled transitions 14504 [2021-06-10 23:51:04,064 INFO L163 LiptonReduction]: Checked pairs total: 5978 [2021-06-10 23:51:04,064 INFO L165 LiptonReduction]: Total number of compositions: 49 [2021-06-10 23:51:04,064 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3167 [2021-06-10 23:51:04,065 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:51:04,065 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:04,065 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:04,065 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:04,065 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash 164131, now seen corresponding path program 1 times [2021-06-10 23:51:04,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:04,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121161180] [2021-06-10 23:51:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:04,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:04,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:04,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121161180] [2021-06-10 23:51:04,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:04,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:04,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031402499] [2021-06-10 23:51:04,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:04,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:04,078 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 201 [2021-06-10 23:51:04,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 101 transitions, 2799 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:04,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:04,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 201 [2021-06-10 23:51:04,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:04,097 INFO L129 PetriNetUnfolder]: 0/100 cut-off events. [2021-06-10 23:51:04,097 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:04,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 100 events. 0/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 50/150 useless extension candidates. Maximal degree in co-relation 0. Up to 50 conditions per place. [2021-06-10 23:51:04,097 INFO L132 encePairwiseOnDemand]: 199/201 looper letters, 0 selfloop transitions, 1 changer transitions 0/100 dead transitions. [2021-06-10 23:51:04,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 100 transitions, 2799 flow [2021-06-10 23:51:04,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 596 transitions. [2021-06-10 23:51:04,098 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.988391376451078 [2021-06-10 23:51:04,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 596 transitions. [2021-06-10 23:51:04,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 596 transitions. [2021-06-10 23:51:04,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:04,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 596 transitions. [2021-06-10 23:51:04,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:04,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:04,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:04,099 INFO L185 Difference]: Start difference. First operand has 200 places, 101 transitions, 2799 flow. Second operand 3 states and 596 transitions. [2021-06-10 23:51:04,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 100 transitions, 2799 flow [2021-06-10 23:51:04,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 100 transitions, 447 flow, removed 1176 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:04,132 INFO L241 Difference]: Finished difference. Result has 201 places, 100 transitions, 447 flow [2021-06-10 23:51:04,132 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=201, PETRI_TRANSITIONS=100} [2021-06-10 23:51:04,132 INFO L343 CegarLoopForPetriNet]: 200 programPoint places, 1 predicate places. [2021-06-10 23:51:04,132 INFO L480 AbstractCegarLoop]: Abstraction has has 201 places, 100 transitions, 447 flow [2021-06-10 23:51:04,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:04,132 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:04,132 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:04,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-06-10 23:51:04,132 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:04,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1177315567, now seen corresponding path program 1 times [2021-06-10 23:51:04,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:04,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682732323] [2021-06-10 23:51:04,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:04,140 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:04,141 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:04,146 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:04,147 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:04,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-06-10 23:51:04,147 WARN L342 ceAbstractionStarter]: 49 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:04,147 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 50 thread instances. [2021-06-10 23:51:04,181 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:04,182 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:04,182 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:04,182 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:04,182 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:04,182 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:04,182 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:04,182 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:04,182 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:04,182 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:04,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 256 places, 155 transitions, 3010 flow [2021-06-10 23:51:04,218 INFO L129 PetriNetUnfolder]: 0/305 cut-off events. [2021-06-10 23:51:04,218 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:04,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 305 events. 0/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1016 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 0. Up to 51 conditions per place. [2021-06-10 23:51:04,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 155 transitions, 3010 flow [2021-06-10 23:51:04,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 153 transitions, 3006 flow [2021-06-10 23:51:04,220 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:04,220 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 153 transitions, 3006 flow [2021-06-10 23:51:04,220 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 153 transitions, 3006 flow [2021-06-10 23:51:04,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 254 places, 153 transitions, 3006 flow [2021-06-10 23:51:04,248 INFO L129 PetriNetUnfolder]: 0/203 cut-off events. [2021-06-10 23:51:04,249 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:04,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 203 events. 0/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 646 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 0. Up to 51 conditions per place. [2021-06-10 23:51:04,260 INFO L151 LiptonReduction]: Number of co-enabled transitions 15100 [2021-06-10 23:51:07,690 INFO L163 LiptonReduction]: Checked pairs total: 6225 [2021-06-10 23:51:07,690 INFO L165 LiptonReduction]: Total number of compositions: 50 [2021-06-10 23:51:07,690 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3470 [2021-06-10 23:51:07,691 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:51:07,691 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:07,691 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:07,691 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:07,691 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:07,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash 170659, now seen corresponding path program 1 times [2021-06-10 23:51:07,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:07,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583436605] [2021-06-10 23:51:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:07,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:07,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:07,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583436605] [2021-06-10 23:51:07,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:07,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:07,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804237269] [2021-06-10 23:51:07,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:07,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:07,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:07,703 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 205 [2021-06-10 23:51:07,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 103 transitions, 2906 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:07,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:07,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 205 [2021-06-10 23:51:07,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:07,722 INFO L129 PetriNetUnfolder]: 0/102 cut-off events. [2021-06-10 23:51:07,722 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:07,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 102 events. 0/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 51/153 useless extension candidates. Maximal degree in co-relation 0. Up to 51 conditions per place. [2021-06-10 23:51:07,723 INFO L132 encePairwiseOnDemand]: 203/205 looper letters, 0 selfloop transitions, 1 changer transitions 0/102 dead transitions. [2021-06-10 23:51:07,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 102 transitions, 2906 flow [2021-06-10 23:51:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2021-06-10 23:51:07,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9886178861788618 [2021-06-10 23:51:07,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 608 transitions. [2021-06-10 23:51:07,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 608 transitions. [2021-06-10 23:51:07,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:07,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 608 transitions. [2021-06-10 23:51:07,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:07,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:07,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:07,725 INFO L185 Difference]: Start difference. First operand has 204 places, 103 transitions, 2906 flow. Second operand 3 states and 608 transitions. [2021-06-10 23:51:07,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 102 transitions, 2906 flow [2021-06-10 23:51:07,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 102 transitions, 456 flow, removed 1225 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:07,760 INFO L241 Difference]: Finished difference. Result has 205 places, 102 transitions, 456 flow [2021-06-10 23:51:07,760 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=205, PETRI_TRANSITIONS=102} [2021-06-10 23:51:07,760 INFO L343 CegarLoopForPetriNet]: 204 programPoint places, 1 predicate places. [2021-06-10 23:51:07,760 INFO L480 AbstractCegarLoop]: Abstraction has has 205 places, 102 transitions, 456 flow [2021-06-10 23:51:07,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:07,761 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:07,761 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:07,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-06-10 23:51:07,761 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash 568827443, now seen corresponding path program 1 times [2021-06-10 23:51:07,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:07,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693009330] [2021-06-10 23:51:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:07,769 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:07,770 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:07,775 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:07,776 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:07,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-06-10 23:51:07,776 WARN L342 ceAbstractionStarter]: 50 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:07,776 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 51 thread instances. [2021-06-10 23:51:07,811 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:07,811 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:07,812 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:07,812 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:07,812 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:07,812 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:07,812 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:07,812 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:07,812 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:07,812 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:07,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 261 places, 158 transitions, 3121 flow [2021-06-10 23:51:07,849 INFO L129 PetriNetUnfolder]: 0/311 cut-off events. [2021-06-10 23:51:07,849 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:07,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 311 events. 0/311 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1045 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 0. Up to 52 conditions per place. [2021-06-10 23:51:07,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 158 transitions, 3121 flow [2021-06-10 23:51:07,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 156 transitions, 3117 flow [2021-06-10 23:51:07,850 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:07,850 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 156 transitions, 3117 flow [2021-06-10 23:51:07,850 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 156 transitions, 3117 flow [2021-06-10 23:51:07,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 259 places, 156 transitions, 3117 flow [2021-06-10 23:51:07,880 INFO L129 PetriNetUnfolder]: 0/207 cut-off events. [2021-06-10 23:51:07,880 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:07,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 207 events. 0/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 550 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 0. Up to 52 conditions per place. [2021-06-10 23:51:07,890 INFO L151 LiptonReduction]: Number of co-enabled transitions 15708 [2021-06-10 23:51:11,348 INFO L163 LiptonReduction]: Checked pairs total: 6477 [2021-06-10 23:51:11,348 INFO L165 LiptonReduction]: Total number of compositions: 51 [2021-06-10 23:51:11,348 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3498 [2021-06-10 23:51:11,349 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:51:11,349 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:11,349 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:11,349 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:11,349 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:11,349 INFO L82 PathProgramCache]: Analyzing trace with hash 177315, now seen corresponding path program 1 times [2021-06-10 23:51:11,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:11,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091040391] [2021-06-10 23:51:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:11,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:11,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:11,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091040391] [2021-06-10 23:51:11,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:11,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:11,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056499911] [2021-06-10 23:51:11,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:11,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:11,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:11,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:11,361 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 209 [2021-06-10 23:51:11,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 105 transitions, 3015 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:11,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:11,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 209 [2021-06-10 23:51:11,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:11,384 INFO L129 PetriNetUnfolder]: 0/104 cut-off events. [2021-06-10 23:51:11,385 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:11,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 104 events. 0/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 107 event pairs, 0 based on Foata normal form. 52/156 useless extension candidates. Maximal degree in co-relation 0. Up to 52 conditions per place. [2021-06-10 23:51:11,385 INFO L132 encePairwiseOnDemand]: 207/209 looper letters, 0 selfloop transitions, 1 changer transitions 0/104 dead transitions. [2021-06-10 23:51:11,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 104 transitions, 3015 flow [2021-06-10 23:51:11,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2021-06-10 23:51:11,386 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.988835725677831 [2021-06-10 23:51:11,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 620 transitions. [2021-06-10 23:51:11,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 620 transitions. [2021-06-10 23:51:11,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:11,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 620 transitions. [2021-06-10 23:51:11,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:11,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:11,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:11,387 INFO L185 Difference]: Start difference. First operand has 208 places, 105 transitions, 3015 flow. Second operand 3 states and 620 transitions. [2021-06-10 23:51:11,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 104 transitions, 3015 flow [2021-06-10 23:51:11,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 104 transitions, 465 flow, removed 1275 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:11,428 INFO L241 Difference]: Finished difference. Result has 209 places, 104 transitions, 465 flow [2021-06-10 23:51:11,428 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=209, PETRI_TRANSITIONS=104} [2021-06-10 23:51:11,428 INFO L343 CegarLoopForPetriNet]: 208 programPoint places, 1 predicate places. [2021-06-10 23:51:11,428 INFO L480 AbstractCegarLoop]: Abstraction has has 209 places, 104 transitions, 465 flow [2021-06-10 23:51:11,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:11,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:11,428 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:11,428 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-06-10 23:51:11,428 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1219012916, now seen corresponding path program 1 times [2021-06-10 23:51:11,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:11,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157342248] [2021-06-10 23:51:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:11,436 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:11,438 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:11,443 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:11,443 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:11,443 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-06-10 23:51:11,443 WARN L342 ceAbstractionStarter]: 51 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:11,443 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 52 thread instances. [2021-06-10 23:51:11,485 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:11,485 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:11,486 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:11,486 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:11,486 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:11,486 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:11,486 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:11,486 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:11,486 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:11,486 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:11,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 266 places, 161 transitions, 3234 flow [2021-06-10 23:51:11,524 INFO L129 PetriNetUnfolder]: 0/317 cut-off events. [2021-06-10 23:51:11,524 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:11,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 317 events. 0/317 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1047 event pairs, 0 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 0. Up to 53 conditions per place. [2021-06-10 23:51:11,525 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 161 transitions, 3234 flow [2021-06-10 23:51:11,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 264 places, 159 transitions, 3230 flow [2021-06-10 23:51:11,526 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:11,526 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 159 transitions, 3230 flow [2021-06-10 23:51:11,526 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 159 transitions, 3230 flow [2021-06-10 23:51:11,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 264 places, 159 transitions, 3230 flow [2021-06-10 23:51:11,557 INFO L129 PetriNetUnfolder]: 0/211 cut-off events. [2021-06-10 23:51:11,557 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:11,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 211 events. 0/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 628 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 0. Up to 53 conditions per place. [2021-06-10 23:51:11,568 INFO L151 LiptonReduction]: Number of co-enabled transitions 16328 [2021-06-10 23:51:15,267 INFO L163 LiptonReduction]: Checked pairs total: 6734 [2021-06-10 23:51:15,267 INFO L165 LiptonReduction]: Total number of compositions: 52 [2021-06-10 23:51:15,267 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3741 [2021-06-10 23:51:15,269 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:51:15,269 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:15,269 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:15,269 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:15,269 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:15,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:15,270 INFO L82 PathProgramCache]: Analyzing trace with hash 184099, now seen corresponding path program 1 times [2021-06-10 23:51:15,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:15,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144699360] [2021-06-10 23:51:15,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:15,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:15,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:15,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144699360] [2021-06-10 23:51:15,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:15,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:15,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764979565] [2021-06-10 23:51:15,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:15,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:15,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:15,293 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 213 [2021-06-10 23:51:15,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 107 transitions, 3126 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:15,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:15,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 213 [2021-06-10 23:51:15,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:15,315 INFO L129 PetriNetUnfolder]: 0/106 cut-off events. [2021-06-10 23:51:15,315 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:15,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 106 events. 0/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 124 event pairs, 0 based on Foata normal form. 53/159 useless extension candidates. Maximal degree in co-relation 0. Up to 53 conditions per place. [2021-06-10 23:51:15,315 INFO L132 encePairwiseOnDemand]: 211/213 looper letters, 0 selfloop transitions, 1 changer transitions 0/106 dead transitions. [2021-06-10 23:51:15,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 106 transitions, 3126 flow [2021-06-10 23:51:15,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2021-06-10 23:51:15,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9890453834115805 [2021-06-10 23:51:15,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 632 transitions. [2021-06-10 23:51:15,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 632 transitions. [2021-06-10 23:51:15,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:15,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 632 transitions. [2021-06-10 23:51:15,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:15,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:15,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:15,319 INFO L185 Difference]: Start difference. First operand has 212 places, 107 transitions, 3126 flow. Second operand 3 states and 632 transitions. [2021-06-10 23:51:15,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 106 transitions, 3126 flow [2021-06-10 23:51:15,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 106 transitions, 474 flow, removed 1326 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:15,362 INFO L241 Difference]: Finished difference. Result has 213 places, 106 transitions, 474 flow [2021-06-10 23:51:15,362 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=213, PETRI_TRANSITIONS=106} [2021-06-10 23:51:15,362 INFO L343 CegarLoopForPetriNet]: 212 programPoint places, 1 predicate places. [2021-06-10 23:51:15,362 INFO L480 AbstractCegarLoop]: Abstraction has has 213 places, 106 transitions, 474 flow [2021-06-10 23:51:15,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:15,362 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:15,363 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:15,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-06-10 23:51:15,363 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:15,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:15,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1650121738, now seen corresponding path program 1 times [2021-06-10 23:51:15,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:15,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772174524] [2021-06-10 23:51:15,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:15,374 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:15,375 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:15,394 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:15,395 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:15,395 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-06-10 23:51:15,395 WARN L342 ceAbstractionStarter]: 52 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:15,395 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 53 thread instances. [2021-06-10 23:51:15,480 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:15,480 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:15,480 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:15,481 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:15,481 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:15,481 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:15,481 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:15,481 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:15,481 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:15,481 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:15,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 271 places, 164 transitions, 3349 flow [2021-06-10 23:51:15,570 INFO L129 PetriNetUnfolder]: 0/323 cut-off events. [2021-06-10 23:51:15,571 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:15,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1914 conditions, 323 events. 0/323 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1066 event pairs, 0 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 0. Up to 54 conditions per place. [2021-06-10 23:51:15,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 271 places, 164 transitions, 3349 flow [2021-06-10 23:51:15,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 269 places, 162 transitions, 3345 flow [2021-06-10 23:51:15,572 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:15,573 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 162 transitions, 3345 flow [2021-06-10 23:51:15,573 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 162 transitions, 3345 flow [2021-06-10 23:51:15,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 269 places, 162 transitions, 3345 flow [2021-06-10 23:51:15,634 INFO L129 PetriNetUnfolder]: 0/215 cut-off events. [2021-06-10 23:51:15,634 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:15,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1806 conditions, 215 events. 0/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 516 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 0. Up to 54 conditions per place. [2021-06-10 23:51:15,645 INFO L151 LiptonReduction]: Number of co-enabled transitions 16960 [2021-06-10 23:51:19,496 INFO L163 LiptonReduction]: Checked pairs total: 6996 [2021-06-10 23:51:19,496 INFO L165 LiptonReduction]: Total number of compositions: 53 [2021-06-10 23:51:19,496 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3924 [2021-06-10 23:51:19,496 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:51:19,497 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:19,497 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:19,497 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:19,497 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:19,497 INFO L82 PathProgramCache]: Analyzing trace with hash 191011, now seen corresponding path program 1 times [2021-06-10 23:51:19,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:19,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139915436] [2021-06-10 23:51:19,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:19,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:19,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:19,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139915436] [2021-06-10 23:51:19,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:19,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:19,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816196237] [2021-06-10 23:51:19,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:19,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:19,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:19,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 217 [2021-06-10 23:51:19,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 109 transitions, 3239 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:19,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:19,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 217 [2021-06-10 23:51:19,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:19,530 INFO L129 PetriNetUnfolder]: 0/108 cut-off events. [2021-06-10 23:51:19,530 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:19,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 108 events. 0/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 103 event pairs, 0 based on Foata normal form. 54/162 useless extension candidates. Maximal degree in co-relation 0. Up to 54 conditions per place. [2021-06-10 23:51:19,531 INFO L132 encePairwiseOnDemand]: 215/217 looper letters, 0 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2021-06-10 23:51:19,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 108 transitions, 3239 flow [2021-06-10 23:51:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 644 transitions. [2021-06-10 23:51:19,531 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.989247311827957 [2021-06-10 23:51:19,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 644 transitions. [2021-06-10 23:51:19,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 644 transitions. [2021-06-10 23:51:19,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:19,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 644 transitions. [2021-06-10 23:51:19,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:19,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:19,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:19,533 INFO L185 Difference]: Start difference. First operand has 216 places, 109 transitions, 3239 flow. Second operand 3 states and 644 transitions. [2021-06-10 23:51:19,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 108 transitions, 3239 flow [2021-06-10 23:51:19,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 108 transitions, 483 flow, removed 1378 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:19,579 INFO L241 Difference]: Finished difference. Result has 217 places, 108 transitions, 483 flow [2021-06-10 23:51:19,579 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=217, PETRI_TRANSITIONS=108} [2021-06-10 23:51:19,579 INFO L343 CegarLoopForPetriNet]: 216 programPoint places, 1 predicate places. [2021-06-10 23:51:19,579 INFO L480 AbstractCegarLoop]: Abstraction has has 217 places, 108 transitions, 483 flow [2021-06-10 23:51:19,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:19,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:19,580 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:19,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-06-10 23:51:19,580 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:19,580 INFO L82 PathProgramCache]: Analyzing trace with hash 292165271, now seen corresponding path program 1 times [2021-06-10 23:51:19,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:19,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183658682] [2021-06-10 23:51:19,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:19,588 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:19,589 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:19,595 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:19,595 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:19,595 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-06-10 23:51:19,595 WARN L342 ceAbstractionStarter]: 53 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:19,595 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 54 thread instances. [2021-06-10 23:51:19,633 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:19,634 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:19,634 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:19,634 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:19,634 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:19,634 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:19,634 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:19,634 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:19,634 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:19,634 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:19,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 276 places, 167 transitions, 3466 flow [2021-06-10 23:51:19,676 INFO L129 PetriNetUnfolder]: 0/329 cut-off events. [2021-06-10 23:51:19,676 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:19,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 329 events. 0/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1063 event pairs, 0 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 0. Up to 55 conditions per place. [2021-06-10 23:51:19,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 167 transitions, 3466 flow [2021-06-10 23:51:19,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 165 transitions, 3462 flow [2021-06-10 23:51:19,677 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:19,678 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 165 transitions, 3462 flow [2021-06-10 23:51:19,678 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 274 places, 165 transitions, 3462 flow [2021-06-10 23:51:19,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 274 places, 165 transitions, 3462 flow [2021-06-10 23:51:19,710 INFO L129 PetriNetUnfolder]: 0/219 cut-off events. [2021-06-10 23:51:19,711 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:19,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1867 conditions, 219 events. 0/219 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 692 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 0. Up to 55 conditions per place. [2021-06-10 23:51:19,722 INFO L151 LiptonReduction]: Number of co-enabled transitions 17604 [2021-06-10 23:51:23,741 INFO L163 LiptonReduction]: Checked pairs total: 7263 [2021-06-10 23:51:23,741 INFO L165 LiptonReduction]: Total number of compositions: 54 [2021-06-10 23:51:23,741 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4064 [2021-06-10 23:51:23,742 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:51:23,742 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:23,742 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:23,742 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:23,742 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:23,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash 198051, now seen corresponding path program 1 times [2021-06-10 23:51:23,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:23,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068705875] [2021-06-10 23:51:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:23,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:23,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:23,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068705875] [2021-06-10 23:51:23,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:23,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:23,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752507148] [2021-06-10 23:51:23,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:23,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:23,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:23,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:23,754 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 221 [2021-06-10 23:51:23,754 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 111 transitions, 3354 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:23,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:23,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 221 [2021-06-10 23:51:23,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:23,777 INFO L129 PetriNetUnfolder]: 0/110 cut-off events. [2021-06-10 23:51:23,777 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:23,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 110 events. 0/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 108 event pairs, 0 based on Foata normal form. 55/165 useless extension candidates. Maximal degree in co-relation 0. Up to 55 conditions per place. [2021-06-10 23:51:23,778 INFO L132 encePairwiseOnDemand]: 219/221 looper letters, 0 selfloop transitions, 1 changer transitions 0/110 dead transitions. [2021-06-10 23:51:23,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 110 transitions, 3354 flow [2021-06-10 23:51:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2021-06-10 23:51:23,778 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9894419306184012 [2021-06-10 23:51:23,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 656 transitions. [2021-06-10 23:51:23,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 656 transitions. [2021-06-10 23:51:23,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:23,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 656 transitions. [2021-06-10 23:51:23,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:23,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:23,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:23,780 INFO L185 Difference]: Start difference. First operand has 220 places, 111 transitions, 3354 flow. Second operand 3 states and 656 transitions. [2021-06-10 23:51:23,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 110 transitions, 3354 flow [2021-06-10 23:51:23,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 110 transitions, 492 flow, removed 1431 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:23,830 INFO L241 Difference]: Finished difference. Result has 221 places, 110 transitions, 492 flow [2021-06-10 23:51:23,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=221, PETRI_TRANSITIONS=110} [2021-06-10 23:51:23,831 INFO L343 CegarLoopForPetriNet]: 220 programPoint places, 1 predicate places. [2021-06-10 23:51:23,831 INFO L480 AbstractCegarLoop]: Abstraction has has 221 places, 110 transitions, 492 flow [2021-06-10 23:51:23,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:23,831 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:23,831 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:23,831 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-06-10 23:51:23,831 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1780032071, now seen corresponding path program 1 times [2021-06-10 23:51:23,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:23,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882899365] [2021-06-10 23:51:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:23,840 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:23,841 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:23,848 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:23,848 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:23,848 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-06-10 23:51:23,848 WARN L342 ceAbstractionStarter]: 54 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:23,848 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 55 thread instances. [2021-06-10 23:51:23,889 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:23,890 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:23,890 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:23,890 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:23,890 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:23,890 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:23,890 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:23,890 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:23,890 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:23,890 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:23,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 281 places, 170 transitions, 3585 flow [2021-06-10 23:51:23,935 INFO L129 PetriNetUnfolder]: 0/335 cut-off events. [2021-06-10 23:51:23,935 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:23,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 335 events. 0/335 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1101 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 0. Up to 56 conditions per place. [2021-06-10 23:51:23,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 170 transitions, 3585 flow [2021-06-10 23:51:23,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 168 transitions, 3581 flow [2021-06-10 23:51:23,937 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:23,937 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 168 transitions, 3581 flow [2021-06-10 23:51:23,937 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 168 transitions, 3581 flow [2021-06-10 23:51:23,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 279 places, 168 transitions, 3581 flow [2021-06-10 23:51:23,971 INFO L129 PetriNetUnfolder]: 0/223 cut-off events. [2021-06-10 23:51:23,972 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:23,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 223 events. 0/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 625 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 0. Up to 56 conditions per place. [2021-06-10 23:51:23,984 INFO L151 LiptonReduction]: Number of co-enabled transitions 18260 [2021-06-10 23:51:28,217 INFO L163 LiptonReduction]: Checked pairs total: 7535 [2021-06-10 23:51:28,217 INFO L165 LiptonReduction]: Total number of compositions: 55 [2021-06-10 23:51:28,217 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4280 [2021-06-10 23:51:28,218 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:51:28,218 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:28,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:28,218 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:28,218 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:28,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:28,218 INFO L82 PathProgramCache]: Analyzing trace with hash 205219, now seen corresponding path program 1 times [2021-06-10 23:51:28,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:28,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375673004] [2021-06-10 23:51:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:28,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:28,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:28,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375673004] [2021-06-10 23:51:28,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:28,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:28,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610566223] [2021-06-10 23:51:28,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:28,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:28,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:28,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:28,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 225 [2021-06-10 23:51:28,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 113 transitions, 3471 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:28,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:28,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 225 [2021-06-10 23:51:28,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:28,263 INFO L129 PetriNetUnfolder]: 0/112 cut-off events. [2021-06-10 23:51:28,263 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:28,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 112 events. 0/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 105 event pairs, 0 based on Foata normal form. 56/168 useless extension candidates. Maximal degree in co-relation 0. Up to 56 conditions per place. [2021-06-10 23:51:28,263 INFO L132 encePairwiseOnDemand]: 223/225 looper letters, 0 selfloop transitions, 1 changer transitions 0/112 dead transitions. [2021-06-10 23:51:28,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 112 transitions, 3471 flow [2021-06-10 23:51:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2021-06-10 23:51:28,264 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9896296296296296 [2021-06-10 23:51:28,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 668 transitions. [2021-06-10 23:51:28,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 668 transitions. [2021-06-10 23:51:28,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:28,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 668 transitions. [2021-06-10 23:51:28,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:28,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:28,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:28,265 INFO L185 Difference]: Start difference. First operand has 224 places, 113 transitions, 3471 flow. Second operand 3 states and 668 transitions. [2021-06-10 23:51:28,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 112 transitions, 3471 flow [2021-06-10 23:51:28,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 112 transitions, 501 flow, removed 1485 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:28,315 INFO L241 Difference]: Finished difference. Result has 225 places, 112 transitions, 501 flow [2021-06-10 23:51:28,316 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=225, PETRI_TRANSITIONS=112} [2021-06-10 23:51:28,316 INFO L343 CegarLoopForPetriNet]: 224 programPoint places, 1 predicate places. [2021-06-10 23:51:28,316 INFO L480 AbstractCegarLoop]: Abstraction has has 225 places, 112 transitions, 501 flow [2021-06-10 23:51:28,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:28,316 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:28,316 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:28,316 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-06-10 23:51:28,316 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1407430542, now seen corresponding path program 1 times [2021-06-10 23:51:28,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:28,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969637354] [2021-06-10 23:51:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:28,326 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:28,327 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:28,334 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:28,334 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:28,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-06-10 23:51:28,334 WARN L342 ceAbstractionStarter]: 55 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:28,334 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 56 thread instances. [2021-06-10 23:51:28,376 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:28,376 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:28,376 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:28,376 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:28,377 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:28,377 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:28,377 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:28,377 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:28,377 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:28,377 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:28,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 286 places, 173 transitions, 3706 flow [2021-06-10 23:51:28,422 INFO L129 PetriNetUnfolder]: 0/341 cut-off events. [2021-06-10 23:51:28,422 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:28,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 341 events. 0/341 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1102 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 0. Up to 57 conditions per place. [2021-06-10 23:51:28,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 173 transitions, 3706 flow [2021-06-10 23:51:28,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 171 transitions, 3702 flow [2021-06-10 23:51:28,424 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:28,424 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 284 places, 171 transitions, 3702 flow [2021-06-10 23:51:28,425 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 284 places, 171 transitions, 3702 flow [2021-06-10 23:51:28,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 284 places, 171 transitions, 3702 flow [2021-06-10 23:51:28,461 INFO L129 PetriNetUnfolder]: 0/227 cut-off events. [2021-06-10 23:51:28,461 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:28,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1992 conditions, 227 events. 0/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 606 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 0. Up to 57 conditions per place. [2021-06-10 23:51:28,475 INFO L151 LiptonReduction]: Number of co-enabled transitions 18928 [2021-06-10 23:51:32,782 INFO L163 LiptonReduction]: Checked pairs total: 7812 [2021-06-10 23:51:32,782 INFO L165 LiptonReduction]: Total number of compositions: 56 [2021-06-10 23:51:32,782 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4358 [2021-06-10 23:51:32,783 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:51:32,783 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:32,783 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:32,783 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:32,783 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash 212515, now seen corresponding path program 1 times [2021-06-10 23:51:32,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:32,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717066028] [2021-06-10 23:51:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:32,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:32,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:32,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717066028] [2021-06-10 23:51:32,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:32,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:32,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804614543] [2021-06-10 23:51:32,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:32,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:32,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:32,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:32,796 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 229 [2021-06-10 23:51:32,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 115 transitions, 3590 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:32,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:32,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 229 [2021-06-10 23:51:32,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:32,820 INFO L129 PetriNetUnfolder]: 0/114 cut-off events. [2021-06-10 23:51:32,821 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:32,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 114 events. 0/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 104 event pairs, 0 based on Foata normal form. 57/171 useless extension candidates. Maximal degree in co-relation 0. Up to 57 conditions per place. [2021-06-10 23:51:32,821 INFO L132 encePairwiseOnDemand]: 227/229 looper letters, 0 selfloop transitions, 1 changer transitions 0/114 dead transitions. [2021-06-10 23:51:32,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 114 transitions, 3590 flow [2021-06-10 23:51:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 680 transitions. [2021-06-10 23:51:32,822 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9898107714701602 [2021-06-10 23:51:32,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 680 transitions. [2021-06-10 23:51:32,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 680 transitions. [2021-06-10 23:51:32,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:32,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 680 transitions. [2021-06-10 23:51:32,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:32,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:32,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:32,823 INFO L185 Difference]: Start difference. First operand has 228 places, 115 transitions, 3590 flow. Second operand 3 states and 680 transitions. [2021-06-10 23:51:32,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 114 transitions, 3590 flow [2021-06-10 23:51:32,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 114 transitions, 510 flow, removed 1540 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:32,877 INFO L241 Difference]: Finished difference. Result has 229 places, 114 transitions, 510 flow [2021-06-10 23:51:32,877 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=229, PETRI_TRANSITIONS=114} [2021-06-10 23:51:32,877 INFO L343 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2021-06-10 23:51:32,877 INFO L480 AbstractCegarLoop]: Abstraction has has 229 places, 114 transitions, 510 flow [2021-06-10 23:51:32,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:32,877 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:32,877 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:32,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-06-10 23:51:32,877 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:32,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:32,878 INFO L82 PathProgramCache]: Analyzing trace with hash -396701316, now seen corresponding path program 1 times [2021-06-10 23:51:32,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:32,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244830556] [2021-06-10 23:51:32,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:32,887 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:32,888 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:32,895 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:32,895 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:32,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-06-10 23:51:32,895 WARN L342 ceAbstractionStarter]: 56 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:32,896 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 57 thread instances. [2021-06-10 23:51:32,939 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:32,940 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:32,940 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:32,940 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:32,940 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:32,940 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:32,940 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:32,940 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:32,940 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:32,940 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:32,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 291 places, 176 transitions, 3829 flow [2021-06-10 23:51:32,987 INFO L129 PetriNetUnfolder]: 0/347 cut-off events. [2021-06-10 23:51:32,987 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:32,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2172 conditions, 347 events. 0/347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1100 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 0. Up to 58 conditions per place. [2021-06-10 23:51:32,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 176 transitions, 3829 flow [2021-06-10 23:51:32,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 174 transitions, 3825 flow [2021-06-10 23:51:32,989 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:32,989 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 289 places, 174 transitions, 3825 flow [2021-06-10 23:51:32,989 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 289 places, 174 transitions, 3825 flow [2021-06-10 23:51:32,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 289 places, 174 transitions, 3825 flow [2021-06-10 23:51:33,026 INFO L129 PetriNetUnfolder]: 0/231 cut-off events. [2021-06-10 23:51:33,027 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:33,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 231 events. 0/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 676 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 0. Up to 58 conditions per place. [2021-06-10 23:51:33,040 INFO L151 LiptonReduction]: Number of co-enabled transitions 19608 [2021-06-10 23:51:37,620 INFO L163 LiptonReduction]: Checked pairs total: 8094 [2021-06-10 23:51:37,620 INFO L165 LiptonReduction]: Total number of compositions: 57 [2021-06-10 23:51:37,620 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4631 [2021-06-10 23:51:37,621 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:51:37,621 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:37,621 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:37,621 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:37,621 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:37,621 INFO L82 PathProgramCache]: Analyzing trace with hash 219939, now seen corresponding path program 1 times [2021-06-10 23:51:37,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:37,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57623715] [2021-06-10 23:51:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:37,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:37,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:37,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57623715] [2021-06-10 23:51:37,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:37,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:37,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953641319] [2021-06-10 23:51:37,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:37,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:37,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:37,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:37,644 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 233 [2021-06-10 23:51:37,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 117 transitions, 3711 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:37,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:37,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 233 [2021-06-10 23:51:37,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:37,670 INFO L129 PetriNetUnfolder]: 0/116 cut-off events. [2021-06-10 23:51:37,670 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:37,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 116 events. 0/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 58/174 useless extension candidates. Maximal degree in co-relation 0. Up to 58 conditions per place. [2021-06-10 23:51:37,671 INFO L132 encePairwiseOnDemand]: 231/233 looper letters, 0 selfloop transitions, 1 changer transitions 0/116 dead transitions. [2021-06-10 23:51:37,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 116 transitions, 3711 flow [2021-06-10 23:51:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2021-06-10 23:51:37,672 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9899856938483548 [2021-06-10 23:51:37,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 692 transitions. [2021-06-10 23:51:37,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 692 transitions. [2021-06-10 23:51:37,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:37,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 692 transitions. [2021-06-10 23:51:37,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:37,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:37,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:37,673 INFO L185 Difference]: Start difference. First operand has 232 places, 117 transitions, 3711 flow. Second operand 3 states and 692 transitions. [2021-06-10 23:51:37,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 116 transitions, 3711 flow [2021-06-10 23:51:37,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 116 transitions, 519 flow, removed 1596 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:37,731 INFO L241 Difference]: Finished difference. Result has 233 places, 116 transitions, 519 flow [2021-06-10 23:51:37,731 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=519, PETRI_PLACES=233, PETRI_TRANSITIONS=116} [2021-06-10 23:51:37,731 INFO L343 CegarLoopForPetriNet]: 232 programPoint places, 1 predicate places. [2021-06-10 23:51:37,731 INFO L480 AbstractCegarLoop]: Abstraction has has 233 places, 116 transitions, 519 flow [2021-06-10 23:51:37,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:37,731 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:37,731 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:37,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-06-10 23:51:37,731 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1672576605, now seen corresponding path program 1 times [2021-06-10 23:51:37,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:37,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068540895] [2021-06-10 23:51:37,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:37,741 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:37,743 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:37,749 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:37,750 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:37,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-06-10 23:51:37,750 WARN L342 ceAbstractionStarter]: 57 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:37,750 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 58 thread instances. [2021-06-10 23:51:37,806 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:37,806 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:37,807 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:37,807 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:37,807 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:37,807 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:37,807 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:37,807 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:37,807 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:37,807 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:37,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 296 places, 179 transitions, 3954 flow [2021-06-10 23:51:37,856 INFO L129 PetriNetUnfolder]: 0/353 cut-off events. [2021-06-10 23:51:37,856 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:37,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 353 events. 0/353 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1158 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 0. Up to 59 conditions per place. [2021-06-10 23:51:37,856 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 179 transitions, 3954 flow [2021-06-10 23:51:37,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 177 transitions, 3950 flow [2021-06-10 23:51:37,858 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:37,858 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 294 places, 177 transitions, 3950 flow [2021-06-10 23:51:37,858 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 294 places, 177 transitions, 3950 flow [2021-06-10 23:51:37,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 294 places, 177 transitions, 3950 flow [2021-06-10 23:51:37,897 INFO L129 PetriNetUnfolder]: 0/235 cut-off events. [2021-06-10 23:51:37,897 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:37,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 235 events. 0/235 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 636 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 0. Up to 59 conditions per place. [2021-06-10 23:51:37,912 INFO L151 LiptonReduction]: Number of co-enabled transitions 20300 [2021-06-10 23:51:42,594 INFO L163 LiptonReduction]: Checked pairs total: 8381 [2021-06-10 23:51:42,594 INFO L165 LiptonReduction]: Total number of compositions: 58 [2021-06-10 23:51:42,594 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4736 [2021-06-10 23:51:42,595 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:51:42,595 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:42,595 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:42,595 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:42,595 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:42,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash 227491, now seen corresponding path program 1 times [2021-06-10 23:51:42,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:42,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539265288] [2021-06-10 23:51:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:42,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:42,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:42,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539265288] [2021-06-10 23:51:42,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:42,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:42,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149726698] [2021-06-10 23:51:42,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:42,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:42,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:42,616 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 237 [2021-06-10 23:51:42,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 119 transitions, 3834 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:42,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:42,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 237 [2021-06-10 23:51:42,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:42,643 INFO L129 PetriNetUnfolder]: 0/118 cut-off events. [2021-06-10 23:51:42,643 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:42,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2006 conditions, 118 events. 0/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 100 event pairs, 0 based on Foata normal form. 59/177 useless extension candidates. Maximal degree in co-relation 0. Up to 59 conditions per place. [2021-06-10 23:51:42,643 INFO L132 encePairwiseOnDemand]: 235/237 looper letters, 0 selfloop transitions, 1 changer transitions 0/118 dead transitions. [2021-06-10 23:51:42,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 118 transitions, 3834 flow [2021-06-10 23:51:42,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2021-06-10 23:51:42,644 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9901547116736991 [2021-06-10 23:51:42,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2021-06-10 23:51:42,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2021-06-10 23:51:42,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:42,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2021-06-10 23:51:42,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:42,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:42,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:42,646 INFO L185 Difference]: Start difference. First operand has 236 places, 119 transitions, 3834 flow. Second operand 3 states and 704 transitions. [2021-06-10 23:51:42,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 118 transitions, 3834 flow [2021-06-10 23:51:42,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 118 transitions, 528 flow, removed 1653 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:42,707 INFO L241 Difference]: Finished difference. Result has 237 places, 118 transitions, 528 flow [2021-06-10 23:51:42,707 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=237, PETRI_TRANSITIONS=118} [2021-06-10 23:51:42,707 INFO L343 CegarLoopForPetriNet]: 236 programPoint places, 1 predicate places. [2021-06-10 23:51:42,707 INFO L480 AbstractCegarLoop]: Abstraction has has 237 places, 118 transitions, 528 flow [2021-06-10 23:51:42,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:42,707 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:42,707 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:42,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-06-10 23:51:42,708 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:42,708 INFO L82 PathProgramCache]: Analyzing trace with hash 874251583, now seen corresponding path program 1 times [2021-06-10 23:51:42,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:42,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122185487] [2021-06-10 23:51:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:42,718 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:42,719 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:42,726 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:42,726 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:42,727 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-06-10 23:51:42,727 WARN L342 ceAbstractionStarter]: 58 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:42,727 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 59 thread instances. [2021-06-10 23:51:42,768 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:42,768 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:42,769 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:42,769 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:42,769 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:42,769 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:42,769 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:42,769 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:42,769 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:42,769 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:42,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 301 places, 182 transitions, 4081 flow [2021-06-10 23:51:42,819 INFO L129 PetriNetUnfolder]: 0/359 cut-off events. [2021-06-10 23:51:42,819 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:42,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2307 conditions, 359 events. 0/359 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1189 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 0. Up to 60 conditions per place. [2021-06-10 23:51:42,819 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 182 transitions, 4081 flow [2021-06-10 23:51:42,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 180 transitions, 4077 flow [2021-06-10 23:51:42,821 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:42,821 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 180 transitions, 4077 flow [2021-06-10 23:51:42,821 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 180 transitions, 4077 flow [2021-06-10 23:51:42,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 299 places, 180 transitions, 4077 flow [2021-06-10 23:51:42,861 INFO L129 PetriNetUnfolder]: 0/239 cut-off events. [2021-06-10 23:51:42,861 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:42,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 239 events. 0/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 719 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 0. Up to 60 conditions per place. [2021-06-10 23:51:42,876 INFO L151 LiptonReduction]: Number of co-enabled transitions 21004 [2021-06-10 23:51:47,794 INFO L163 LiptonReduction]: Checked pairs total: 8673 [2021-06-10 23:51:47,794 INFO L165 LiptonReduction]: Total number of compositions: 59 [2021-06-10 23:51:47,794 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4973 [2021-06-10 23:51:47,795 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:51:47,795 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:47,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:47,795 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:47,795 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:47,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash 235171, now seen corresponding path program 1 times [2021-06-10 23:51:47,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:47,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244109011] [2021-06-10 23:51:47,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:47,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:47,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:47,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244109011] [2021-06-10 23:51:47,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:47,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:47,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019665521] [2021-06-10 23:51:47,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:47,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:47,810 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 241 [2021-06-10 23:51:47,811 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 121 transitions, 3959 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:47,811 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:47,811 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 241 [2021-06-10 23:51:47,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:47,838 INFO L129 PetriNetUnfolder]: 0/120 cut-off events. [2021-06-10 23:51:47,838 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:47,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 120 events. 0/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 60/180 useless extension candidates. Maximal degree in co-relation 0. Up to 60 conditions per place. [2021-06-10 23:51:47,839 INFO L132 encePairwiseOnDemand]: 239/241 looper letters, 0 selfloop transitions, 1 changer transitions 0/120 dead transitions. [2021-06-10 23:51:47,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 120 transitions, 3959 flow [2021-06-10 23:51:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2021-06-10 23:51:47,839 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9903181189488244 [2021-06-10 23:51:47,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 716 transitions. [2021-06-10 23:51:47,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 716 transitions. [2021-06-10 23:51:47,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:47,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 716 transitions. [2021-06-10 23:51:47,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:47,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:47,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:47,841 INFO L185 Difference]: Start difference. First operand has 240 places, 121 transitions, 3959 flow. Second operand 3 states and 716 transitions. [2021-06-10 23:51:47,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 120 transitions, 3959 flow [2021-06-10 23:51:47,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 120 transitions, 537 flow, removed 1711 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:47,906 INFO L241 Difference]: Finished difference. Result has 241 places, 120 transitions, 537 flow [2021-06-10 23:51:47,906 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=241, PETRI_TRANSITIONS=120} [2021-06-10 23:51:47,906 INFO L343 CegarLoopForPetriNet]: 240 programPoint places, 1 predicate places. [2021-06-10 23:51:47,906 INFO L480 AbstractCegarLoop]: Abstraction has has 241 places, 120 transitions, 537 flow [2021-06-10 23:51:47,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:47,907 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:47,907 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:47,907 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-06-10 23:51:47,907 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1755309480, now seen corresponding path program 1 times [2021-06-10 23:51:47,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:47,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107324514] [2021-06-10 23:51:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:47,917 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:47,918 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:47,925 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:47,926 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:47,926 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-06-10 23:51:47,926 WARN L342 ceAbstractionStarter]: 59 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:47,926 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 60 thread instances. [2021-06-10 23:51:47,969 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:47,969 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:47,970 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:47,970 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:47,970 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:47,970 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:47,970 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:47,970 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:47,970 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:47,970 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:47,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 306 places, 185 transitions, 4210 flow [2021-06-10 23:51:48,022 INFO L129 PetriNetUnfolder]: 0/365 cut-off events. [2021-06-10 23:51:48,023 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:48,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2376 conditions, 365 events. 0/365 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1233 event pairs, 0 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 0. Up to 61 conditions per place. [2021-06-10 23:51:48,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 306 places, 185 transitions, 4210 flow [2021-06-10 23:51:48,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 304 places, 183 transitions, 4206 flow [2021-06-10 23:51:48,025 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:48,025 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 183 transitions, 4206 flow [2021-06-10 23:51:48,025 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 183 transitions, 4206 flow [2021-06-10 23:51:48,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 304 places, 183 transitions, 4206 flow [2021-06-10 23:51:48,066 INFO L129 PetriNetUnfolder]: 0/243 cut-off events. [2021-06-10 23:51:48,066 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:48,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2254 conditions, 243 events. 0/243 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 690 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 0. Up to 61 conditions per place. [2021-06-10 23:51:48,082 INFO L151 LiptonReduction]: Number of co-enabled transitions 21720 [2021-06-10 23:51:53,242 INFO L163 LiptonReduction]: Checked pairs total: 8970 [2021-06-10 23:51:53,243 INFO L165 LiptonReduction]: Total number of compositions: 60 [2021-06-10 23:51:53,243 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5218 [2021-06-10 23:51:53,243 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:51:53,243 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:53,243 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:53,244 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:53,244 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash 242979, now seen corresponding path program 1 times [2021-06-10 23:51:53,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:53,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650891289] [2021-06-10 23:51:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:53,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:53,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:53,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650891289] [2021-06-10 23:51:53,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:53,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:53,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560251607] [2021-06-10 23:51:53,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:53,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:53,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:53,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:53,258 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 245 [2021-06-10 23:51:53,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 123 transitions, 4086 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:53,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:53,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 245 [2021-06-10 23:51:53,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:53,287 INFO L129 PetriNetUnfolder]: 0/122 cut-off events. [2021-06-10 23:51:53,287 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:53,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 122 events. 0/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 118 event pairs, 0 based on Foata normal form. 61/183 useless extension candidates. Maximal degree in co-relation 0. Up to 61 conditions per place. [2021-06-10 23:51:53,288 INFO L132 encePairwiseOnDemand]: 243/245 looper letters, 0 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2021-06-10 23:51:53,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 122 transitions, 4086 flow [2021-06-10 23:51:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2021-06-10 23:51:53,288 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9904761904761905 [2021-06-10 23:51:53,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 728 transitions. [2021-06-10 23:51:53,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 728 transitions. [2021-06-10 23:51:53,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:53,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 728 transitions. [2021-06-10 23:51:53,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:53,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:53,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:53,290 INFO L185 Difference]: Start difference. First operand has 244 places, 123 transitions, 4086 flow. Second operand 3 states and 728 transitions. [2021-06-10 23:51:53,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 122 transitions, 4086 flow [2021-06-10 23:51:53,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 122 transitions, 546 flow, removed 1770 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:53,360 INFO L241 Difference]: Finished difference. Result has 245 places, 122 transitions, 546 flow [2021-06-10 23:51:53,360 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=245, PETRI_TRANSITIONS=122} [2021-06-10 23:51:53,360 INFO L343 CegarLoopForPetriNet]: 244 programPoint places, 1 predicate places. [2021-06-10 23:51:53,360 INFO L480 AbstractCegarLoop]: Abstraction has has 245 places, 122 transitions, 546 flow [2021-06-10 23:51:53,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:53,360 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:53,360 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:53,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-06-10 23:51:53,361 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:53,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:53,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1829601534, now seen corresponding path program 1 times [2021-06-10 23:51:53,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:53,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384276172] [2021-06-10 23:51:53,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:53,372 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:53,373 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:53,381 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:53,381 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:53,381 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-06-10 23:51:53,381 WARN L342 ceAbstractionStarter]: 60 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:53,382 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 61 thread instances. [2021-06-10 23:51:53,425 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:53,425 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:53,426 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:53,426 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:53,426 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:53,426 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:53,426 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:53,426 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:53,426 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:53,426 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:53,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 311 places, 188 transitions, 4341 flow [2021-06-10 23:51:53,480 INFO L129 PetriNetUnfolder]: 0/371 cut-off events. [2021-06-10 23:51:53,480 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:53,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 371 events. 0/371 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1193 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 0. Up to 62 conditions per place. [2021-06-10 23:51:53,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 188 transitions, 4341 flow [2021-06-10 23:51:53,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 309 places, 186 transitions, 4337 flow [2021-06-10 23:51:53,482 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:53,482 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 309 places, 186 transitions, 4337 flow [2021-06-10 23:51:53,483 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 309 places, 186 transitions, 4337 flow [2021-06-10 23:51:53,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 309 places, 186 transitions, 4337 flow [2021-06-10 23:51:53,527 INFO L129 PetriNetUnfolder]: 0/247 cut-off events. [2021-06-10 23:51:53,528 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:53,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 247 events. 0/247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 683 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 0. Up to 62 conditions per place. [2021-06-10 23:51:53,544 INFO L151 LiptonReduction]: Number of co-enabled transitions 22448 [2021-06-10 23:51:58,910 INFO L163 LiptonReduction]: Checked pairs total: 9272 [2021-06-10 23:51:58,910 INFO L165 LiptonReduction]: Total number of compositions: 61 [2021-06-10 23:51:58,910 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5428 [2021-06-10 23:51:58,911 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:51:58,911 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:58,911 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:58,911 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:51:58,911 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash 250915, now seen corresponding path program 1 times [2021-06-10 23:51:58,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:58,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067084194] [2021-06-10 23:51:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:51:58,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:51:58,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:51:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:51:58,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067084194] [2021-06-10 23:51:58,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:51:58,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:51:58,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822527257] [2021-06-10 23:51:58,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:51:58,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:51:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:51:58,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:51:58,925 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 249 [2021-06-10 23:51:58,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 125 transitions, 4215 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:58,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:51:58,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 249 [2021-06-10 23:51:58,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:51:58,955 INFO L129 PetriNetUnfolder]: 0/124 cut-off events. [2021-06-10 23:51:58,955 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:58,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 124 events. 0/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 135 event pairs, 0 based on Foata normal form. 62/186 useless extension candidates. Maximal degree in co-relation 0. Up to 62 conditions per place. [2021-06-10 23:51:58,955 INFO L132 encePairwiseOnDemand]: 247/249 looper letters, 0 selfloop transitions, 1 changer transitions 0/124 dead transitions. [2021-06-10 23:51:58,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 124 transitions, 4215 flow [2021-06-10 23:51:58,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:51:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:51:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 740 transitions. [2021-06-10 23:51:58,956 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9906291834002677 [2021-06-10 23:51:58,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 740 transitions. [2021-06-10 23:51:58,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 740 transitions. [2021-06-10 23:51:58,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:51:58,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 740 transitions. [2021-06-10 23:51:58,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:58,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:58,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:58,957 INFO L185 Difference]: Start difference. First operand has 248 places, 125 transitions, 4215 flow. Second operand 3 states and 740 transitions. [2021-06-10 23:51:58,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 124 transitions, 4215 flow [2021-06-10 23:51:59,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 124 transitions, 555 flow, removed 1830 selfloop flow, removed 0 redundant places. [2021-06-10 23:51:59,034 INFO L241 Difference]: Finished difference. Result has 249 places, 124 transitions, 555 flow [2021-06-10 23:51:59,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=249, PETRI_TRANSITIONS=124} [2021-06-10 23:51:59,035 INFO L343 CegarLoopForPetriNet]: 248 programPoint places, 1 predicate places. [2021-06-10 23:51:59,035 INFO L480 AbstractCegarLoop]: Abstraction has has 249 places, 124 transitions, 555 flow [2021-06-10 23:51:59,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:51:59,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:51:59,035 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:51:59,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-06-10 23:51:59,035 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:51:59,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:51:59,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1408131485, now seen corresponding path program 1 times [2021-06-10 23:51:59,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:51:59,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363440002] [2021-06-10 23:51:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:51:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:59,045 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:51:59,046 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:51:59,054 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:51:59,054 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:51:59,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-06-10 23:51:59,054 WARN L342 ceAbstractionStarter]: 61 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:51:59,055 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 62 thread instances. [2021-06-10 23:51:59,103 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:51:59,104 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:51:59,104 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:51:59,104 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:51:59,104 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:51:59,104 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:51:59,104 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:51:59,104 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:51:59,104 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:51:59,104 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:51:59,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 316 places, 191 transitions, 4474 flow [2021-06-10 23:51:59,161 INFO L129 PetriNetUnfolder]: 0/377 cut-off events. [2021-06-10 23:51:59,161 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:59,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2517 conditions, 377 events. 0/377 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1230 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 0. Up to 63 conditions per place. [2021-06-10 23:51:59,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 316 places, 191 transitions, 4474 flow [2021-06-10 23:51:59,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 314 places, 189 transitions, 4470 flow [2021-06-10 23:51:59,163 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:51:59,163 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 314 places, 189 transitions, 4470 flow [2021-06-10 23:51:59,163 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 314 places, 189 transitions, 4470 flow [2021-06-10 23:51:59,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 314 places, 189 transitions, 4470 flow [2021-06-10 23:51:59,291 INFO L129 PetriNetUnfolder]: 0/251 cut-off events. [2021-06-10 23:51:59,292 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:51:59,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 251 events. 0/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 787 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 0. Up to 63 conditions per place. [2021-06-10 23:51:59,308 INFO L151 LiptonReduction]: Number of co-enabled transitions 23188 [2021-06-10 23:52:04,884 INFO L163 LiptonReduction]: Checked pairs total: 9579 [2021-06-10 23:52:04,884 INFO L165 LiptonReduction]: Total number of compositions: 62 [2021-06-10 23:52:04,885 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5722 [2021-06-10 23:52:04,885 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:52:04,885 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:04,885 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:04,885 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:52:04,885 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:04,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash 258979, now seen corresponding path program 1 times [2021-06-10 23:52:04,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:04,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024660372] [2021-06-10 23:52:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:52:04,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:52:04,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:52:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:52:04,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024660372] [2021-06-10 23:52:04,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:52:04,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:52:04,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637418937] [2021-06-10 23:52:04,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:52:04,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:52:04,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:52:04,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:52:04,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 253 [2021-06-10 23:52:04,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 127 transitions, 4346 flow. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:04,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:52:04,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 253 [2021-06-10 23:52:04,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:52:04,930 INFO L129 PetriNetUnfolder]: 0/126 cut-off events. [2021-06-10 23:52:04,930 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:04,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 126 events. 0/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 126 event pairs, 0 based on Foata normal form. 63/189 useless extension candidates. Maximal degree in co-relation 0. Up to 63 conditions per place. [2021-06-10 23:52:04,930 INFO L132 encePairwiseOnDemand]: 251/253 looper letters, 0 selfloop transitions, 1 changer transitions 0/126 dead transitions. [2021-06-10 23:52:04,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 126 transitions, 4346 flow [2021-06-10 23:52:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:52:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:52:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2021-06-10 23:52:04,931 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9907773386034255 [2021-06-10 23:52:04,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2021-06-10 23:52:04,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2021-06-10 23:52:04,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:52:04,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2021-06-10 23:52:04,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:04,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:04,932 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:04,932 INFO L185 Difference]: Start difference. First operand has 252 places, 127 transitions, 4346 flow. Second operand 3 states and 752 transitions. [2021-06-10 23:52:04,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 126 transitions, 4346 flow [2021-06-10 23:52:05,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 126 transitions, 564 flow, removed 1891 selfloop flow, removed 0 redundant places. [2021-06-10 23:52:05,019 INFO L241 Difference]: Finished difference. Result has 253 places, 126 transitions, 564 flow [2021-06-10 23:52:05,019 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=253, PETRI_TRANSITIONS=126} [2021-06-10 23:52:05,019 INFO L343 CegarLoopForPetriNet]: 252 programPoint places, 1 predicate places. [2021-06-10 23:52:05,019 INFO L480 AbstractCegarLoop]: Abstraction has has 253 places, 126 transitions, 564 flow [2021-06-10 23:52:05,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:05,019 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:05,019 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:52:05,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-06-10 23:52:05,019 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:05,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1519600837, now seen corresponding path program 1 times [2021-06-10 23:52:05,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:05,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284015003] [2021-06-10 23:52:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:05,030 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:05,031 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:05,039 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:52:05,040 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:52:05,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-06-10 23:52:05,040 WARN L342 ceAbstractionStarter]: 62 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:52:05,040 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 63 thread instances. [2021-06-10 23:52:05,089 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:52:05,090 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:52:05,090 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:52:05,090 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:52:05,090 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:52:05,090 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:52:05,090 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:52:05,090 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:52:05,090 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:52:05,090 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:52:05,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 321 places, 194 transitions, 4609 flow [2021-06-10 23:52:05,148 INFO L129 PetriNetUnfolder]: 0/383 cut-off events. [2021-06-10 23:52:05,149 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:05,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2589 conditions, 383 events. 0/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1401 event pairs, 0 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 0. Up to 64 conditions per place. [2021-06-10 23:52:05,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 321 places, 194 transitions, 4609 flow [2021-06-10 23:52:05,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 192 transitions, 4605 flow [2021-06-10 23:52:05,151 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:52:05,151 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 319 places, 192 transitions, 4605 flow [2021-06-10 23:52:05,151 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 319 places, 192 transitions, 4605 flow [2021-06-10 23:52:05,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 319 places, 192 transitions, 4605 flow [2021-06-10 23:52:05,197 INFO L129 PetriNetUnfolder]: 0/255 cut-off events. [2021-06-10 23:52:05,198 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:05,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 255 events. 0/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 689 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 0. Up to 64 conditions per place. [2021-06-10 23:52:05,215 INFO L151 LiptonReduction]: Number of co-enabled transitions 23940 [2021-06-10 23:52:11,009 INFO L163 LiptonReduction]: Checked pairs total: 9891 [2021-06-10 23:52:11,009 INFO L165 LiptonReduction]: Total number of compositions: 63 [2021-06-10 23:52:11,010 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5859 [2021-06-10 23:52:11,010 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:52:11,010 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:11,011 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:11,011 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:52:11,011 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash 267171, now seen corresponding path program 1 times [2021-06-10 23:52:11,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:11,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930877831] [2021-06-10 23:52:11,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:52:11,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:52:11,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:52:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:52:11,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930877831] [2021-06-10 23:52:11,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:52:11,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:52:11,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899932973] [2021-06-10 23:52:11,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:52:11,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:52:11,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:52:11,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:52:11,025 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 257 [2021-06-10 23:52:11,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 129 transitions, 4479 flow. Second operand has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:11,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:52:11,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 257 [2021-06-10 23:52:11,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:52:11,057 INFO L129 PetriNetUnfolder]: 0/128 cut-off events. [2021-06-10 23:52:11,057 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:11,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2336 conditions, 128 events. 0/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 123 event pairs, 0 based on Foata normal form. 64/192 useless extension candidates. Maximal degree in co-relation 0. Up to 64 conditions per place. [2021-06-10 23:52:11,058 INFO L132 encePairwiseOnDemand]: 255/257 looper letters, 0 selfloop transitions, 1 changer transitions 0/128 dead transitions. [2021-06-10 23:52:11,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 128 transitions, 4479 flow [2021-06-10 23:52:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:52:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:52:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 764 transitions. [2021-06-10 23:52:11,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9909208819714657 [2021-06-10 23:52:11,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 764 transitions. [2021-06-10 23:52:11,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 764 transitions. [2021-06-10 23:52:11,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:52:11,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 764 transitions. [2021-06-10 23:52:11,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:11,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:11,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:11,060 INFO L185 Difference]: Start difference. First operand has 256 places, 129 transitions, 4479 flow. Second operand 3 states and 764 transitions. [2021-06-10 23:52:11,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 128 transitions, 4479 flow [2021-06-10 23:52:11,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 128 transitions, 573 flow, removed 1953 selfloop flow, removed 0 redundant places. [2021-06-10 23:52:11,153 INFO L241 Difference]: Finished difference. Result has 257 places, 128 transitions, 573 flow [2021-06-10 23:52:11,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=257, PETRI_TRANSITIONS=128} [2021-06-10 23:52:11,153 INFO L343 CegarLoopForPetriNet]: 256 programPoint places, 1 predicate places. [2021-06-10 23:52:11,153 INFO L480 AbstractCegarLoop]: Abstraction has has 257 places, 128 transitions, 573 flow [2021-06-10 23:52:11,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:11,153 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:11,153 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:52:11,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-06-10 23:52:11,153 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:11,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2027780994, now seen corresponding path program 1 times [2021-06-10 23:52:11,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:11,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628446041] [2021-06-10 23:52:11,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:11,164 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:11,166 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:11,174 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:52:11,174 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:52:11,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-06-10 23:52:11,174 WARN L342 ceAbstractionStarter]: 63 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:52:11,174 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 64 thread instances. [2021-06-10 23:52:11,229 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:52:11,230 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:52:11,230 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:52:11,230 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:52:11,230 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:52:11,230 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:52:11,230 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:52:11,230 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:52:11,230 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:52:11,230 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:52:11,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 326 places, 197 transitions, 4746 flow [2021-06-10 23:52:11,290 INFO L129 PetriNetUnfolder]: 0/389 cut-off events. [2021-06-10 23:52:11,290 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:11,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 389 events. 0/389 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1407 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 0. Up to 65 conditions per place. [2021-06-10 23:52:11,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 326 places, 197 transitions, 4746 flow [2021-06-10 23:52:11,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 324 places, 195 transitions, 4742 flow [2021-06-10 23:52:11,292 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:52:11,293 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 195 transitions, 4742 flow [2021-06-10 23:52:11,293 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 195 transitions, 4742 flow [2021-06-10 23:52:11,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 324 places, 195 transitions, 4742 flow [2021-06-10 23:52:11,341 INFO L129 PetriNetUnfolder]: 0/259 cut-off events. [2021-06-10 23:52:11,341 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:11,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 259 events. 0/259 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 701 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 0. Up to 65 conditions per place. [2021-06-10 23:52:11,360 INFO L151 LiptonReduction]: Number of co-enabled transitions 24704 [2021-06-10 23:52:17,476 INFO L163 LiptonReduction]: Checked pairs total: 10208 [2021-06-10 23:52:17,476 INFO L165 LiptonReduction]: Total number of compositions: 64 [2021-06-10 23:52:17,476 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6184 [2021-06-10 23:52:17,477 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:52:17,477 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:17,477 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:17,477 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:52:17,477 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 275491, now seen corresponding path program 1 times [2021-06-10 23:52:17,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:17,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373742155] [2021-06-10 23:52:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:52:17,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:52:17,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:52:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:52:17,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373742155] [2021-06-10 23:52:17,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:52:17,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:52:17,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460677432] [2021-06-10 23:52:17,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:52:17,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:52:17,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:52:17,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:52:17,495 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 261 [2021-06-10 23:52:17,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 131 transitions, 4614 flow. Second operand has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:17,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:52:17,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 261 [2021-06-10 23:52:17,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:52:17,527 INFO L129 PetriNetUnfolder]: 0/130 cut-off events. [2021-06-10 23:52:17,527 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:17,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 130 events. 0/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 150 event pairs, 0 based on Foata normal form. 65/195 useless extension candidates. Maximal degree in co-relation 0. Up to 65 conditions per place. [2021-06-10 23:52:17,528 INFO L132 encePairwiseOnDemand]: 259/261 looper letters, 0 selfloop transitions, 1 changer transitions 0/130 dead transitions. [2021-06-10 23:52:17,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 130 transitions, 4614 flow [2021-06-10 23:52:17,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:52:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:52:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2021-06-10 23:52:17,529 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9910600255427842 [2021-06-10 23:52:17,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 776 transitions. [2021-06-10 23:52:17,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 776 transitions. [2021-06-10 23:52:17,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:52:17,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 776 transitions. [2021-06-10 23:52:17,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:17,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:17,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:17,530 INFO L185 Difference]: Start difference. First operand has 260 places, 131 transitions, 4614 flow. Second operand 3 states and 776 transitions. [2021-06-10 23:52:17,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 130 transitions, 4614 flow [2021-06-10 23:52:17,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 130 transitions, 582 flow, removed 2016 selfloop flow, removed 0 redundant places. [2021-06-10 23:52:17,634 INFO L241 Difference]: Finished difference. Result has 261 places, 130 transitions, 582 flow [2021-06-10 23:52:17,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=261, PETRI_TRANSITIONS=130} [2021-06-10 23:52:17,634 INFO L343 CegarLoopForPetriNet]: 260 programPoint places, 1 predicate places. [2021-06-10 23:52:17,634 INFO L480 AbstractCegarLoop]: Abstraction has has 261 places, 130 transitions, 582 flow [2021-06-10 23:52:17,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 258.6666666666667) internal successors, (776), 3 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:17,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:17,634 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:52:17,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-06-10 23:52:17,634 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:17,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:17,635 INFO L82 PathProgramCache]: Analyzing trace with hash -438281080, now seen corresponding path program 1 times [2021-06-10 23:52:17,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:17,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97119002] [2021-06-10 23:52:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:17,646 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:17,648 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:17,656 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:52:17,656 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:52:17,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-06-10 23:52:17,657 WARN L342 ceAbstractionStarter]: 64 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:52:17,657 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 65 thread instances. [2021-06-10 23:52:17,715 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:52:17,715 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:52:17,715 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:52:17,715 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:52:17,715 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:52:17,715 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:52:17,715 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:52:17,716 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:52:17,716 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:52:17,716 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:52:17,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 331 places, 200 transitions, 4885 flow [2021-06-10 23:52:17,778 INFO L129 PetriNetUnfolder]: 0/395 cut-off events. [2021-06-10 23:52:17,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:17,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 395 events. 0/395 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1471 event pairs, 0 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 0. Up to 66 conditions per place. [2021-06-10 23:52:17,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 200 transitions, 4885 flow [2021-06-10 23:52:17,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 329 places, 198 transitions, 4881 flow [2021-06-10 23:52:17,781 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:52:17,781 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 329 places, 198 transitions, 4881 flow [2021-06-10 23:52:17,781 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 329 places, 198 transitions, 4881 flow [2021-06-10 23:52:17,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 329 places, 198 transitions, 4881 flow [2021-06-10 23:52:17,831 INFO L129 PetriNetUnfolder]: 0/263 cut-off events. [2021-06-10 23:52:17,831 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:17,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2604 conditions, 263 events. 0/263 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 735 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 0. Up to 66 conditions per place. [2021-06-10 23:52:17,850 INFO L151 LiptonReduction]: Number of co-enabled transitions 25480 [2021-06-10 23:52:24,338 INFO L163 LiptonReduction]: Checked pairs total: 10530 [2021-06-10 23:52:24,338 INFO L165 LiptonReduction]: Total number of compositions: 65 [2021-06-10 23:52:24,339 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6558 [2021-06-10 23:52:24,339 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:52:24,339 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:24,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:24,339 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:52:24,340 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:24,340 INFO L82 PathProgramCache]: Analyzing trace with hash 283939, now seen corresponding path program 1 times [2021-06-10 23:52:24,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:24,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052691843] [2021-06-10 23:52:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:52:24,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:52:24,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:52:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:52:24,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052691843] [2021-06-10 23:52:24,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:52:24,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:52:24,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48460790] [2021-06-10 23:52:24,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:52:24,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:52:24,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:52:24,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:52:24,355 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 265 [2021-06-10 23:52:24,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 133 transitions, 4751 flow. Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:24,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:52:24,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 265 [2021-06-10 23:52:24,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:52:24,389 INFO L129 PetriNetUnfolder]: 0/132 cut-off events. [2021-06-10 23:52:24,389 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:24,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 132 events. 0/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 127 event pairs, 0 based on Foata normal form. 66/198 useless extension candidates. Maximal degree in co-relation 0. Up to 66 conditions per place. [2021-06-10 23:52:24,390 INFO L132 encePairwiseOnDemand]: 263/265 looper letters, 0 selfloop transitions, 1 changer transitions 0/132 dead transitions. [2021-06-10 23:52:24,390 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 132 transitions, 4751 flow [2021-06-10 23:52:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:52:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:52:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2021-06-10 23:52:24,391 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9911949685534591 [2021-06-10 23:52:24,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 788 transitions. [2021-06-10 23:52:24,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 788 transitions. [2021-06-10 23:52:24,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:52:24,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 788 transitions. [2021-06-10 23:52:24,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:24,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:24,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:24,392 INFO L185 Difference]: Start difference. First operand has 264 places, 133 transitions, 4751 flow. Second operand 3 states and 788 transitions. [2021-06-10 23:52:24,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 132 transitions, 4751 flow [2021-06-10 23:52:24,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 132 transitions, 591 flow, removed 2080 selfloop flow, removed 0 redundant places. [2021-06-10 23:52:24,499 INFO L241 Difference]: Finished difference. Result has 265 places, 132 transitions, 591 flow [2021-06-10 23:52:24,499 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=265, PETRI_TRANSITIONS=132} [2021-06-10 23:52:24,499 INFO L343 CegarLoopForPetriNet]: 264 programPoint places, 1 predicate places. [2021-06-10 23:52:24,499 INFO L480 AbstractCegarLoop]: Abstraction has has 265 places, 132 transitions, 591 flow [2021-06-10 23:52:24,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:24,500 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:24,500 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:52:24,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-06-10 23:52:24,500 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:24,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:24,500 INFO L82 PathProgramCache]: Analyzing trace with hash 19023529, now seen corresponding path program 1 times [2021-06-10 23:52:24,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:24,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682274935] [2021-06-10 23:52:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:24,511 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:24,513 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:24,522 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:52:24,522 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:52:24,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-06-10 23:52:24,522 WARN L342 ceAbstractionStarter]: 65 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:52:24,522 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 66 thread instances. [2021-06-10 23:52:24,575 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:52:24,576 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:52:24,576 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:52:24,576 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:52:24,576 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:52:24,576 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:52:24,576 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:52:24,576 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:52:24,576 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:52:24,576 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:52:24,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 336 places, 203 transitions, 5026 flow [2021-06-10 23:52:24,642 INFO L129 PetriNetUnfolder]: 0/401 cut-off events. [2021-06-10 23:52:24,642 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:24,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2811 conditions, 401 events. 0/401 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1541 event pairs, 0 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 0. Up to 67 conditions per place. [2021-06-10 23:52:24,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 336 places, 203 transitions, 5026 flow [2021-06-10 23:52:24,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 334 places, 201 transitions, 5022 flow [2021-06-10 23:52:24,645 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:52:24,645 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 334 places, 201 transitions, 5022 flow [2021-06-10 23:52:24,645 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 201 transitions, 5022 flow [2021-06-10 23:52:24,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 334 places, 201 transitions, 5022 flow [2021-06-10 23:52:24,697 INFO L129 PetriNetUnfolder]: 0/267 cut-off events. [2021-06-10 23:52:24,697 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:24,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 267 events. 0/267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 846 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 0. Up to 67 conditions per place. [2021-06-10 23:52:24,717 INFO L151 LiptonReduction]: Number of co-enabled transitions 26268 [2021-06-10 23:52:31,651 INFO L163 LiptonReduction]: Checked pairs total: 10857 [2021-06-10 23:52:31,652 INFO L165 LiptonReduction]: Total number of compositions: 66 [2021-06-10 23:52:31,652 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7007 [2021-06-10 23:52:31,652 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:52:31,652 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:31,652 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:31,653 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:52:31,653 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:31,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash 292515, now seen corresponding path program 1 times [2021-06-10 23:52:31,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:31,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544759342] [2021-06-10 23:52:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:52:31,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:52:31,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:52:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:52:31,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544759342] [2021-06-10 23:52:31,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:52:31,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:52:31,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664275815] [2021-06-10 23:52:31,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:52:31,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:52:31,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:52:31,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:52:31,669 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 269 [2021-06-10 23:52:31,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 135 transitions, 4890 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:31,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:52:31,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 269 [2021-06-10 23:52:31,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:52:31,703 INFO L129 PetriNetUnfolder]: 0/134 cut-off events. [2021-06-10 23:52:31,704 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:31,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2546 conditions, 134 events. 0/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 146 event pairs, 0 based on Foata normal form. 67/201 useless extension candidates. Maximal degree in co-relation 0. Up to 67 conditions per place. [2021-06-10 23:52:31,704 INFO L132 encePairwiseOnDemand]: 267/269 looper letters, 0 selfloop transitions, 1 changer transitions 0/134 dead transitions. [2021-06-10 23:52:31,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 134 transitions, 4890 flow [2021-06-10 23:52:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:52:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:52:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2021-06-10 23:52:31,705 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9913258983890955 [2021-06-10 23:52:31,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 800 transitions. [2021-06-10 23:52:31,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 800 transitions. [2021-06-10 23:52:31,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:52:31,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 800 transitions. [2021-06-10 23:52:31,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:31,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:31,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:31,706 INFO L185 Difference]: Start difference. First operand has 268 places, 135 transitions, 4890 flow. Second operand 3 states and 800 transitions. [2021-06-10 23:52:31,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 134 transitions, 4890 flow [2021-06-10 23:52:31,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 134 transitions, 600 flow, removed 2145 selfloop flow, removed 0 redundant places. [2021-06-10 23:52:31,813 INFO L241 Difference]: Finished difference. Result has 269 places, 134 transitions, 600 flow [2021-06-10 23:52:31,813 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=269, PETRI_TRANSITIONS=134} [2021-06-10 23:52:31,813 INFO L343 CegarLoopForPetriNet]: 268 programPoint places, 1 predicate places. [2021-06-10 23:52:31,813 INFO L480 AbstractCegarLoop]: Abstraction has has 269 places, 134 transitions, 600 flow [2021-06-10 23:52:31,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:31,813 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:31,814 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:52:31,814 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-06-10 23:52:31,814 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:31,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:31,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1713949771, now seen corresponding path program 1 times [2021-06-10 23:52:31,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:31,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785810834] [2021-06-10 23:52:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:31,825 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:31,827 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:31,836 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:52:31,836 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:52:31,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-06-10 23:52:31,836 WARN L342 ceAbstractionStarter]: 66 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:52:31,836 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 67 thread instances. [2021-06-10 23:52:31,890 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:52:31,890 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:52:31,891 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:52:31,891 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:52:31,891 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:52:31,891 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:52:31,891 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:52:31,891 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:52:31,891 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:52:31,891 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:52:31,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 341 places, 206 transitions, 5169 flow [2021-06-10 23:52:31,957 INFO L129 PetriNetUnfolder]: 0/407 cut-off events. [2021-06-10 23:52:31,957 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:31,957 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2887 conditions, 407 events. 0/407 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1498 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 0. Up to 68 conditions per place. [2021-06-10 23:52:31,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 206 transitions, 5169 flow [2021-06-10 23:52:31,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 339 places, 204 transitions, 5165 flow [2021-06-10 23:52:31,959 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:52:31,959 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 204 transitions, 5165 flow [2021-06-10 23:52:31,960 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 339 places, 204 transitions, 5165 flow [2021-06-10 23:52:31,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 339 places, 204 transitions, 5165 flow [2021-06-10 23:52:32,013 INFO L129 PetriNetUnfolder]: 0/271 cut-off events. [2021-06-10 23:52:32,013 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:32,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2751 conditions, 271 events. 0/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 848 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 0. Up to 68 conditions per place. [2021-06-10 23:52:32,033 INFO L151 LiptonReduction]: Number of co-enabled transitions 27068 [2021-06-10 23:52:39,057 INFO L163 LiptonReduction]: Checked pairs total: 11189 [2021-06-10 23:52:39,057 INFO L165 LiptonReduction]: Total number of compositions: 67 [2021-06-10 23:52:39,057 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7098 [2021-06-10 23:52:39,058 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:52:39,058 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:39,058 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:39,058 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:52:39,058 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:39,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:39,059 INFO L82 PathProgramCache]: Analyzing trace with hash 301219, now seen corresponding path program 1 times [2021-06-10 23:52:39,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:39,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023342462] [2021-06-10 23:52:39,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:52:39,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:52:39,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:52:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:52:39,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023342462] [2021-06-10 23:52:39,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:52:39,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:52:39,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226290553] [2021-06-10 23:52:39,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:52:39,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:52:39,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:52:39,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:52:39,074 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 273 [2021-06-10 23:52:39,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 137 transitions, 5031 flow. Second operand has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:39,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:52:39,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 273 [2021-06-10 23:52:39,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:52:39,111 INFO L129 PetriNetUnfolder]: 0/136 cut-off events. [2021-06-10 23:52:39,112 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:39,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 136 events. 0/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 131 event pairs, 0 based on Foata normal form. 68/204 useless extension candidates. Maximal degree in co-relation 0. Up to 68 conditions per place. [2021-06-10 23:52:39,112 INFO L132 encePairwiseOnDemand]: 271/273 looper letters, 0 selfloop transitions, 1 changer transitions 0/136 dead transitions. [2021-06-10 23:52:39,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 136 transitions, 5031 flow [2021-06-10 23:52:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:52:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:52:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2021-06-10 23:52:39,113 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9914529914529915 [2021-06-10 23:52:39,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2021-06-10 23:52:39,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2021-06-10 23:52:39,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:52:39,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2021-06-10 23:52:39,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:39,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:39,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:39,114 INFO L185 Difference]: Start difference. First operand has 272 places, 137 transitions, 5031 flow. Second operand 3 states and 812 transitions. [2021-06-10 23:52:39,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 136 transitions, 5031 flow [2021-06-10 23:52:39,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 136 transitions, 609 flow, removed 2211 selfloop flow, removed 0 redundant places. [2021-06-10 23:52:39,223 INFO L241 Difference]: Finished difference. Result has 273 places, 136 transitions, 609 flow [2021-06-10 23:52:39,223 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=273, PETRI_TRANSITIONS=136} [2021-06-10 23:52:39,223 INFO L343 CegarLoopForPetriNet]: 272 programPoint places, 1 predicate places. [2021-06-10 23:52:39,223 INFO L480 AbstractCegarLoop]: Abstraction has has 273 places, 136 transitions, 609 flow [2021-06-10 23:52:39,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:39,223 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:39,223 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:52:39,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-06-10 23:52:39,223 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:39,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1351835364, now seen corresponding path program 1 times [2021-06-10 23:52:39,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:39,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982250391] [2021-06-10 23:52:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:39,235 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:39,237 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:39,246 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:52:39,246 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:52:39,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-06-10 23:52:39,246 WARN L342 ceAbstractionStarter]: 67 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:52:39,246 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 68 thread instances. [2021-06-10 23:52:39,303 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:52:39,304 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:52:39,304 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:52:39,304 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:52:39,304 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:52:39,304 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:52:39,304 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:52:39,304 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:52:39,304 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:52:39,304 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:52:39,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 346 places, 209 transitions, 5314 flow [2021-06-10 23:52:39,373 INFO L129 PetriNetUnfolder]: 0/413 cut-off events. [2021-06-10 23:52:39,373 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:39,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 413 events. 0/413 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1504 event pairs, 0 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 0. Up to 69 conditions per place. [2021-06-10 23:52:39,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 346 places, 209 transitions, 5314 flow [2021-06-10 23:52:39,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 344 places, 207 transitions, 5310 flow [2021-06-10 23:52:39,375 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:52:39,375 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 344 places, 207 transitions, 5310 flow [2021-06-10 23:52:39,375 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 344 places, 207 transitions, 5310 flow [2021-06-10 23:52:39,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 344 places, 207 transitions, 5310 flow [2021-06-10 23:52:39,430 INFO L129 PetriNetUnfolder]: 0/275 cut-off events. [2021-06-10 23:52:39,431 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:39,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2826 conditions, 275 events. 0/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 868 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 0. Up to 69 conditions per place. [2021-06-10 23:52:39,452 INFO L151 LiptonReduction]: Number of co-enabled transitions 27880 [2021-06-10 23:52:46,841 INFO L163 LiptonReduction]: Checked pairs total: 11526 [2021-06-10 23:52:46,841 INFO L165 LiptonReduction]: Total number of compositions: 68 [2021-06-10 23:52:46,841 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7466 [2021-06-10 23:52:46,842 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:52:46,842 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:46,842 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:46,842 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:52:46,842 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:46,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:46,842 INFO L82 PathProgramCache]: Analyzing trace with hash 310051, now seen corresponding path program 1 times [2021-06-10 23:52:46,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:46,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886002980] [2021-06-10 23:52:46,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:52:46,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:52:46,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:52:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:52:46,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886002980] [2021-06-10 23:52:46,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:52:46,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:52:46,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530404004] [2021-06-10 23:52:46,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:52:46,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:52:46,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:52:46,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:52:46,861 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 277 [2021-06-10 23:52:46,862 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 139 transitions, 5174 flow. Second operand has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:46,862 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:52:46,862 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 277 [2021-06-10 23:52:46,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:52:46,900 INFO L129 PetriNetUnfolder]: 0/138 cut-off events. [2021-06-10 23:52:46,900 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:46,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 138 events. 0/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 172 event pairs, 0 based on Foata normal form. 69/207 useless extension candidates. Maximal degree in co-relation 0. Up to 69 conditions per place. [2021-06-10 23:52:46,900 INFO L132 encePairwiseOnDemand]: 275/277 looper letters, 0 selfloop transitions, 1 changer transitions 0/138 dead transitions. [2021-06-10 23:52:46,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 138 transitions, 5174 flow [2021-06-10 23:52:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:52:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:52:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 824 transitions. [2021-06-10 23:52:46,901 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9915764139590855 [2021-06-10 23:52:46,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 824 transitions. [2021-06-10 23:52:46,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 824 transitions. [2021-06-10 23:52:46,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:52:46,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 824 transitions. [2021-06-10 23:52:46,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:46,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:46,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:46,903 INFO L185 Difference]: Start difference. First operand has 276 places, 139 transitions, 5174 flow. Second operand 3 states and 824 transitions. [2021-06-10 23:52:46,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 138 transitions, 5174 flow [2021-06-10 23:52:47,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 138 transitions, 618 flow, removed 2278 selfloop flow, removed 0 redundant places. [2021-06-10 23:52:47,145 INFO L241 Difference]: Finished difference. Result has 277 places, 138 transitions, 618 flow [2021-06-10 23:52:47,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=277, PETRI_TRANSITIONS=138} [2021-06-10 23:52:47,146 INFO L343 CegarLoopForPetriNet]: 276 programPoint places, 1 predicate places. [2021-06-10 23:52:47,146 INFO L480 AbstractCegarLoop]: Abstraction has has 277 places, 138 transitions, 618 flow [2021-06-10 23:52:47,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 274.6666666666667) internal successors, (824), 3 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:47,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:47,146 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:52:47,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-06-10 23:52:47,146 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1133995506, now seen corresponding path program 1 times [2021-06-10 23:52:47,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:47,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336915405] [2021-06-10 23:52:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:47,163 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:47,164 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:47,174 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:52:47,174 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:52:47,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-06-10 23:52:47,174 WARN L342 ceAbstractionStarter]: 68 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:52:47,175 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 69 thread instances. [2021-06-10 23:52:47,242 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:52:47,242 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:52:47,243 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:52:47,243 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:52:47,243 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:52:47,243 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:52:47,243 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:52:47,243 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:52:47,243 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:52:47,243 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:52:47,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 351 places, 212 transitions, 5461 flow [2021-06-10 23:52:47,315 INFO L129 PetriNetUnfolder]: 0/419 cut-off events. [2021-06-10 23:52:47,316 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:47,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3042 conditions, 419 events. 0/419 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1556 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 0. Up to 70 conditions per place. [2021-06-10 23:52:47,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 351 places, 212 transitions, 5461 flow [2021-06-10 23:52:47,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 349 places, 210 transitions, 5457 flow [2021-06-10 23:52:47,318 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:52:47,318 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 349 places, 210 transitions, 5457 flow [2021-06-10 23:52:47,318 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 349 places, 210 transitions, 5457 flow [2021-06-10 23:52:47,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 349 places, 210 transitions, 5457 flow [2021-06-10 23:52:47,376 INFO L129 PetriNetUnfolder]: 0/279 cut-off events. [2021-06-10 23:52:47,377 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:47,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 279 events. 0/279 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 751 event pairs, 0 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 0. Up to 70 conditions per place. [2021-06-10 23:52:47,399 INFO L151 LiptonReduction]: Number of co-enabled transitions 28704 [2021-06-10 23:52:55,255 INFO L163 LiptonReduction]: Checked pairs total: 11868 [2021-06-10 23:52:55,255 INFO L165 LiptonReduction]: Total number of compositions: 69 [2021-06-10 23:52:55,256 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7938 [2021-06-10 23:52:55,256 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:52:55,256 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:55,256 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:55,256 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:52:55,257 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:55,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:55,257 INFO L82 PathProgramCache]: Analyzing trace with hash 319011, now seen corresponding path program 1 times [2021-06-10 23:52:55,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:55,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277828071] [2021-06-10 23:52:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:52:55,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:52:55,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:52:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:52:55,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277828071] [2021-06-10 23:52:55,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:52:55,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:52:55,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57015452] [2021-06-10 23:52:55,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:52:55,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:52:55,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:52:55,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:52:55,274 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 281 [2021-06-10 23:52:55,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 141 transitions, 5319 flow. Second operand has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:55,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:52:55,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 281 [2021-06-10 23:52:55,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:52:55,314 INFO L129 PetriNetUnfolder]: 0/140 cut-off events. [2021-06-10 23:52:55,314 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:55,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2765 conditions, 140 events. 0/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 157 event pairs, 0 based on Foata normal form. 70/210 useless extension candidates. Maximal degree in co-relation 0. Up to 70 conditions per place. [2021-06-10 23:52:55,314 INFO L132 encePairwiseOnDemand]: 279/281 looper letters, 0 selfloop transitions, 1 changer transitions 0/140 dead transitions. [2021-06-10 23:52:55,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 140 transitions, 5319 flow [2021-06-10 23:52:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:52:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:52:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 836 transitions. [2021-06-10 23:52:55,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9916963226571768 [2021-06-10 23:52:55,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 836 transitions. [2021-06-10 23:52:55,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 836 transitions. [2021-06-10 23:52:55,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:52:55,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 836 transitions. [2021-06-10 23:52:55,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:55,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:55,316 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:55,317 INFO L185 Difference]: Start difference. First operand has 280 places, 141 transitions, 5319 flow. Second operand 3 states and 836 transitions. [2021-06-10 23:52:55,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 140 transitions, 5319 flow [2021-06-10 23:52:55,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 140 transitions, 627 flow, removed 2346 selfloop flow, removed 0 redundant places. [2021-06-10 23:52:55,426 INFO L241 Difference]: Finished difference. Result has 281 places, 140 transitions, 627 flow [2021-06-10 23:52:55,427 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=281, PETRI_TRANSITIONS=140} [2021-06-10 23:52:55,427 INFO L343 CegarLoopForPetriNet]: 280 programPoint places, 1 predicate places. [2021-06-10 23:52:55,427 INFO L480 AbstractCegarLoop]: Abstraction has has 281 places, 140 transitions, 627 flow [2021-06-10 23:52:55,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:52:55,427 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:52:55,427 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:52:55,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-06-10 23:52:55,427 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:52:55,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:52:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1823164207, now seen corresponding path program 1 times [2021-06-10 23:52:55,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:52:55,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71427413] [2021-06-10 23:52:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:52:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:55,440 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:52:55,442 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:52:55,451 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:52:55,452 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:52:55,452 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-06-10 23:52:55,452 WARN L342 ceAbstractionStarter]: 69 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:52:55,452 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 70 thread instances. [2021-06-10 23:52:55,510 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:52:55,510 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:52:55,510 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:52:55,511 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:52:55,511 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:52:55,511 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:52:55,511 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:52:55,511 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:52:55,511 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:52:55,511 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:52:55,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 356 places, 215 transitions, 5610 flow [2021-06-10 23:52:55,586 INFO L129 PetriNetUnfolder]: 0/425 cut-off events. [2021-06-10 23:52:55,586 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:55,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 425 events. 0/425 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1578 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 0. Up to 71 conditions per place. [2021-06-10 23:52:55,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 356 places, 215 transitions, 5610 flow [2021-06-10 23:52:55,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 354 places, 213 transitions, 5606 flow [2021-06-10 23:52:55,588 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:52:55,588 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 354 places, 213 transitions, 5606 flow [2021-06-10 23:52:55,588 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 354 places, 213 transitions, 5606 flow [2021-06-10 23:52:55,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 354 places, 213 transitions, 5606 flow [2021-06-10 23:52:55,648 INFO L129 PetriNetUnfolder]: 0/283 cut-off events. [2021-06-10 23:52:55,648 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:52:55,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 283 events. 0/283 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 795 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 0. Up to 71 conditions per place. [2021-06-10 23:52:55,671 INFO L151 LiptonReduction]: Number of co-enabled transitions 29540 [2021-06-10 23:53:03,900 INFO L163 LiptonReduction]: Checked pairs total: 12215 [2021-06-10 23:53:03,900 INFO L165 LiptonReduction]: Total number of compositions: 70 [2021-06-10 23:53:03,900 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8312 [2021-06-10 23:53:03,901 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:53:03,901 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:03,901 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:03,901 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:53:03,901 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash 328099, now seen corresponding path program 1 times [2021-06-10 23:53:03,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:03,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009099007] [2021-06-10 23:53:03,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:53:03,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:53:03,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:53:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:53:03,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009099007] [2021-06-10 23:53:03,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:53:03,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:53:03,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972425543] [2021-06-10 23:53:03,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:53:03,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:53:03,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:53:03,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:53:03,924 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 285 [2021-06-10 23:53:03,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 143 transitions, 5466 flow. Second operand has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:03,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:53:03,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 285 [2021-06-10 23:53:03,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:53:03,966 INFO L129 PetriNetUnfolder]: 0/142 cut-off events. [2021-06-10 23:53:03,966 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:03,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2840 conditions, 142 events. 0/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 152 event pairs, 0 based on Foata normal form. 71/213 useless extension candidates. Maximal degree in co-relation 0. Up to 71 conditions per place. [2021-06-10 23:53:03,967 INFO L132 encePairwiseOnDemand]: 283/285 looper letters, 0 selfloop transitions, 1 changer transitions 0/142 dead transitions. [2021-06-10 23:53:03,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 142 transitions, 5466 flow [2021-06-10 23:53:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:53:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:53:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2021-06-10 23:53:03,967 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.991812865497076 [2021-06-10 23:53:03,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 848 transitions. [2021-06-10 23:53:03,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 848 transitions. [2021-06-10 23:53:03,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:53:03,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 848 transitions. [2021-06-10 23:53:03,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:03,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:03,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:03,969 INFO L185 Difference]: Start difference. First operand has 284 places, 143 transitions, 5466 flow. Second operand 3 states and 848 transitions. [2021-06-10 23:53:03,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 142 transitions, 5466 flow [2021-06-10 23:53:04,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 142 transitions, 636 flow, removed 2415 selfloop flow, removed 0 redundant places. [2021-06-10 23:53:04,082 INFO L241 Difference]: Finished difference. Result has 285 places, 142 transitions, 636 flow [2021-06-10 23:53:04,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=285, PETRI_TRANSITIONS=142} [2021-06-10 23:53:04,082 INFO L343 CegarLoopForPetriNet]: 284 programPoint places, 1 predicate places. [2021-06-10 23:53:04,082 INFO L480 AbstractCegarLoop]: Abstraction has has 285 places, 142 transitions, 636 flow [2021-06-10 23:53:04,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:04,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:04,082 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:53:04,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-06-10 23:53:04,082 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1518914513, now seen corresponding path program 1 times [2021-06-10 23:53:04,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:04,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735945962] [2021-06-10 23:53:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:04,097 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:04,098 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:04,108 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:53:04,108 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:53:04,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-06-10 23:53:04,108 WARN L342 ceAbstractionStarter]: 70 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:53:04,108 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 71 thread instances. [2021-06-10 23:53:04,171 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:53:04,171 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:53:04,171 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:53:04,171 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:53:04,171 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:53:04,171 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:53:04,171 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:53:04,172 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:53:04,172 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:53:04,172 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:53:04,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 361 places, 218 transitions, 5761 flow [2021-06-10 23:53:04,353 INFO L129 PetriNetUnfolder]: 0/431 cut-off events. [2021-06-10 23:53:04,353 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:04,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3201 conditions, 431 events. 0/431 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1611 event pairs, 0 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 0. Up to 72 conditions per place. [2021-06-10 23:53:04,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 361 places, 218 transitions, 5761 flow [2021-06-10 23:53:04,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 359 places, 216 transitions, 5757 flow [2021-06-10 23:53:04,356 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:53:04,356 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 216 transitions, 5757 flow [2021-06-10 23:53:04,356 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 359 places, 216 transitions, 5757 flow [2021-06-10 23:53:04,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 359 places, 216 transitions, 5757 flow [2021-06-10 23:53:04,418 INFO L129 PetriNetUnfolder]: 0/287 cut-off events. [2021-06-10 23:53:04,418 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:04,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 287 events. 0/287 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 824 event pairs, 0 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 0. Up to 72 conditions per place. [2021-06-10 23:53:04,442 INFO L151 LiptonReduction]: Number of co-enabled transitions 30388 [2021-06-10 23:53:13,170 INFO L163 LiptonReduction]: Checked pairs total: 12567 [2021-06-10 23:53:13,171 INFO L165 LiptonReduction]: Total number of compositions: 71 [2021-06-10 23:53:13,171 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8815 [2021-06-10 23:53:13,171 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:53:13,172 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:13,172 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:13,172 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:53:13,172 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash 337315, now seen corresponding path program 1 times [2021-06-10 23:53:13,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:13,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265926213] [2021-06-10 23:53:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:53:13,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:53:13,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:53:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:53:13,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265926213] [2021-06-10 23:53:13,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:53:13,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:53:13,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833994543] [2021-06-10 23:53:13,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:53:13,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:53:13,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:53:13,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:53:13,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 289 [2021-06-10 23:53:13,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 145 transitions, 5615 flow. Second operand has 3 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:13,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:53:13,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 289 [2021-06-10 23:53:13,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:53:13,233 INFO L129 PetriNetUnfolder]: 0/144 cut-off events. [2021-06-10 23:53:13,234 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:13,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 144 events. 0/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 135 event pairs, 0 based on Foata normal form. 72/216 useless extension candidates. Maximal degree in co-relation 0. Up to 72 conditions per place. [2021-06-10 23:53:13,234 INFO L132 encePairwiseOnDemand]: 287/289 looper letters, 0 selfloop transitions, 1 changer transitions 0/144 dead transitions. [2021-06-10 23:53:13,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 144 transitions, 5615 flow [2021-06-10 23:53:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:53:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:53:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2021-06-10 23:53:13,235 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9919261822376009 [2021-06-10 23:53:13,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 860 transitions. [2021-06-10 23:53:13,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 860 transitions. [2021-06-10 23:53:13,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:53:13,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 860 transitions. [2021-06-10 23:53:13,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:13,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:13,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:13,236 INFO L185 Difference]: Start difference. First operand has 288 places, 145 transitions, 5615 flow. Second operand 3 states and 860 transitions. [2021-06-10 23:53:13,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 144 transitions, 5615 flow [2021-06-10 23:53:13,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 144 transitions, 645 flow, removed 2485 selfloop flow, removed 0 redundant places. [2021-06-10 23:53:13,340 INFO L241 Difference]: Finished difference. Result has 289 places, 144 transitions, 645 flow [2021-06-10 23:53:13,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=289, PETRI_TRANSITIONS=144} [2021-06-10 23:53:13,341 INFO L343 CegarLoopForPetriNet]: 288 programPoint places, 1 predicate places. [2021-06-10 23:53:13,341 INFO L480 AbstractCegarLoop]: Abstraction has has 289 places, 144 transitions, 645 flow [2021-06-10 23:53:13,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:13,341 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:13,341 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:53:13,341 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-06-10 23:53:13,341 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1746041226, now seen corresponding path program 1 times [2021-06-10 23:53:13,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:13,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277484589] [2021-06-10 23:53:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:13,355 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:13,357 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:13,367 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:53:13,367 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:53:13,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-06-10 23:53:13,367 WARN L342 ceAbstractionStarter]: 71 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:53:13,367 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 72 thread instances. [2021-06-10 23:53:13,430 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:53:13,430 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:53:13,431 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:53:13,431 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:53:13,431 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:53:13,431 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:53:13,431 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:53:13,431 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:53:13,431 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:53:13,431 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:53:13,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 366 places, 221 transitions, 5914 flow [2021-06-10 23:53:13,512 INFO L129 PetriNetUnfolder]: 0/437 cut-off events. [2021-06-10 23:53:13,512 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:13,512 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3282 conditions, 437 events. 0/437 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1586 event pairs, 0 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 0. Up to 73 conditions per place. [2021-06-10 23:53:13,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 366 places, 221 transitions, 5914 flow [2021-06-10 23:53:13,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 364 places, 219 transitions, 5910 flow [2021-06-10 23:53:13,515 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:53:13,515 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 364 places, 219 transitions, 5910 flow [2021-06-10 23:53:13,515 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 364 places, 219 transitions, 5910 flow [2021-06-10 23:53:13,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 364 places, 219 transitions, 5910 flow [2021-06-10 23:53:13,580 INFO L129 PetriNetUnfolder]: 0/291 cut-off events. [2021-06-10 23:53:13,581 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:13,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 291 events. 0/291 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 904 event pairs, 0 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 0. Up to 73 conditions per place. [2021-06-10 23:53:13,606 INFO L151 LiptonReduction]: Number of co-enabled transitions 31248 [2021-06-10 23:53:23,052 INFO L163 LiptonReduction]: Checked pairs total: 12924 [2021-06-10 23:53:23,052 INFO L165 LiptonReduction]: Total number of compositions: 72 [2021-06-10 23:53:23,053 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9538 [2021-06-10 23:53:23,053 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:53:23,053 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:23,053 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:23,053 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:53:23,053 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:23,054 INFO L82 PathProgramCache]: Analyzing trace with hash 346659, now seen corresponding path program 1 times [2021-06-10 23:53:23,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:23,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444436647] [2021-06-10 23:53:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:53:23,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:53:23,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:53:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:53:23,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444436647] [2021-06-10 23:53:23,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:53:23,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:53:23,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941228231] [2021-06-10 23:53:23,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:53:23,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:53:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:53:23,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:53:23,073 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 293 [2021-06-10 23:53:23,074 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 147 transitions, 5766 flow. Second operand has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:23,074 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:53:23,074 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 293 [2021-06-10 23:53:23,074 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:53:23,118 INFO L129 PetriNetUnfolder]: 0/146 cut-off events. [2021-06-10 23:53:23,118 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:23,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 146 events. 0/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 170 event pairs, 0 based on Foata normal form. 73/219 useless extension candidates. Maximal degree in co-relation 0. Up to 73 conditions per place. [2021-06-10 23:53:23,118 INFO L132 encePairwiseOnDemand]: 291/293 looper letters, 0 selfloop transitions, 1 changer transitions 0/146 dead transitions. [2021-06-10 23:53:23,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 146 transitions, 5766 flow [2021-06-10 23:53:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:53:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:53:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2021-06-10 23:53:23,119 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9920364050056882 [2021-06-10 23:53:23,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 872 transitions. [2021-06-10 23:53:23,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 872 transitions. [2021-06-10 23:53:23,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:53:23,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 872 transitions. [2021-06-10 23:53:23,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:23,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:23,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:23,121 INFO L185 Difference]: Start difference. First operand has 292 places, 147 transitions, 5766 flow. Second operand 3 states and 872 transitions. [2021-06-10 23:53:23,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 146 transitions, 5766 flow [2021-06-10 23:53:23,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 146 transitions, 654 flow, removed 2556 selfloop flow, removed 0 redundant places. [2021-06-10 23:53:23,230 INFO L241 Difference]: Finished difference. Result has 293 places, 146 transitions, 654 flow [2021-06-10 23:53:23,230 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=293, PETRI_TRANSITIONS=146} [2021-06-10 23:53:23,230 INFO L343 CegarLoopForPetriNet]: 292 programPoint places, 1 predicate places. [2021-06-10 23:53:23,230 INFO L480 AbstractCegarLoop]: Abstraction has has 293 places, 146 transitions, 654 flow [2021-06-10 23:53:23,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:23,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:23,230 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:53:23,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-06-10 23:53:23,230 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:23,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:23,230 INFO L82 PathProgramCache]: Analyzing trace with hash 748644244, now seen corresponding path program 1 times [2021-06-10 23:53:23,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:23,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229697796] [2021-06-10 23:53:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:23,244 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:23,245 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:23,256 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:53:23,256 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:53:23,256 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-06-10 23:53:23,256 WARN L342 ceAbstractionStarter]: 72 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:53:23,256 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 73 thread instances. [2021-06-10 23:53:23,319 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:53:23,319 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:53:23,319 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:53:23,319 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:53:23,319 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:53:23,319 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:53:23,319 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:53:23,319 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:53:23,320 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:53:23,320 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:53:23,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 371 places, 224 transitions, 6069 flow [2021-06-10 23:53:23,403 INFO L129 PetriNetUnfolder]: 0/443 cut-off events. [2021-06-10 23:53:23,403 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:23,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3364 conditions, 443 events. 0/443 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1668 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 0. Up to 74 conditions per place. [2021-06-10 23:53:23,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 371 places, 224 transitions, 6069 flow [2021-06-10 23:53:23,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 369 places, 222 transitions, 6065 flow [2021-06-10 23:53:23,405 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:53:23,405 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 369 places, 222 transitions, 6065 flow [2021-06-10 23:53:23,406 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 369 places, 222 transitions, 6065 flow [2021-06-10 23:53:23,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 369 places, 222 transitions, 6065 flow [2021-06-10 23:53:23,473 INFO L129 PetriNetUnfolder]: 0/295 cut-off events. [2021-06-10 23:53:23,473 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:23,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3216 conditions, 295 events. 0/295 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 787 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 0. Up to 74 conditions per place. [2021-06-10 23:53:23,498 INFO L151 LiptonReduction]: Number of co-enabled transitions 32120 [2021-06-10 23:53:33,332 INFO L163 LiptonReduction]: Checked pairs total: 13286 [2021-06-10 23:53:33,333 INFO L165 LiptonReduction]: Total number of compositions: 73 [2021-06-10 23:53:33,333 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9928 [2021-06-10 23:53:33,334 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:53:33,334 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:33,334 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:33,334 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:53:33,334 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:33,334 INFO L82 PathProgramCache]: Analyzing trace with hash 356131, now seen corresponding path program 1 times [2021-06-10 23:53:33,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:33,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616980879] [2021-06-10 23:53:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:53:33,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:53:33,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:53:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:53:33,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616980879] [2021-06-10 23:53:33,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:53:33,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:53:33,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407883012] [2021-06-10 23:53:33,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:53:33,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:53:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:53:33,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:53:33,358 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 297 [2021-06-10 23:53:33,358 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 149 transitions, 5919 flow. Second operand has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:33,358 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:53:33,358 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 297 [2021-06-10 23:53:33,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:53:33,405 INFO L129 PetriNetUnfolder]: 0/148 cut-off events. [2021-06-10 23:53:33,405 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:33,406 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3071 conditions, 148 events. 0/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 141 event pairs, 0 based on Foata normal form. 74/222 useless extension candidates. Maximal degree in co-relation 0. Up to 74 conditions per place. [2021-06-10 23:53:33,406 INFO L132 encePairwiseOnDemand]: 295/297 looper letters, 0 selfloop transitions, 1 changer transitions 0/148 dead transitions. [2021-06-10 23:53:33,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 148 transitions, 5919 flow [2021-06-10 23:53:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:53:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:53:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2021-06-10 23:53:33,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9921436588103255 [2021-06-10 23:53:33,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 884 transitions. [2021-06-10 23:53:33,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 884 transitions. [2021-06-10 23:53:33,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:53:33,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 884 transitions. [2021-06-10 23:53:33,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:33,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:33,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:33,408 INFO L185 Difference]: Start difference. First operand has 296 places, 149 transitions, 5919 flow. Second operand 3 states and 884 transitions. [2021-06-10 23:53:33,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 148 transitions, 5919 flow [2021-06-10 23:53:33,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 148 transitions, 663 flow, removed 2628 selfloop flow, removed 0 redundant places. [2021-06-10 23:53:33,524 INFO L241 Difference]: Finished difference. Result has 297 places, 148 transitions, 663 flow [2021-06-10 23:53:33,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=663, PETRI_PLACES=297, PETRI_TRANSITIONS=148} [2021-06-10 23:53:33,524 INFO L343 CegarLoopForPetriNet]: 296 programPoint places, 1 predicate places. [2021-06-10 23:53:33,524 INFO L480 AbstractCegarLoop]: Abstraction has has 297 places, 148 transitions, 663 flow [2021-06-10 23:53:33,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:33,524 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:33,524 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:53:33,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-06-10 23:53:33,524 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:33,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:33,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1012633611, now seen corresponding path program 1 times [2021-06-10 23:53:33,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:33,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109147755] [2021-06-10 23:53:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:33,540 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:33,542 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:33,553 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:53:33,553 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:53:33,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-06-10 23:53:33,553 WARN L342 ceAbstractionStarter]: 73 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:53:33,554 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 74 thread instances. [2021-06-10 23:53:33,630 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:53:33,630 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:53:33,630 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:53:33,630 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:53:33,630 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:53:33,631 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:53:33,631 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:53:33,631 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:53:33,631 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:53:33,631 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:53:33,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 376 places, 227 transitions, 6226 flow [2021-06-10 23:53:33,716 INFO L129 PetriNetUnfolder]: 0/449 cut-off events. [2021-06-10 23:53:33,716 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:33,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3447 conditions, 449 events. 0/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1667 event pairs, 0 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 0. Up to 75 conditions per place. [2021-06-10 23:53:33,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 376 places, 227 transitions, 6226 flow [2021-06-10 23:53:33,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 374 places, 225 transitions, 6222 flow [2021-06-10 23:53:33,719 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:53:33,719 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 374 places, 225 transitions, 6222 flow [2021-06-10 23:53:33,719 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 374 places, 225 transitions, 6222 flow [2021-06-10 23:53:33,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 374 places, 225 transitions, 6222 flow [2021-06-10 23:53:33,788 INFO L129 PetriNetUnfolder]: 0/299 cut-off events. [2021-06-10 23:53:33,788 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:33,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 299 events. 0/299 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 795 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 0. Up to 75 conditions per place. [2021-06-10 23:53:33,815 INFO L151 LiptonReduction]: Number of co-enabled transitions 33004 [2021-06-10 23:53:44,397 INFO L163 LiptonReduction]: Checked pairs total: 13653 [2021-06-10 23:53:44,397 INFO L165 LiptonReduction]: Total number of compositions: 74 [2021-06-10 23:53:44,398 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10679 [2021-06-10 23:53:44,398 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:53:44,398 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:44,398 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:44,398 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:53:44,399 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:44,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash 365731, now seen corresponding path program 1 times [2021-06-10 23:53:44,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:44,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333474236] [2021-06-10 23:53:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:53:44,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:53:44,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:53:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:53:44,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333474236] [2021-06-10 23:53:44,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:53:44,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:53:44,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122353543] [2021-06-10 23:53:44,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:53:44,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:53:44,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:53:44,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:53:44,418 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 301 [2021-06-10 23:53:44,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 151 transitions, 6074 flow. Second operand has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:44,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:53:44,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 301 [2021-06-10 23:53:44,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:53:44,465 INFO L129 PetriNetUnfolder]: 0/150 cut-off events. [2021-06-10 23:53:44,465 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:44,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3150 conditions, 150 events. 0/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 170 event pairs, 0 based on Foata normal form. 75/225 useless extension candidates. Maximal degree in co-relation 0. Up to 75 conditions per place. [2021-06-10 23:53:44,466 INFO L132 encePairwiseOnDemand]: 299/301 looper letters, 0 selfloop transitions, 1 changer transitions 0/150 dead transitions. [2021-06-10 23:53:44,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 150 transitions, 6074 flow [2021-06-10 23:53:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:53:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:53:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 896 transitions. [2021-06-10 23:53:44,466 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9922480620155039 [2021-06-10 23:53:44,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 896 transitions. [2021-06-10 23:53:44,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 896 transitions. [2021-06-10 23:53:44,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:53:44,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 896 transitions. [2021-06-10 23:53:44,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:44,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:44,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:44,468 INFO L185 Difference]: Start difference. First operand has 300 places, 151 transitions, 6074 flow. Second operand 3 states and 896 transitions. [2021-06-10 23:53:44,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 150 transitions, 6074 flow [2021-06-10 23:53:44,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 150 transitions, 672 flow, removed 2701 selfloop flow, removed 0 redundant places. [2021-06-10 23:53:44,582 INFO L241 Difference]: Finished difference. Result has 301 places, 150 transitions, 672 flow [2021-06-10 23:53:44,582 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=672, PETRI_PLACES=301, PETRI_TRANSITIONS=150} [2021-06-10 23:53:44,582 INFO L343 CegarLoopForPetriNet]: 300 programPoint places, 1 predicate places. [2021-06-10 23:53:44,582 INFO L480 AbstractCegarLoop]: Abstraction has has 301 places, 150 transitions, 672 flow [2021-06-10 23:53:44,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:44,582 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:44,582 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:53:44,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-06-10 23:53:44,582 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:44,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:44,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1976601769, now seen corresponding path program 1 times [2021-06-10 23:53:44,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:44,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348492269] [2021-06-10 23:53:44,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:44,597 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:44,598 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:44,609 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:53:44,609 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:53:44,609 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-06-10 23:53:44,609 WARN L342 ceAbstractionStarter]: 74 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:53:44,609 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 75 thread instances. [2021-06-10 23:53:44,677 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:53:44,677 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:53:44,677 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:53:44,677 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:53:44,677 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:53:44,677 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:53:44,677 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:53:44,678 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:53:44,678 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:53:44,678 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:53:44,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 381 places, 230 transitions, 6385 flow [2021-06-10 23:53:44,765 INFO L129 PetriNetUnfolder]: 0/455 cut-off events. [2021-06-10 23:53:44,765 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:44,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3531 conditions, 455 events. 0/455 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1673 event pairs, 0 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 0. Up to 76 conditions per place. [2021-06-10 23:53:44,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 381 places, 230 transitions, 6385 flow [2021-06-10 23:53:44,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 379 places, 228 transitions, 6381 flow [2021-06-10 23:53:44,768 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:53:44,768 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 379 places, 228 transitions, 6381 flow [2021-06-10 23:53:44,768 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 379 places, 228 transitions, 6381 flow [2021-06-10 23:53:44,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 379 places, 228 transitions, 6381 flow [2021-06-10 23:53:44,839 INFO L129 PetriNetUnfolder]: 0/303 cut-off events. [2021-06-10 23:53:44,839 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:44,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3379 conditions, 303 events. 0/303 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 950 event pairs, 0 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 0. Up to 76 conditions per place. [2021-06-10 23:53:44,867 INFO L151 LiptonReduction]: Number of co-enabled transitions 33900 [2021-06-10 23:53:56,280 INFO L163 LiptonReduction]: Checked pairs total: 14025 [2021-06-10 23:53:56,280 INFO L165 LiptonReduction]: Total number of compositions: 75 [2021-06-10 23:53:56,280 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11512 [2021-06-10 23:53:56,281 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:53:56,281 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:56,281 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:56,281 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:53:56,281 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:56,282 INFO L82 PathProgramCache]: Analyzing trace with hash 375459, now seen corresponding path program 1 times [2021-06-10 23:53:56,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:56,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38916835] [2021-06-10 23:53:56,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:53:56,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:53:56,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:53:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:53:56,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38916835] [2021-06-10 23:53:56,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:53:56,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:53:56,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709384241] [2021-06-10 23:53:56,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:53:56,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:53:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:53:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:53:56,302 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 305 [2021-06-10 23:53:56,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 153 transitions, 6231 flow. Second operand has 3 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:56,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:53:56,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 305 [2021-06-10 23:53:56,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:53:56,351 INFO L129 PetriNetUnfolder]: 0/152 cut-off events. [2021-06-10 23:53:56,351 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:56,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3230 conditions, 152 events. 0/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 147 event pairs, 0 based on Foata normal form. 76/228 useless extension candidates. Maximal degree in co-relation 0. Up to 76 conditions per place. [2021-06-10 23:53:56,352 INFO L132 encePairwiseOnDemand]: 303/305 looper letters, 0 selfloop transitions, 1 changer transitions 0/152 dead transitions. [2021-06-10 23:53:56,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 152 transitions, 6231 flow [2021-06-10 23:53:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:53:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:53:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2021-06-10 23:53:56,352 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9923497267759562 [2021-06-10 23:53:56,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 908 transitions. [2021-06-10 23:53:56,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 908 transitions. [2021-06-10 23:53:56,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:53:56,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 908 transitions. [2021-06-10 23:53:56,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:56,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:56,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:56,354 INFO L185 Difference]: Start difference. First operand has 304 places, 153 transitions, 6231 flow. Second operand 3 states and 908 transitions. [2021-06-10 23:53:56,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 152 transitions, 6231 flow [2021-06-10 23:53:56,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 152 transitions, 681 flow, removed 2775 selfloop flow, removed 0 redundant places. [2021-06-10 23:53:56,469 INFO L241 Difference]: Finished difference. Result has 305 places, 152 transitions, 681 flow [2021-06-10 23:53:56,469 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=305, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=681, PETRI_PLACES=305, PETRI_TRANSITIONS=152} [2021-06-10 23:53:56,469 INFO L343 CegarLoopForPetriNet]: 304 programPoint places, 1 predicate places. [2021-06-10 23:53:56,470 INFO L480 AbstractCegarLoop]: Abstraction has has 305 places, 152 transitions, 681 flow [2021-06-10 23:53:56,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:53:56,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:53:56,470 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:53:56,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-06-10 23:53:56,470 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:53:56,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:53:56,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1188060048, now seen corresponding path program 1 times [2021-06-10 23:53:56,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:53:56,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76182440] [2021-06-10 23:53:56,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:53:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:56,485 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:53:56,486 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:53:56,497 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:53:56,497 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:53:56,497 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-06-10 23:53:56,497 WARN L342 ceAbstractionStarter]: 75 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:53:56,498 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 76 thread instances. [2021-06-10 23:53:56,569 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:53:56,570 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:53:56,570 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:53:56,570 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:53:56,570 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:53:56,570 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:53:56,570 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:53:56,570 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:53:56,570 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:53:56,570 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:53:56,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 386 places, 233 transitions, 6546 flow [2021-06-10 23:53:56,662 INFO L129 PetriNetUnfolder]: 0/461 cut-off events. [2021-06-10 23:53:56,663 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:56,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3616 conditions, 461 events. 0/461 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1670 event pairs, 0 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 0. Up to 77 conditions per place. [2021-06-10 23:53:56,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 386 places, 233 transitions, 6546 flow [2021-06-10 23:53:56,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 384 places, 231 transitions, 6542 flow [2021-06-10 23:53:56,665 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:53:56,665 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 384 places, 231 transitions, 6542 flow [2021-06-10 23:53:56,666 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 384 places, 231 transitions, 6542 flow [2021-06-10 23:53:56,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 384 places, 231 transitions, 6542 flow [2021-06-10 23:53:56,740 INFO L129 PetriNetUnfolder]: 0/307 cut-off events. [2021-06-10 23:53:56,740 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:53:56,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3462 conditions, 307 events. 0/307 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 992 event pairs, 0 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 0. Up to 77 conditions per place. [2021-06-10 23:53:56,769 INFO L151 LiptonReduction]: Number of co-enabled transitions 34808 [2021-06-10 23:54:08,818 INFO L163 LiptonReduction]: Checked pairs total: 14402 [2021-06-10 23:54:08,819 INFO L165 LiptonReduction]: Total number of compositions: 76 [2021-06-10 23:54:08,819 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12154 [2021-06-10 23:54:08,820 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:54:08,820 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:08,820 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:54:08,820 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:54:08,820 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:54:08,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:54:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash 385315, now seen corresponding path program 1 times [2021-06-10 23:54:08,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:54:08,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4153748] [2021-06-10 23:54:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:54:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:54:08,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:54:08,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:54:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:54:08,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4153748] [2021-06-10 23:54:08,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:54:08,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:54:08,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863373900] [2021-06-10 23:54:08,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:54:08,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:54:08,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:54:08,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:54:08,846 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 309 [2021-06-10 23:54:08,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 155 transitions, 6390 flow. Second operand has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:08,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:54:08,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 309 [2021-06-10 23:54:08,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:54:08,896 INFO L129 PetriNetUnfolder]: 0/154 cut-off events. [2021-06-10 23:54:08,897 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:08,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3311 conditions, 154 events. 0/154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 124 event pairs, 0 based on Foata normal form. 77/231 useless extension candidates. Maximal degree in co-relation 0. Up to 77 conditions per place. [2021-06-10 23:54:08,897 INFO L132 encePairwiseOnDemand]: 307/309 looper letters, 0 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2021-06-10 23:54:08,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 154 transitions, 6390 flow [2021-06-10 23:54:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:54:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:54:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2021-06-10 23:54:08,898 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9924487594390508 [2021-06-10 23:54:08,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 920 transitions. [2021-06-10 23:54:08,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 920 transitions. [2021-06-10 23:54:08,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:54:08,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 920 transitions. [2021-06-10 23:54:08,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:08,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 309.0) internal successors, (1236), 4 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:08,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 309.0) internal successors, (1236), 4 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:08,899 INFO L185 Difference]: Start difference. First operand has 308 places, 155 transitions, 6390 flow. Second operand 3 states and 920 transitions. [2021-06-10 23:54:08,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 154 transitions, 6390 flow [2021-06-10 23:54:09,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 154 transitions, 690 flow, removed 2850 selfloop flow, removed 0 redundant places. [2021-06-10 23:54:09,020 INFO L241 Difference]: Finished difference. Result has 309 places, 154 transitions, 690 flow [2021-06-10 23:54:09,020 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=309, PETRI_TRANSITIONS=154} [2021-06-10 23:54:09,020 INFO L343 CegarLoopForPetriNet]: 308 programPoint places, 1 predicate places. [2021-06-10 23:54:09,020 INFO L480 AbstractCegarLoop]: Abstraction has has 309 places, 154 transitions, 690 flow [2021-06-10 23:54:09,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:09,020 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:54:09,020 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:54:09,020 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-06-10 23:54:09,020 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:54:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:54:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash 795407642, now seen corresponding path program 1 times [2021-06-10 23:54:09,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:54:09,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461993135] [2021-06-10 23:54:09,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:54:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:54:09,035 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:54:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:54:09,037 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:54:09,047 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:54:09,048 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:54:09,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-06-10 23:54:09,048 WARN L342 ceAbstractionStarter]: 76 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:54:09,048 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 77 thread instances. [2021-06-10 23:54:09,123 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:54:09,124 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:54:09,124 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:54:09,124 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:54:09,124 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:54:09,124 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:54:09,124 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:54:09,124 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:54:09,124 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:54:09,124 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:54:09,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 391 places, 236 transitions, 6709 flow [2021-06-10 23:54:09,217 INFO L129 PetriNetUnfolder]: 0/467 cut-off events. [2021-06-10 23:54:09,217 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:09,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3702 conditions, 467 events. 0/467 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1773 event pairs, 0 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 0. Up to 78 conditions per place. [2021-06-10 23:54:09,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 391 places, 236 transitions, 6709 flow [2021-06-10 23:54:09,219 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 389 places, 234 transitions, 6705 flow [2021-06-10 23:54:09,219 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:54:09,220 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 389 places, 234 transitions, 6705 flow [2021-06-10 23:54:09,220 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 389 places, 234 transitions, 6705 flow [2021-06-10 23:54:09,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 389 places, 234 transitions, 6705 flow [2021-06-10 23:54:09,396 INFO L129 PetriNetUnfolder]: 0/311 cut-off events. [2021-06-10 23:54:09,396 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:09,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3546 conditions, 311 events. 0/311 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 961 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 0. Up to 78 conditions per place. [2021-06-10 23:54:09,426 INFO L151 LiptonReduction]: Number of co-enabled transitions 35728 [2021-06-10 23:54:22,454 INFO L163 LiptonReduction]: Checked pairs total: 14784 [2021-06-10 23:54:22,454 INFO L165 LiptonReduction]: Total number of compositions: 77 [2021-06-10 23:54:22,454 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13235 [2021-06-10 23:54:22,455 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:54:22,455 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:22,455 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:54:22,455 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:54:22,455 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:54:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:54:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash 395299, now seen corresponding path program 1 times [2021-06-10 23:54:22,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:54:22,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47942137] [2021-06-10 23:54:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:54:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:54:22,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:54:22,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:54:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:54:22,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47942137] [2021-06-10 23:54:22,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:54:22,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:54:22,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628301580] [2021-06-10 23:54:22,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:54:22,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:54:22,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:54:22,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:54:22,482 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 313 [2021-06-10 23:54:22,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 157 transitions, 6551 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:22,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:54:22,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 313 [2021-06-10 23:54:22,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:54:22,534 INFO L129 PetriNetUnfolder]: 0/156 cut-off events. [2021-06-10 23:54:22,535 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:22,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3393 conditions, 156 events. 0/156 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 145 event pairs, 0 based on Foata normal form. 78/234 useless extension candidates. Maximal degree in co-relation 0. Up to 78 conditions per place. [2021-06-10 23:54:22,535 INFO L132 encePairwiseOnDemand]: 311/313 looper letters, 0 selfloop transitions, 1 changer transitions 0/156 dead transitions. [2021-06-10 23:54:22,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 156 transitions, 6551 flow [2021-06-10 23:54:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:54:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:54:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 932 transitions. [2021-06-10 23:54:22,536 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9925452609158679 [2021-06-10 23:54:22,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 932 transitions. [2021-06-10 23:54:22,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 932 transitions. [2021-06-10 23:54:22,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:54:22,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 932 transitions. [2021-06-10 23:54:22,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:22,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:22,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:22,538 INFO L185 Difference]: Start difference. First operand has 312 places, 157 transitions, 6551 flow. Second operand 3 states and 932 transitions. [2021-06-10 23:54:22,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 156 transitions, 6551 flow [2021-06-10 23:54:22,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 156 transitions, 699 flow, removed 2926 selfloop flow, removed 0 redundant places. [2021-06-10 23:54:22,656 INFO L241 Difference]: Finished difference. Result has 313 places, 156 transitions, 699 flow [2021-06-10 23:54:22,656 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=313, PETRI_TRANSITIONS=156} [2021-06-10 23:54:22,656 INFO L343 CegarLoopForPetriNet]: 312 programPoint places, 1 predicate places. [2021-06-10 23:54:22,656 INFO L480 AbstractCegarLoop]: Abstraction has has 313 places, 156 transitions, 699 flow [2021-06-10 23:54:22,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:22,656 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:54:22,656 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:54:22,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-06-10 23:54:22,657 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:54:22,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:54:22,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2117439739, now seen corresponding path program 1 times [2021-06-10 23:54:22,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:54:22,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281834268] [2021-06-10 23:54:22,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:54:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:54:22,672 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:54:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:54:22,673 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:54:22,684 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:54:22,685 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:54:22,685 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-06-10 23:54:22,685 WARN L342 ceAbstractionStarter]: 77 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:54:22,685 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 78 thread instances. [2021-06-10 23:54:22,762 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:54:22,763 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:54:22,763 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:54:22,763 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:54:22,763 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:54:22,763 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:54:22,763 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:54:22,763 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:54:22,763 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:54:22,763 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:54:22,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 396 places, 239 transitions, 6874 flow [2021-06-10 23:54:22,862 INFO L129 PetriNetUnfolder]: 0/473 cut-off events. [2021-06-10 23:54:22,862 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:22,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3789 conditions, 473 events. 0/473 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1740 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 0. Up to 79 conditions per place. [2021-06-10 23:54:22,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 396 places, 239 transitions, 6874 flow [2021-06-10 23:54:22,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 394 places, 237 transitions, 6870 flow [2021-06-10 23:54:22,865 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:54:22,865 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 394 places, 237 transitions, 6870 flow [2021-06-10 23:54:22,865 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 394 places, 237 transitions, 6870 flow [2021-06-10 23:54:22,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 394 places, 237 transitions, 6870 flow [2021-06-10 23:54:22,944 INFO L129 PetriNetUnfolder]: 0/315 cut-off events. [2021-06-10 23:54:22,944 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:22,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3631 conditions, 315 events. 0/315 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 950 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 0. Up to 79 conditions per place. [2021-06-10 23:54:22,975 INFO L151 LiptonReduction]: Number of co-enabled transitions 36660 [2021-06-10 23:54:36,958 INFO L163 LiptonReduction]: Checked pairs total: 15171 [2021-06-10 23:54:36,958 INFO L165 LiptonReduction]: Total number of compositions: 78 [2021-06-10 23:54:36,958 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14093 [2021-06-10 23:54:36,959 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:54:36,959 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:36,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:54:36,959 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:54:36,959 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:54:36,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:54:36,959 INFO L82 PathProgramCache]: Analyzing trace with hash 405411, now seen corresponding path program 1 times [2021-06-10 23:54:36,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:54:36,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480669210] [2021-06-10 23:54:36,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:54:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:54:36,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:54:36,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:54:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:54:36,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480669210] [2021-06-10 23:54:36,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:54:36,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:54:36,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945628138] [2021-06-10 23:54:36,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:54:36,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:54:36,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:54:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:54:36,982 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 317 [2021-06-10 23:54:36,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 159 transitions, 6714 flow. Second operand has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:36,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:54:36,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 317 [2021-06-10 23:54:36,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:54:37,036 INFO L129 PetriNetUnfolder]: 0/158 cut-off events. [2021-06-10 23:54:37,036 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:37,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3476 conditions, 158 events. 0/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 166 event pairs, 0 based on Foata normal form. 79/237 useless extension candidates. Maximal degree in co-relation 0. Up to 79 conditions per place. [2021-06-10 23:54:37,037 INFO L132 encePairwiseOnDemand]: 315/317 looper letters, 0 selfloop transitions, 1 changer transitions 0/158 dead transitions. [2021-06-10 23:54:37,037 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 158 transitions, 6714 flow [2021-06-10 23:54:37,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:54:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:54:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 944 transitions. [2021-06-10 23:54:37,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9926393270241851 [2021-06-10 23:54:37,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 944 transitions. [2021-06-10 23:54:37,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 944 transitions. [2021-06-10 23:54:37,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:54:37,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 944 transitions. [2021-06-10 23:54:37,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:37,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:37,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 317.0) internal successors, (1268), 4 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:37,039 INFO L185 Difference]: Start difference. First operand has 316 places, 159 transitions, 6714 flow. Second operand 3 states and 944 transitions. [2021-06-10 23:54:37,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 158 transitions, 6714 flow [2021-06-10 23:54:37,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 158 transitions, 708 flow, removed 3003 selfloop flow, removed 0 redundant places. [2021-06-10 23:54:37,173 INFO L241 Difference]: Finished difference. Result has 317 places, 158 transitions, 708 flow [2021-06-10 23:54:37,173 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=317, PETRI_TRANSITIONS=158} [2021-06-10 23:54:37,173 INFO L343 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2021-06-10 23:54:37,173 INFO L480 AbstractCegarLoop]: Abstraction has has 317 places, 158 transitions, 708 flow [2021-06-10 23:54:37,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:37,174 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:54:37,174 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:54:37,174 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-06-10 23:54:37,174 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:54:37,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:54:37,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1047065309, now seen corresponding path program 1 times [2021-06-10 23:54:37,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:54:37,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465834260] [2021-06-10 23:54:37,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:54:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:54:37,191 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:54:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:54:37,193 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:54:37,206 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:54:37,206 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:54:37,206 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-06-10 23:54:37,206 WARN L342 ceAbstractionStarter]: 78 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:54:37,206 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 79 thread instances. [2021-06-10 23:54:37,301 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:54:37,302 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:54:37,302 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:54:37,302 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:54:37,302 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:54:37,302 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:54:37,302 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:54:37,302 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:54:37,302 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:54:37,302 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:54:37,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 401 places, 242 transitions, 7041 flow [2021-06-10 23:54:37,403 INFO L129 PetriNetUnfolder]: 0/479 cut-off events. [2021-06-10 23:54:37,403 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:37,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3877 conditions, 479 events. 0/479 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1727 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 0. Up to 80 conditions per place. [2021-06-10 23:54:37,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 242 transitions, 7041 flow [2021-06-10 23:54:37,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 399 places, 240 transitions, 7037 flow [2021-06-10 23:54:37,406 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:54:37,406 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 399 places, 240 transitions, 7037 flow [2021-06-10 23:54:37,406 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 399 places, 240 transitions, 7037 flow [2021-06-10 23:54:37,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 399 places, 240 transitions, 7037 flow [2021-06-10 23:54:37,487 INFO L129 PetriNetUnfolder]: 0/319 cut-off events. [2021-06-10 23:54:37,487 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:37,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 319 events. 0/319 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1007 event pairs, 0 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 0. Up to 80 conditions per place. [2021-06-10 23:54:37,519 INFO L151 LiptonReduction]: Number of co-enabled transitions 37604 [2021-06-10 23:54:52,311 INFO L163 LiptonReduction]: Checked pairs total: 15563 [2021-06-10 23:54:52,311 INFO L165 LiptonReduction]: Total number of compositions: 79 [2021-06-10 23:54:52,312 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14906 [2021-06-10 23:54:52,312 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:54:52,312 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:52,312 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:54:52,312 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:54:52,313 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:54:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:54:52,313 INFO L82 PathProgramCache]: Analyzing trace with hash 415651, now seen corresponding path program 1 times [2021-06-10 23:54:52,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:54:52,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123801030] [2021-06-10 23:54:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:54:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:54:52,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:54:52,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:54:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:54:52,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123801030] [2021-06-10 23:54:52,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:54:52,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:54:52,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794646685] [2021-06-10 23:54:52,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:54:52,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:54:52,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:54:52,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:54:52,337 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 321 [2021-06-10 23:54:52,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 161 transitions, 6879 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:52,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:54:52,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 321 [2021-06-10 23:54:52,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:54:52,392 INFO L129 PetriNetUnfolder]: 0/160 cut-off events. [2021-06-10 23:54:52,393 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:52,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 160 events. 0/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 151 event pairs, 0 based on Foata normal form. 80/240 useless extension candidates. Maximal degree in co-relation 0. Up to 80 conditions per place. [2021-06-10 23:54:52,393 INFO L132 encePairwiseOnDemand]: 319/321 looper letters, 0 selfloop transitions, 1 changer transitions 0/160 dead transitions. [2021-06-10 23:54:52,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 160 transitions, 6879 flow [2021-06-10 23:54:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:54:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:54:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2021-06-10 23:54:52,394 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9927310488058152 [2021-06-10 23:54:52,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 956 transitions. [2021-06-10 23:54:52,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 956 transitions. [2021-06-10 23:54:52,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:54:52,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 956 transitions. [2021-06-10 23:54:52,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:52,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:52,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 321.0) internal successors, (1284), 4 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:52,396 INFO L185 Difference]: Start difference. First operand has 320 places, 161 transitions, 6879 flow. Second operand 3 states and 956 transitions. [2021-06-10 23:54:52,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 160 transitions, 6879 flow [2021-06-10 23:54:52,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 160 transitions, 717 flow, removed 3081 selfloop flow, removed 0 redundant places. [2021-06-10 23:54:52,538 INFO L241 Difference]: Finished difference. Result has 321 places, 160 transitions, 717 flow [2021-06-10 23:54:52,538 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=321, PETRI_TRANSITIONS=160} [2021-06-10 23:54:52,538 INFO L343 CegarLoopForPetriNet]: 320 programPoint places, 1 predicate places. [2021-06-10 23:54:52,538 INFO L480 AbstractCegarLoop]: Abstraction has has 321 places, 160 transitions, 717 flow [2021-06-10 23:54:52,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:54:52,538 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:54:52,539 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:54:52,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-06-10 23:54:52,539 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:54:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:54:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2125115286, now seen corresponding path program 1 times [2021-06-10 23:54:52,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:54:52,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935687608] [2021-06-10 23:54:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:54:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:54:52,557 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:54:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:54:52,559 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:54:52,572 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:54:52,572 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:54:52,572 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2021-06-10 23:54:52,572 WARN L342 ceAbstractionStarter]: 79 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:54:52,572 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 80 thread instances. [2021-06-10 23:54:52,660 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:54:52,660 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:54:52,660 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:54:52,660 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:54:52,660 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:54:52,660 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:54:52,660 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:54:52,661 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:54:52,661 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:54:52,661 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:54:52,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 406 places, 245 transitions, 7210 flow [2021-06-10 23:54:52,766 INFO L129 PetriNetUnfolder]: 0/485 cut-off events. [2021-06-10 23:54:52,766 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:52,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3966 conditions, 485 events. 0/485 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1761 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 0. Up to 81 conditions per place. [2021-06-10 23:54:52,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 406 places, 245 transitions, 7210 flow [2021-06-10 23:54:52,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 404 places, 243 transitions, 7206 flow [2021-06-10 23:54:52,769 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:54:52,769 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 404 places, 243 transitions, 7206 flow [2021-06-10 23:54:52,769 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 404 places, 243 transitions, 7206 flow [2021-06-10 23:54:52,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 404 places, 243 transitions, 7206 flow [2021-06-10 23:54:52,853 INFO L129 PetriNetUnfolder]: 0/323 cut-off events. [2021-06-10 23:54:52,853 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:54:52,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 323 events. 0/323 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 967 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 0. Up to 81 conditions per place. [2021-06-10 23:54:52,886 INFO L151 LiptonReduction]: Number of co-enabled transitions 38560 [2021-06-10 23:55:10,257 INFO L163 LiptonReduction]: Checked pairs total: 15960 [2021-06-10 23:55:10,257 INFO L165 LiptonReduction]: Total number of compositions: 80 [2021-06-10 23:55:10,257 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17488 [2021-06-10 23:55:10,258 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:55:10,258 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:10,258 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:55:10,258 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:55:10,258 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:55:10,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:55:10,258 INFO L82 PathProgramCache]: Analyzing trace with hash 426019, now seen corresponding path program 1 times [2021-06-10 23:55:10,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:55:10,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661723980] [2021-06-10 23:55:10,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:55:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:55:10,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:55:10,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:55:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:55:10,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661723980] [2021-06-10 23:55:10,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:55:10,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:55:10,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786644208] [2021-06-10 23:55:10,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:55:10,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:55:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:55:10,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:55:10,293 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 325 [2021-06-10 23:55:10,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 163 transitions, 7046 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:10,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:55:10,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 325 [2021-06-10 23:55:10,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:55:10,350 INFO L129 PetriNetUnfolder]: 0/162 cut-off events. [2021-06-10 23:55:10,350 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:10,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 162 events. 0/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 152 event pairs, 0 based on Foata normal form. 81/243 useless extension candidates. Maximal degree in co-relation 0. Up to 81 conditions per place. [2021-06-10 23:55:10,350 INFO L132 encePairwiseOnDemand]: 323/325 looper letters, 0 selfloop transitions, 1 changer transitions 0/162 dead transitions. [2021-06-10 23:55:10,350 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 162 transitions, 7046 flow [2021-06-10 23:55:10,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:55:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:55:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2021-06-10 23:55:10,351 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9928205128205129 [2021-06-10 23:55:10,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 968 transitions. [2021-06-10 23:55:10,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 968 transitions. [2021-06-10 23:55:10,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:55:10,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 968 transitions. [2021-06-10 23:55:10,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:10,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:10,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:10,353 INFO L185 Difference]: Start difference. First operand has 324 places, 163 transitions, 7046 flow. Second operand 3 states and 968 transitions. [2021-06-10 23:55:10,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 162 transitions, 7046 flow [2021-06-10 23:55:10,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 162 transitions, 726 flow, removed 3160 selfloop flow, removed 0 redundant places. [2021-06-10 23:55:10,505 INFO L241 Difference]: Finished difference. Result has 325 places, 162 transitions, 726 flow [2021-06-10 23:55:10,506 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=325, PETRI_TRANSITIONS=162} [2021-06-10 23:55:10,506 INFO L343 CegarLoopForPetriNet]: 324 programPoint places, 1 predicate places. [2021-06-10 23:55:10,506 INFO L480 AbstractCegarLoop]: Abstraction has has 325 places, 162 transitions, 726 flow [2021-06-10 23:55:10,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:10,506 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:55:10,506 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:55:10,506 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-06-10 23:55:10,506 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:55:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:55:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1215918752, now seen corresponding path program 1 times [2021-06-10 23:55:10,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:55:10,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894189321] [2021-06-10 23:55:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:55:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:55:10,524 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:55:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:55:10,526 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:55:10,538 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:55:10,539 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:55:10,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-06-10 23:55:10,539 WARN L342 ceAbstractionStarter]: 80 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:55:10,539 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 81 thread instances. [2021-06-10 23:55:10,625 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:55:10,625 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:55:10,625 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:55:10,626 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:55:10,626 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:55:10,626 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:55:10,626 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:55:10,640 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:55:10,640 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:55:10,641 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:55:10,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 411 places, 248 transitions, 7381 flow [2021-06-10 23:55:10,747 INFO L129 PetriNetUnfolder]: 0/491 cut-off events. [2021-06-10 23:55:10,748 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:10,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 491 events. 0/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1826 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 0. Up to 82 conditions per place. [2021-06-10 23:55:10,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 411 places, 248 transitions, 7381 flow [2021-06-10 23:55:10,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 409 places, 246 transitions, 7377 flow [2021-06-10 23:55:10,751 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:55:10,751 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 409 places, 246 transitions, 7377 flow [2021-06-10 23:55:10,751 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 409 places, 246 transitions, 7377 flow [2021-06-10 23:55:10,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 409 places, 246 transitions, 7377 flow [2021-06-10 23:55:10,836 INFO L129 PetriNetUnfolder]: 0/327 cut-off events. [2021-06-10 23:55:10,837 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:10,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3892 conditions, 327 events. 0/327 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 904 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 0. Up to 82 conditions per place. [2021-06-10 23:55:10,870 INFO L151 LiptonReduction]: Number of co-enabled transitions 39528 [2021-06-10 23:55:29,261 INFO L163 LiptonReduction]: Checked pairs total: 16362 [2021-06-10 23:55:29,261 INFO L165 LiptonReduction]: Total number of compositions: 81 [2021-06-10 23:55:29,261 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18510 [2021-06-10 23:55:29,262 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:55:29,262 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:29,262 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:55:29,262 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:55:29,262 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:55:29,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:55:29,262 INFO L82 PathProgramCache]: Analyzing trace with hash 436515, now seen corresponding path program 1 times [2021-06-10 23:55:29,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:55:29,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251564496] [2021-06-10 23:55:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:55:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:55:29,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:55:29,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:55:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:55:29,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251564496] [2021-06-10 23:55:29,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:55:29,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:55:29,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612865011] [2021-06-10 23:55:29,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:55:29,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:55:29,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:55:29,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:55:29,286 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 329 [2021-06-10 23:55:29,287 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 165 transitions, 7215 flow. Second operand has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:29,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:55:29,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 329 [2021-06-10 23:55:29,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:55:29,344 INFO L129 PetriNetUnfolder]: 0/164 cut-off events. [2021-06-10 23:55:29,344 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:29,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 164 events. 0/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 153 event pairs, 0 based on Foata normal form. 82/246 useless extension candidates. Maximal degree in co-relation 0. Up to 82 conditions per place. [2021-06-10 23:55:29,344 INFO L132 encePairwiseOnDemand]: 327/329 looper letters, 0 selfloop transitions, 1 changer transitions 0/164 dead transitions. [2021-06-10 23:55:29,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 164 transitions, 7215 flow [2021-06-10 23:55:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:55:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:55:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 980 transitions. [2021-06-10 23:55:29,345 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9929078014184397 [2021-06-10 23:55:29,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 980 transitions. [2021-06-10 23:55:29,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 980 transitions. [2021-06-10 23:55:29,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:55:29,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 980 transitions. [2021-06-10 23:55:29,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:29,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:29,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:29,347 INFO L185 Difference]: Start difference. First operand has 328 places, 165 transitions, 7215 flow. Second operand 3 states and 980 transitions. [2021-06-10 23:55:29,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 164 transitions, 7215 flow [2021-06-10 23:55:29,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 164 transitions, 735 flow, removed 3240 selfloop flow, removed 0 redundant places. [2021-06-10 23:55:29,502 INFO L241 Difference]: Finished difference. Result has 329 places, 164 transitions, 735 flow [2021-06-10 23:55:29,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=329, PETRI_TRANSITIONS=164} [2021-06-10 23:55:29,503 INFO L343 CegarLoopForPetriNet]: 328 programPoint places, 1 predicate places. [2021-06-10 23:55:29,503 INFO L480 AbstractCegarLoop]: Abstraction has has 329 places, 164 transitions, 735 flow [2021-06-10 23:55:29,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:29,503 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:55:29,503 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:55:29,503 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-06-10 23:55:29,503 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:55:29,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:55:29,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1883866559, now seen corresponding path program 1 times [2021-06-10 23:55:29,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:55:29,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886167597] [2021-06-10 23:55:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:55:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:55:29,521 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:55:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:55:29,523 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:55:29,535 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:55:29,536 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:55:29,536 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-06-10 23:55:29,536 WARN L342 ceAbstractionStarter]: 81 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:55:29,536 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 82 thread instances. [2021-06-10 23:55:29,630 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:55:29,630 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:55:29,630 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:55:29,630 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:55:29,630 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:55:29,630 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:55:29,630 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:55:29,630 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:55:29,630 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:55:29,631 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:55:29,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 416 places, 251 transitions, 7554 flow [2021-06-10 23:55:29,737 INFO L129 PetriNetUnfolder]: 0/497 cut-off events. [2021-06-10 23:55:29,738 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:29,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4147 conditions, 497 events. 0/497 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1845 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 0. Up to 83 conditions per place. [2021-06-10 23:55:29,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 416 places, 251 transitions, 7554 flow [2021-06-10 23:55:29,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 414 places, 249 transitions, 7550 flow [2021-06-10 23:55:29,741 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:55:29,741 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 414 places, 249 transitions, 7550 flow [2021-06-10 23:55:29,741 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 414 places, 249 transitions, 7550 flow [2021-06-10 23:55:29,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 414 places, 249 transitions, 7550 flow [2021-06-10 23:55:29,835 INFO L129 PetriNetUnfolder]: 0/331 cut-off events. [2021-06-10 23:55:29,835 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:29,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3981 conditions, 331 events. 0/331 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 963 event pairs, 0 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 0. Up to 83 conditions per place. [2021-06-10 23:55:29,869 INFO L151 LiptonReduction]: Number of co-enabled transitions 40508 [2021-06-10 23:55:49,728 INFO L163 LiptonReduction]: Checked pairs total: 16769 [2021-06-10 23:55:49,728 INFO L165 LiptonReduction]: Total number of compositions: 82 [2021-06-10 23:55:49,728 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19988 [2021-06-10 23:55:49,729 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:55:49,729 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:49,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:55:49,729 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:55:49,729 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:55:49,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:55:49,730 INFO L82 PathProgramCache]: Analyzing trace with hash 447139, now seen corresponding path program 1 times [2021-06-10 23:55:49,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:55:49,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608638063] [2021-06-10 23:55:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:55:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:55:49,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:55:49,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:55:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:55:49,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608638063] [2021-06-10 23:55:49,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:55:49,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:55:49,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681215416] [2021-06-10 23:55:49,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:55:49,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:55:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:55:49,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:55:49,753 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 333 [2021-06-10 23:55:49,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 167 transitions, 7386 flow. Second operand has 3 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:49,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:55:49,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 333 [2021-06-10 23:55:49,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:55:49,811 INFO L129 PetriNetUnfolder]: 0/166 cut-off events. [2021-06-10 23:55:49,811 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:49,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 166 events. 0/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 184 event pairs, 0 based on Foata normal form. 83/249 useless extension candidates. Maximal degree in co-relation 0. Up to 83 conditions per place. [2021-06-10 23:55:49,812 INFO L132 encePairwiseOnDemand]: 331/333 looper letters, 0 selfloop transitions, 1 changer transitions 0/166 dead transitions. [2021-06-10 23:55:49,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 166 transitions, 7386 flow [2021-06-10 23:55:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:55:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:55:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 992 transitions. [2021-06-10 23:55:49,813 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.992992992992993 [2021-06-10 23:55:49,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 992 transitions. [2021-06-10 23:55:49,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 992 transitions. [2021-06-10 23:55:49,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:55:49,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 992 transitions. [2021-06-10 23:55:49,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:49,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:49,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:49,814 INFO L185 Difference]: Start difference. First operand has 332 places, 167 transitions, 7386 flow. Second operand 3 states and 992 transitions. [2021-06-10 23:55:49,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 166 transitions, 7386 flow [2021-06-10 23:55:49,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 166 transitions, 744 flow, removed 3321 selfloop flow, removed 0 redundant places. [2021-06-10 23:55:49,984 INFO L241 Difference]: Finished difference. Result has 333 places, 166 transitions, 744 flow [2021-06-10 23:55:49,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=333, PETRI_TRANSITIONS=166} [2021-06-10 23:55:49,984 INFO L343 CegarLoopForPetriNet]: 332 programPoint places, 1 predicate places. [2021-06-10 23:55:49,984 INFO L480 AbstractCegarLoop]: Abstraction has has 333 places, 166 transitions, 744 flow [2021-06-10 23:55:49,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:55:49,985 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:55:49,985 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:55:49,985 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-06-10 23:55:49,985 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:55:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:55:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1599175267, now seen corresponding path program 1 times [2021-06-10 23:55:49,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:55:49,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333276428] [2021-06-10 23:55:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:55:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:55:50,005 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:55:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:55:50,007 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:55:50,021 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:55:50,021 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:55:50,021 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2021-06-10 23:55:50,021 WARN L342 ceAbstractionStarter]: 82 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:55:50,021 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 83 thread instances. [2021-06-10 23:55:50,120 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:55:50,121 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:55:50,121 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:55:50,121 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:55:50,121 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:55:50,121 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:55:50,121 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:55:50,121 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:55:50,121 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:55:50,121 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:55:50,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 421 places, 254 transitions, 7729 flow [2021-06-10 23:55:50,232 INFO L129 PetriNetUnfolder]: 0/503 cut-off events. [2021-06-10 23:55:50,232 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:50,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4239 conditions, 503 events. 0/503 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1847 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 0. Up to 84 conditions per place. [2021-06-10 23:55:50,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 421 places, 254 transitions, 7729 flow [2021-06-10 23:55:50,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 419 places, 252 transitions, 7725 flow [2021-06-10 23:55:50,235 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:55:50,235 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 419 places, 252 transitions, 7725 flow [2021-06-10 23:55:50,235 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 419 places, 252 transitions, 7725 flow [2021-06-10 23:55:50,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 419 places, 252 transitions, 7725 flow [2021-06-10 23:55:50,323 INFO L129 PetriNetUnfolder]: 0/335 cut-off events. [2021-06-10 23:55:50,324 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:55:50,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 335 events. 0/335 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1042 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 0. Up to 84 conditions per place. [2021-06-10 23:55:50,359 INFO L151 LiptonReduction]: Number of co-enabled transitions 41500 [2021-06-10 23:56:10,733 INFO L163 LiptonReduction]: Checked pairs total: 17181 [2021-06-10 23:56:10,734 INFO L165 LiptonReduction]: Total number of compositions: 83 [2021-06-10 23:56:10,734 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20499 [2021-06-10 23:56:10,735 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:56:10,735 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:10,735 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:56:10,735 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:56:10,735 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:56:10,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:56:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash 457891, now seen corresponding path program 1 times [2021-06-10 23:56:10,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:56:10,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054311363] [2021-06-10 23:56:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:56:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:56:10,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:56:10,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:56:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:56:10,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054311363] [2021-06-10 23:56:10,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:56:10,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:56:10,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569264653] [2021-06-10 23:56:10,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:56:10,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:56:10,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:56:10,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:56:10,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 337 [2021-06-10 23:56:10,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 169 transitions, 7559 flow. Second operand has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:10,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:56:10,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 337 [2021-06-10 23:56:10,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:56:10,821 INFO L129 PetriNetUnfolder]: 0/168 cut-off events. [2021-06-10 23:56:10,822 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:10,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3906 conditions, 168 events. 0/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 173 event pairs, 0 based on Foata normal form. 84/252 useless extension candidates. Maximal degree in co-relation 0. Up to 84 conditions per place. [2021-06-10 23:56:10,822 INFO L132 encePairwiseOnDemand]: 335/337 looper letters, 0 selfloop transitions, 1 changer transitions 0/168 dead transitions. [2021-06-10 23:56:10,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 168 transitions, 7559 flow [2021-06-10 23:56:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:56:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:56:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2021-06-10 23:56:10,823 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9930761622156281 [2021-06-10 23:56:10,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1004 transitions. [2021-06-10 23:56:10,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1004 transitions. [2021-06-10 23:56:10,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:56:10,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1004 transitions. [2021-06-10 23:56:10,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:10,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:10,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:10,825 INFO L185 Difference]: Start difference. First operand has 336 places, 169 transitions, 7559 flow. Second operand 3 states and 1004 transitions. [2021-06-10 23:56:10,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 168 transitions, 7559 flow [2021-06-10 23:56:11,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 168 transitions, 753 flow, removed 3403 selfloop flow, removed 0 redundant places. [2021-06-10 23:56:11,009 INFO L241 Difference]: Finished difference. Result has 337 places, 168 transitions, 753 flow [2021-06-10 23:56:11,009 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=337, PETRI_TRANSITIONS=168} [2021-06-10 23:56:11,010 INFO L343 CegarLoopForPetriNet]: 336 programPoint places, 1 predicate places. [2021-06-10 23:56:11,010 INFO L480 AbstractCegarLoop]: Abstraction has has 337 places, 168 transitions, 753 flow [2021-06-10 23:56:11,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:11,010 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:56:11,010 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:56:11,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-06-10 23:56:11,010 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:56:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:56:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash 443771644, now seen corresponding path program 1 times [2021-06-10 23:56:11,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:56:11,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639265573] [2021-06-10 23:56:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:56:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:56:11,028 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:56:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:56:11,030 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:56:11,043 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:56:11,044 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:56:11,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-06-10 23:56:11,044 WARN L342 ceAbstractionStarter]: 83 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:56:11,044 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 84 thread instances. [2021-06-10 23:56:11,145 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:56:11,145 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:56:11,145 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:56:11,146 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:56:11,146 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:56:11,146 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:56:11,146 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:56:11,146 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:56:11,146 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:56:11,146 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:56:11,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 426 places, 257 transitions, 7906 flow [2021-06-10 23:56:11,261 INFO L129 PetriNetUnfolder]: 0/509 cut-off events. [2021-06-10 23:56:11,261 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:11,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4332 conditions, 509 events. 0/509 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1907 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 0. Up to 85 conditions per place. [2021-06-10 23:56:11,261 INFO L82 GeneralOperation]: Start removeDead. Operand has 426 places, 257 transitions, 7906 flow [2021-06-10 23:56:11,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 424 places, 255 transitions, 7902 flow [2021-06-10 23:56:11,264 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:56:11,264 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 424 places, 255 transitions, 7902 flow [2021-06-10 23:56:11,264 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 424 places, 255 transitions, 7902 flow [2021-06-10 23:56:11,266 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 424 places, 255 transitions, 7902 flow [2021-06-10 23:56:11,356 INFO L129 PetriNetUnfolder]: 0/339 cut-off events. [2021-06-10 23:56:11,356 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:11,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4162 conditions, 339 events. 0/339 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1037 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 0. Up to 85 conditions per place. [2021-06-10 23:56:11,394 INFO L151 LiptonReduction]: Number of co-enabled transitions 42504 [2021-06-10 23:56:32,346 INFO L163 LiptonReduction]: Checked pairs total: 17598 [2021-06-10 23:56:32,346 INFO L165 LiptonReduction]: Total number of compositions: 84 [2021-06-10 23:56:32,347 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21083 [2021-06-10 23:56:32,347 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:56:32,347 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:32,347 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:56:32,347 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:56:32,347 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:56:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:56:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 468771, now seen corresponding path program 1 times [2021-06-10 23:56:32,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:56:32,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034590463] [2021-06-10 23:56:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:56:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:56:32,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:56:32,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:56:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:56:32,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034590463] [2021-06-10 23:56:32,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:56:32,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:56:32,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948067489] [2021-06-10 23:56:32,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:56:32,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:56:32,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:56:32,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:56:32,432 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 341 [2021-06-10 23:56:32,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 171 transitions, 7734 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:32,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:56:32,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 341 [2021-06-10 23:56:32,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:56:32,493 INFO L129 PetriNetUnfolder]: 0/170 cut-off events. [2021-06-10 23:56:32,494 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:32,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3995 conditions, 170 events. 0/170 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 140 event pairs, 0 based on Foata normal form. 85/255 useless extension candidates. Maximal degree in co-relation 0. Up to 85 conditions per place. [2021-06-10 23:56:32,494 INFO L132 encePairwiseOnDemand]: 339/341 looper letters, 0 selfloop transitions, 1 changer transitions 0/170 dead transitions. [2021-06-10 23:56:32,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 170 transitions, 7734 flow [2021-06-10 23:56:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:56:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:56:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2021-06-10 23:56:32,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9931573802541545 [2021-06-10 23:56:32,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1016 transitions. [2021-06-10 23:56:32,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1016 transitions. [2021-06-10 23:56:32,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:56:32,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1016 transitions. [2021-06-10 23:56:32,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:32,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:32,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:32,497 INFO L185 Difference]: Start difference. First operand has 340 places, 171 transitions, 7734 flow. Second operand 3 states and 1016 transitions. [2021-06-10 23:56:32,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 170 transitions, 7734 flow [2021-06-10 23:56:32,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 170 transitions, 762 flow, removed 3486 selfloop flow, removed 0 redundant places. [2021-06-10 23:56:32,712 INFO L241 Difference]: Finished difference. Result has 341 places, 170 transitions, 762 flow [2021-06-10 23:56:32,713 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=341, PETRI_TRANSITIONS=170} [2021-06-10 23:56:32,713 INFO L343 CegarLoopForPetriNet]: 340 programPoint places, 1 predicate places. [2021-06-10 23:56:32,713 INFO L480 AbstractCegarLoop]: Abstraction has has 341 places, 170 transitions, 762 flow [2021-06-10 23:56:32,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:32,713 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:56:32,713 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:56:32,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2021-06-10 23:56:32,713 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:56:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:56:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash 777326630, now seen corresponding path program 1 times [2021-06-10 23:56:32,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:56:32,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704219602] [2021-06-10 23:56:32,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:56:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:56:32,733 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:56:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:56:32,735 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:56:32,749 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:56:32,749 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:56:32,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2021-06-10 23:56:32,749 WARN L342 ceAbstractionStarter]: 84 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:56:32,749 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 85 thread instances. [2021-06-10 23:56:32,859 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:56:32,859 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:56:32,859 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:56:32,859 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:56:32,860 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:56:32,860 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:56:32,860 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:56:32,860 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:56:32,860 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:56:32,860 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:56:32,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 431 places, 260 transitions, 8085 flow [2021-06-10 23:56:32,981 INFO L129 PetriNetUnfolder]: 0/515 cut-off events. [2021-06-10 23:56:32,981 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:32,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4426 conditions, 515 events. 0/515 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1911 event pairs, 0 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 0. Up to 86 conditions per place. [2021-06-10 23:56:32,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 431 places, 260 transitions, 8085 flow [2021-06-10 23:56:32,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 429 places, 258 transitions, 8081 flow [2021-06-10 23:56:32,984 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:56:32,985 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 429 places, 258 transitions, 8081 flow [2021-06-10 23:56:32,985 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 429 places, 258 transitions, 8081 flow [2021-06-10 23:56:32,987 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 429 places, 258 transitions, 8081 flow [2021-06-10 23:56:33,080 INFO L129 PetriNetUnfolder]: 0/343 cut-off events. [2021-06-10 23:56:33,080 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:33,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4254 conditions, 343 events. 0/343 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1025 event pairs, 0 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 0. Up to 86 conditions per place. [2021-06-10 23:56:33,119 INFO L151 LiptonReduction]: Number of co-enabled transitions 43520 [2021-06-10 23:56:55,566 INFO L163 LiptonReduction]: Checked pairs total: 18020 [2021-06-10 23:56:55,566 INFO L165 LiptonReduction]: Total number of compositions: 85 [2021-06-10 23:56:55,566 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22582 [2021-06-10 23:56:55,567 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:56:55,567 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:55,567 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:56:55,567 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:56:55,567 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:56:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:56:55,567 INFO L82 PathProgramCache]: Analyzing trace with hash 479779, now seen corresponding path program 1 times [2021-06-10 23:56:55,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:56:55,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003961495] [2021-06-10 23:56:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:56:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:56:55,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:56:55,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:56:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:56:55,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003961495] [2021-06-10 23:56:55,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:56:55,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:56:55,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253495255] [2021-06-10 23:56:55,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:56:55,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:56:55,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:56:55,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:56:55,596 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 345 [2021-06-10 23:56:55,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 173 transitions, 7911 flow. Second operand has 3 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:55,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:56:55,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 345 [2021-06-10 23:56:55,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:56:55,659 INFO L129 PetriNetUnfolder]: 0/172 cut-off events. [2021-06-10 23:56:55,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:55,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4085 conditions, 172 events. 0/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 177 event pairs, 0 based on Foata normal form. 86/258 useless extension candidates. Maximal degree in co-relation 0. Up to 86 conditions per place. [2021-06-10 23:56:55,660 INFO L132 encePairwiseOnDemand]: 343/345 looper letters, 0 selfloop transitions, 1 changer transitions 0/172 dead transitions. [2021-06-10 23:56:55,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 172 transitions, 7911 flow [2021-06-10 23:56:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:56:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:56:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2021-06-10 23:56:55,661 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9932367149758454 [2021-06-10 23:56:55,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2021-06-10 23:56:55,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2021-06-10 23:56:55,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:56:55,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2021-06-10 23:56:55,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:55,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:55,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:55,662 INFO L185 Difference]: Start difference. First operand has 344 places, 173 transitions, 7911 flow. Second operand 3 states and 1028 transitions. [2021-06-10 23:56:55,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 172 transitions, 7911 flow [2021-06-10 23:56:55,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 172 transitions, 771 flow, removed 3570 selfloop flow, removed 0 redundant places. [2021-06-10 23:56:55,902 INFO L241 Difference]: Finished difference. Result has 345 places, 172 transitions, 771 flow [2021-06-10 23:56:55,903 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=345, PETRI_TRANSITIONS=172} [2021-06-10 23:56:55,903 INFO L343 CegarLoopForPetriNet]: 344 programPoint places, 1 predicate places. [2021-06-10 23:56:55,903 INFO L480 AbstractCegarLoop]: Abstraction has has 345 places, 172 transitions, 771 flow [2021-06-10 23:56:55,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:56:55,903 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:56:55,903 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:56:55,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2021-06-10 23:56:55,903 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:56:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:56:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1051655111, now seen corresponding path program 1 times [2021-06-10 23:56:55,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:56:55,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909732353] [2021-06-10 23:56:55,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:56:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:56:55,922 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:56:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:56:55,924 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:56:55,938 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:56:55,938 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:56:55,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2021-06-10 23:56:55,938 WARN L342 ceAbstractionStarter]: 85 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:56:55,938 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 86 thread instances. [2021-06-10 23:56:56,059 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:56:56,060 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:56:56,060 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:56:56,060 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:56:56,060 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:56:56,060 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:56:56,060 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:56:56,060 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:56:56,060 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:56:56,060 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:56:56,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 436 places, 263 transitions, 8266 flow [2021-06-10 23:56:56,182 INFO L129 PetriNetUnfolder]: 0/521 cut-off events. [2021-06-10 23:56:56,183 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:56,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4521 conditions, 521 events. 0/521 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1924 event pairs, 0 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 0. Up to 87 conditions per place. [2021-06-10 23:56:56,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 436 places, 263 transitions, 8266 flow [2021-06-10 23:56:56,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 434 places, 261 transitions, 8262 flow [2021-06-10 23:56:56,189 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:56:56,189 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 434 places, 261 transitions, 8262 flow [2021-06-10 23:56:56,190 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 434 places, 261 transitions, 8262 flow [2021-06-10 23:56:56,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 434 places, 261 transitions, 8262 flow [2021-06-10 23:56:56,286 INFO L129 PetriNetUnfolder]: 0/347 cut-off events. [2021-06-10 23:56:56,286 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:56:56,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4347 conditions, 347 events. 0/347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1095 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 0. Up to 87 conditions per place. [2021-06-10 23:56:56,326 INFO L151 LiptonReduction]: Number of co-enabled transitions 44548 [2021-06-10 23:57:20,437 INFO L163 LiptonReduction]: Checked pairs total: 18447 [2021-06-10 23:57:20,437 INFO L165 LiptonReduction]: Total number of compositions: 86 [2021-06-10 23:57:20,437 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24248 [2021-06-10 23:57:20,438 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:57:20,438 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:57:20,438 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:57:20,438 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:57:20,438 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:57:20,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:57:20,438 INFO L82 PathProgramCache]: Analyzing trace with hash 490915, now seen corresponding path program 1 times [2021-06-10 23:57:20,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:57:20,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631281571] [2021-06-10 23:57:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:57:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:57:20,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:57:20,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:57:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:57:20,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631281571] [2021-06-10 23:57:20,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:57:20,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:57:20,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61665611] [2021-06-10 23:57:20,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:57:20,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:57:20,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:57:20,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:57:20,472 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 349 [2021-06-10 23:57:20,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 175 transitions, 8090 flow. Second operand has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:57:20,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:57:20,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 349 [2021-06-10 23:57:20,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:57:20,537 INFO L129 PetriNetUnfolder]: 0/174 cut-off events. [2021-06-10 23:57:20,538 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:57:20,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4176 conditions, 174 events. 0/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 182 event pairs, 0 based on Foata normal form. 87/261 useless extension candidates. Maximal degree in co-relation 0. Up to 87 conditions per place. [2021-06-10 23:57:20,538 INFO L132 encePairwiseOnDemand]: 347/349 looper letters, 0 selfloop transitions, 1 changer transitions 0/174 dead transitions. [2021-06-10 23:57:20,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 174 transitions, 8090 flow [2021-06-10 23:57:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:57:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:57:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2021-06-10 23:57:20,539 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9933142311365807 [2021-06-10 23:57:20,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1040 transitions. [2021-06-10 23:57:20,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1040 transitions. [2021-06-10 23:57:20,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:57:20,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1040 transitions. [2021-06-10 23:57:20,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:57:20,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:57:20,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:57:20,541 INFO L185 Difference]: Start difference. First operand has 348 places, 175 transitions, 8090 flow. Second operand 3 states and 1040 transitions. [2021-06-10 23:57:20,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 174 transitions, 8090 flow [2021-06-10 23:57:20,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 174 transitions, 780 flow, removed 3655 selfloop flow, removed 0 redundant places. [2021-06-10 23:57:20,792 INFO L241 Difference]: Finished difference. Result has 349 places, 174 transitions, 780 flow [2021-06-10 23:57:20,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=349, PETRI_TRANSITIONS=174} [2021-06-10 23:57:20,793 INFO L343 CegarLoopForPetriNet]: 348 programPoint places, 1 predicate places. [2021-06-10 23:57:20,793 INFO L480 AbstractCegarLoop]: Abstraction has has 349 places, 174 transitions, 780 flow [2021-06-10 23:57:20,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:57:20,793 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:57:20,793 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:57:20,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2021-06-10 23:57:20,793 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:57:20,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:57:20,793 INFO L82 PathProgramCache]: Analyzing trace with hash 466958825, now seen corresponding path program 1 times [2021-06-10 23:57:20,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:57:20,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504955139] [2021-06-10 23:57:20,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:57:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:57:20,812 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:57:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:57:20,813 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:57:20,827 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:57:20,827 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:57:20,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-06-10 23:57:20,828 WARN L342 ceAbstractionStarter]: 86 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:57:20,828 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 87 thread instances. [2021-06-10 23:57:20,945 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:57:20,945 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:57:20,945 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:57:20,945 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:57:20,945 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:57:20,945 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:57:20,946 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:57:20,946 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:57:20,946 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:57:20,946 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:57:20,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 441 places, 266 transitions, 8449 flow [2021-06-10 23:57:21,066 INFO L129 PetriNetUnfolder]: 0/527 cut-off events. [2021-06-10 23:57:21,066 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:57:21,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4617 conditions, 527 events. 0/527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1944 event pairs, 0 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 0. Up to 88 conditions per place. [2021-06-10 23:57:21,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 441 places, 266 transitions, 8449 flow [2021-06-10 23:57:21,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 264 transitions, 8445 flow [2021-06-10 23:57:21,069 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:57:21,069 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 439 places, 264 transitions, 8445 flow [2021-06-10 23:57:21,069 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 439 places, 264 transitions, 8445 flow [2021-06-10 23:57:21,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 439 places, 264 transitions, 8445 flow [2021-06-10 23:57:21,166 INFO L129 PetriNetUnfolder]: 0/351 cut-off events. [2021-06-10 23:57:21,167 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:57:21,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4441 conditions, 351 events. 0/351 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 983 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 0. Up to 88 conditions per place. [2021-06-10 23:57:21,287 INFO L151 LiptonReduction]: Number of co-enabled transitions 45588 [2021-06-10 23:57:47,592 INFO L163 LiptonReduction]: Checked pairs total: 18879 [2021-06-10 23:57:47,592 INFO L165 LiptonReduction]: Total number of compositions: 87 [2021-06-10 23:57:47,592 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26523 [2021-06-10 23:57:47,593 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:57:47,593 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:57:47,593 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:57:47,593 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:57:47,593 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:57:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:57:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash 502179, now seen corresponding path program 1 times [2021-06-10 23:57:47,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:57:47,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867741929] [2021-06-10 23:57:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:57:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:57:47,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:57:47,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:57:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:57:47,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867741929] [2021-06-10 23:57:47,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:57:47,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:57:47,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187494792] [2021-06-10 23:57:47,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:57:47,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:57:47,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:57:47,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:57:47,627 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 353 [2021-06-10 23:57:47,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 177 transitions, 8271 flow. Second operand has 3 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:57:47,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:57:47,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 353 [2021-06-10 23:57:47,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:57:47,692 INFO L129 PetriNetUnfolder]: 0/176 cut-off events. [2021-06-10 23:57:47,693 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:57:47,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4268 conditions, 176 events. 0/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 177 event pairs, 0 based on Foata normal form. 88/264 useless extension candidates. Maximal degree in co-relation 0. Up to 88 conditions per place. [2021-06-10 23:57:47,693 INFO L132 encePairwiseOnDemand]: 351/353 looper letters, 0 selfloop transitions, 1 changer transitions 0/176 dead transitions. [2021-06-10 23:57:47,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 176 transitions, 8271 flow [2021-06-10 23:57:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:57:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:57:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1052 transitions. [2021-06-10 23:57:47,694 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9933899905571294 [2021-06-10 23:57:47,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1052 transitions. [2021-06-10 23:57:47,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1052 transitions. [2021-06-10 23:57:47,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:57:47,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1052 transitions. [2021-06-10 23:57:47,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:57:47,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:57:47,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:57:47,696 INFO L185 Difference]: Start difference. First operand has 352 places, 177 transitions, 8271 flow. Second operand 3 states and 1052 transitions. [2021-06-10 23:57:47,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 176 transitions, 8271 flow [2021-06-10 23:57:47,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 176 transitions, 789 flow, removed 3741 selfloop flow, removed 0 redundant places. [2021-06-10 23:57:47,966 INFO L241 Difference]: Finished difference. Result has 353 places, 176 transitions, 789 flow [2021-06-10 23:57:47,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=353, PETRI_TRANSITIONS=176} [2021-06-10 23:57:47,966 INFO L343 CegarLoopForPetriNet]: 352 programPoint places, 1 predicate places. [2021-06-10 23:57:47,966 INFO L480 AbstractCegarLoop]: Abstraction has has 353 places, 176 transitions, 789 flow [2021-06-10 23:57:47,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:57:47,966 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:57:47,966 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:57:47,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2021-06-10 23:57:47,967 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:57:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:57:47,967 INFO L82 PathProgramCache]: Analyzing trace with hash -307648862, now seen corresponding path program 1 times [2021-06-10 23:57:47,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:57:47,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444572025] [2021-06-10 23:57:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:57:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:57:47,986 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:57:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:57:47,988 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:57:48,003 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:57:48,003 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:57:48,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-06-10 23:57:48,003 WARN L342 ceAbstractionStarter]: 87 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:57:48,003 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 88 thread instances. [2021-06-10 23:57:48,130 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:57:48,131 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:57:48,131 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:57:48,131 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:57:48,131 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:57:48,131 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:57:48,131 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:57:48,131 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:57:48,131 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:57:48,131 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:57:48,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 446 places, 269 transitions, 8634 flow [2021-06-10 23:57:48,258 INFO L129 PetriNetUnfolder]: 0/533 cut-off events. [2021-06-10 23:57:48,259 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:57:48,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 533 events. 0/533 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1958 event pairs, 0 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 0. Up to 89 conditions per place. [2021-06-10 23:57:48,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 269 transitions, 8634 flow [2021-06-10 23:57:48,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 444 places, 267 transitions, 8630 flow [2021-06-10 23:57:48,262 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:57:48,262 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 444 places, 267 transitions, 8630 flow [2021-06-10 23:57:48,262 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 444 places, 267 transitions, 8630 flow [2021-06-10 23:57:48,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 444 places, 267 transitions, 8630 flow [2021-06-10 23:57:48,364 INFO L129 PetriNetUnfolder]: 0/355 cut-off events. [2021-06-10 23:57:48,364 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:57:48,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4536 conditions, 355 events. 0/355 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1148 event pairs, 0 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 0. Up to 89 conditions per place. [2021-06-10 23:57:48,407 INFO L151 LiptonReduction]: Number of co-enabled transitions 46640 [2021-06-10 23:58:18,007 INFO L163 LiptonReduction]: Checked pairs total: 19316 [2021-06-10 23:58:18,008 INFO L165 LiptonReduction]: Total number of compositions: 88 [2021-06-10 23:58:18,008 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29746 [2021-06-10 23:58:18,009 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:58:18,009 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:58:18,009 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:58:18,009 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:58:18,009 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:58:18,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:58:18,009 INFO L82 PathProgramCache]: Analyzing trace with hash 513571, now seen corresponding path program 1 times [2021-06-10 23:58:18,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:58:18,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146774502] [2021-06-10 23:58:18,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:58:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:58:18,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:58:18,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:58:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:58:18,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146774502] [2021-06-10 23:58:18,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:58:18,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:58:18,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258812681] [2021-06-10 23:58:18,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:58:18,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:58:18,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:58:18,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:58:18,039 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 357 [2021-06-10 23:58:18,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 179 transitions, 8454 flow. Second operand has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:58:18,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:58:18,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 357 [2021-06-10 23:58:18,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:58:18,107 INFO L129 PetriNetUnfolder]: 0/178 cut-off events. [2021-06-10 23:58:18,107 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:58:18,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 178 events. 0/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 190 event pairs, 0 based on Foata normal form. 89/267 useless extension candidates. Maximal degree in co-relation 0. Up to 89 conditions per place. [2021-06-10 23:58:18,108 INFO L132 encePairwiseOnDemand]: 355/357 looper letters, 0 selfloop transitions, 1 changer transitions 0/178 dead transitions. [2021-06-10 23:58:18,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 178 transitions, 8454 flow [2021-06-10 23:58:18,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:58:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:58:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1064 transitions. [2021-06-10 23:58:18,109 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9934640522875817 [2021-06-10 23:58:18,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1064 transitions. [2021-06-10 23:58:18,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1064 transitions. [2021-06-10 23:58:18,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:58:18,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1064 transitions. [2021-06-10 23:58:18,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:58:18,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:58:18,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:58:18,125 INFO L185 Difference]: Start difference. First operand has 356 places, 179 transitions, 8454 flow. Second operand 3 states and 1064 transitions. [2021-06-10 23:58:18,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 178 transitions, 8454 flow [2021-06-10 23:58:18,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 178 transitions, 798 flow, removed 3828 selfloop flow, removed 0 redundant places. [2021-06-10 23:58:18,426 INFO L241 Difference]: Finished difference. Result has 357 places, 178 transitions, 798 flow [2021-06-10 23:58:18,426 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=357, PETRI_TRANSITIONS=178} [2021-06-10 23:58:18,426 INFO L343 CegarLoopForPetriNet]: 356 programPoint places, 1 predicate places. [2021-06-10 23:58:18,426 INFO L480 AbstractCegarLoop]: Abstraction has has 357 places, 178 transitions, 798 flow [2021-06-10 23:58:18,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:58:18,427 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:58:18,427 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:58:18,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2021-06-10 23:58:18,427 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:58:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:58:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1917844908, now seen corresponding path program 1 times [2021-06-10 23:58:18,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:58:18,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694725457] [2021-06-10 23:58:18,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:58:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:58:18,448 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:58:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:58:18,450 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:58:18,465 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:58:18,465 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:58:18,465 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2021-06-10 23:58:18,466 WARN L342 ceAbstractionStarter]: 88 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:58:18,466 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 89 thread instances. [2021-06-10 23:58:18,614 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:58:18,614 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:58:18,614 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:58:18,615 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:58:18,615 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:58:18,615 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:58:18,615 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:58:18,615 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:58:18,615 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:58:18,615 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:58:18,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 451 places, 272 transitions, 8821 flow [2021-06-10 23:58:18,745 INFO L129 PetriNetUnfolder]: 0/539 cut-off events. [2021-06-10 23:58:18,745 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:58:18,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4812 conditions, 539 events. 0/539 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2051 event pairs, 0 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 0. Up to 90 conditions per place. [2021-06-10 23:58:18,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 451 places, 272 transitions, 8821 flow [2021-06-10 23:58:18,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 270 transitions, 8817 flow [2021-06-10 23:58:18,749 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:58:18,749 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 449 places, 270 transitions, 8817 flow [2021-06-10 23:58:18,749 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 449 places, 270 transitions, 8817 flow [2021-06-10 23:58:18,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 449 places, 270 transitions, 8817 flow [2021-06-10 23:58:18,853 INFO L129 PetriNetUnfolder]: 0/359 cut-off events. [2021-06-10 23:58:18,853 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:58:18,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4632 conditions, 359 events. 0/359 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1034 event pairs, 0 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 0. Up to 90 conditions per place. [2021-06-10 23:58:18,896 INFO L151 LiptonReduction]: Number of co-enabled transitions 47704 [2021-06-10 23:58:49,582 INFO L163 LiptonReduction]: Checked pairs total: 19758 [2021-06-10 23:58:49,582 INFO L165 LiptonReduction]: Total number of compositions: 89 [2021-06-10 23:58:49,582 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30833 [2021-06-10 23:58:49,583 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:58:49,583 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:58:49,583 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:58:49,583 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:58:49,583 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:58:49,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:58:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash 525091, now seen corresponding path program 1 times [2021-06-10 23:58:49,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:58:49,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100028269] [2021-06-10 23:58:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:58:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:58:49,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:58:49,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:58:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:58:49,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100028269] [2021-06-10 23:58:49,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:58:49,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:58:49,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016757386] [2021-06-10 23:58:49,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:58:49,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:58:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:58:49,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:58:49,615 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 361 [2021-06-10 23:58:49,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 181 transitions, 8639 flow. Second operand has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:58:49,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:58:49,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 361 [2021-06-10 23:58:49,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:58:49,685 INFO L129 PetriNetUnfolder]: 0/180 cut-off events. [2021-06-10 23:58:49,685 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:58:49,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4455 conditions, 180 events. 0/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 179 event pairs, 0 based on Foata normal form. 90/270 useless extension candidates. Maximal degree in co-relation 0. Up to 90 conditions per place. [2021-06-10 23:58:49,686 INFO L132 encePairwiseOnDemand]: 359/361 looper letters, 0 selfloop transitions, 1 changer transitions 0/180 dead transitions. [2021-06-10 23:58:49,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 180 transitions, 8639 flow [2021-06-10 23:58:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:58:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:58:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1076 transitions. [2021-06-10 23:58:49,686 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9935364727608494 [2021-06-10 23:58:49,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1076 transitions. [2021-06-10 23:58:49,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1076 transitions. [2021-06-10 23:58:49,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:58:49,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1076 transitions. [2021-06-10 23:58:49,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:58:49,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:58:49,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:58:49,688 INFO L185 Difference]: Start difference. First operand has 360 places, 181 transitions, 8639 flow. Second operand 3 states and 1076 transitions. [2021-06-10 23:58:49,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 180 transitions, 8639 flow [2021-06-10 23:58:49,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 180 transitions, 807 flow, removed 3916 selfloop flow, removed 0 redundant places. [2021-06-10 23:58:49,992 INFO L241 Difference]: Finished difference. Result has 361 places, 180 transitions, 807 flow [2021-06-10 23:58:49,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=807, PETRI_PLACES=361, PETRI_TRANSITIONS=180} [2021-06-10 23:58:49,992 INFO L343 CegarLoopForPetriNet]: 360 programPoint places, 1 predicate places. [2021-06-10 23:58:49,992 INFO L480 AbstractCegarLoop]: Abstraction has has 361 places, 180 transitions, 807 flow [2021-06-10 23:58:49,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:58:49,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:58:49,992 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:58:49,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-06-10 23:58:49,992 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:58:49,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:58:49,993 INFO L82 PathProgramCache]: Analyzing trace with hash -53025395, now seen corresponding path program 1 times [2021-06-10 23:58:49,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:58:49,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594187726] [2021-06-10 23:58:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:58:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:58:50,014 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:58:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:58:50,016 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:58:50,031 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:58:50,032 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:58:50,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2021-06-10 23:58:50,032 WARN L342 ceAbstractionStarter]: 89 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:58:50,033 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 90 thread instances. [2021-06-10 23:58:50,175 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:58:50,175 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:58:50,176 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:58:50,176 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:58:50,176 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:58:50,176 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:58:50,176 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:58:50,176 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:58:50,176 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:58:50,176 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:58:50,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 456 places, 275 transitions, 9010 flow [2021-06-10 23:58:50,412 INFO L129 PetriNetUnfolder]: 0/545 cut-off events. [2021-06-10 23:58:50,412 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:58:50,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4911 conditions, 545 events. 0/545 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2084 event pairs, 0 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 0. Up to 91 conditions per place. [2021-06-10 23:58:50,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 275 transitions, 9010 flow [2021-06-10 23:58:50,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 454 places, 273 transitions, 9006 flow [2021-06-10 23:58:50,415 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:58:50,415 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 454 places, 273 transitions, 9006 flow [2021-06-10 23:58:50,416 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 454 places, 273 transitions, 9006 flow [2021-06-10 23:58:50,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 454 places, 273 transitions, 9006 flow [2021-06-10 23:58:50,521 INFO L129 PetriNetUnfolder]: 0/363 cut-off events. [2021-06-10 23:58:50,521 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:58:50,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4729 conditions, 363 events. 0/363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1007 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 0. Up to 91 conditions per place. [2021-06-10 23:58:50,565 INFO L151 LiptonReduction]: Number of co-enabled transitions 48780 [2021-06-10 23:59:22,944 INFO L163 LiptonReduction]: Checked pairs total: 20205 [2021-06-10 23:59:22,944 INFO L165 LiptonReduction]: Total number of compositions: 90 [2021-06-10 23:59:22,944 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32529 [2021-06-10 23:59:22,945 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 23:59:22,945 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:59:22,945 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:59:22,945 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:59:22,945 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:59:22,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:59:22,945 INFO L82 PathProgramCache]: Analyzing trace with hash 536739, now seen corresponding path program 1 times [2021-06-10 23:59:22,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:59:22,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817061943] [2021-06-10 23:59:22,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:59:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:59:22,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:59:22,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:59:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:59:22,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817061943] [2021-06-10 23:59:22,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:59:22,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:59:22,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454184108] [2021-06-10 23:59:22,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:59:22,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:59:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:59:22,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:59:22,975 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 365 [2021-06-10 23:59:22,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 183 transitions, 8826 flow. Second operand has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:59:22,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:59:22,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 365 [2021-06-10 23:59:22,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:59:23,045 INFO L129 PetriNetUnfolder]: 0/182 cut-off events. [2021-06-10 23:59:23,046 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:59:23,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4550 conditions, 182 events. 0/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 156 event pairs, 0 based on Foata normal form. 91/273 useless extension candidates. Maximal degree in co-relation 0. Up to 91 conditions per place. [2021-06-10 23:59:23,046 INFO L132 encePairwiseOnDemand]: 363/365 looper letters, 0 selfloop transitions, 1 changer transitions 0/182 dead transitions. [2021-06-10 23:59:23,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 182 transitions, 8826 flow [2021-06-10 23:59:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:59:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:59:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2021-06-10 23:59:23,047 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.993607305936073 [2021-06-10 23:59:23,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1088 transitions. [2021-06-10 23:59:23,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1088 transitions. [2021-06-10 23:59:23,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:59:23,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1088 transitions. [2021-06-10 23:59:23,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:59:23,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:59:23,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:59:23,049 INFO L185 Difference]: Start difference. First operand has 364 places, 183 transitions, 8826 flow. Second operand 3 states and 1088 transitions. [2021-06-10 23:59:23,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 182 transitions, 8826 flow [2021-06-10 23:59:23,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 182 transitions, 816 flow, removed 4005 selfloop flow, removed 0 redundant places. [2021-06-10 23:59:23,364 INFO L241 Difference]: Finished difference. Result has 365 places, 182 transitions, 816 flow [2021-06-10 23:59:23,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=365, PETRI_TRANSITIONS=182} [2021-06-10 23:59:23,364 INFO L343 CegarLoopForPetriNet]: 364 programPoint places, 1 predicate places. [2021-06-10 23:59:23,364 INFO L480 AbstractCegarLoop]: Abstraction has has 365 places, 182 transitions, 816 flow [2021-06-10 23:59:23,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:59:23,364 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:59:23,364 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:59:23,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2021-06-10 23:59:23,364 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:59:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:59:23,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1850711697, now seen corresponding path program 1 times [2021-06-10 23:59:23,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:59:23,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258637996] [2021-06-10 23:59:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:59:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:59:23,384 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:59:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:59:23,386 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:59:23,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:59:23,402 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:59:23,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2021-06-10 23:59:23,402 WARN L342 ceAbstractionStarter]: 90 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:59:23,402 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 91 thread instances. [2021-06-10 23:59:23,541 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:59:23,541 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:59:23,542 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:59:23,542 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:59:23,542 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:59:23,542 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:59:23,542 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:59:23,542 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:59:23,542 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:59:23,542 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:59:23,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 461 places, 278 transitions, 9201 flow [2021-06-10 23:59:23,677 INFO L129 PetriNetUnfolder]: 0/551 cut-off events. [2021-06-10 23:59:23,677 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:59:23,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5011 conditions, 551 events. 0/551 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1985 event pairs, 0 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 0. Up to 92 conditions per place. [2021-06-10 23:59:23,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 461 places, 278 transitions, 9201 flow [2021-06-10 23:59:23,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 459 places, 276 transitions, 9197 flow [2021-06-10 23:59:23,681 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:59:23,681 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 459 places, 276 transitions, 9197 flow [2021-06-10 23:59:23,681 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 459 places, 276 transitions, 9197 flow [2021-06-10 23:59:23,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 459 places, 276 transitions, 9197 flow [2021-06-10 23:59:23,796 INFO L129 PetriNetUnfolder]: 0/367 cut-off events. [2021-06-10 23:59:23,796 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:59:23,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4827 conditions, 367 events. 0/367 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 979 event pairs, 0 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 0. Up to 92 conditions per place. [2021-06-10 23:59:23,842 INFO L151 LiptonReduction]: Number of co-enabled transitions 49868 [2021-06-10 23:59:58,080 INFO L163 LiptonReduction]: Checked pairs total: 20657 [2021-06-10 23:59:58,080 INFO L165 LiptonReduction]: Total number of compositions: 91 [2021-06-10 23:59:58,080 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34399 [2021-06-10 23:59:58,081 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-10 23:59:58,081 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:59:58,081 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:59:58,081 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-10 23:59:58,081 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:59:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:59:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash 548515, now seen corresponding path program 1 times [2021-06-10 23:59:58,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:59:58,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327665468] [2021-06-10 23:59:58,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:59:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 23:59:58,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 23:59:58,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 23:59:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 23:59:58,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327665468] [2021-06-10 23:59:58,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 23:59:58,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 23:59:58,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836947205] [2021-06-10 23:59:58,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 23:59:58,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 23:59:58,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 23:59:58,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 23:59:58,112 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 369 [2021-06-10 23:59:58,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 185 transitions, 9015 flow. Second operand has 3 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:59:58,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 23:59:58,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 369 [2021-06-10 23:59:58,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 23:59:58,184 INFO L129 PetriNetUnfolder]: 0/184 cut-off events. [2021-06-10 23:59:58,184 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:59:58,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4646 conditions, 184 events. 0/184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 189 event pairs, 0 based on Foata normal form. 92/276 useless extension candidates. Maximal degree in co-relation 0. Up to 92 conditions per place. [2021-06-10 23:59:58,185 INFO L132 encePairwiseOnDemand]: 367/369 looper letters, 0 selfloop transitions, 1 changer transitions 0/184 dead transitions. [2021-06-10 23:59:58,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 184 transitions, 9015 flow [2021-06-10 23:59:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 23:59:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 23:59:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2021-06-10 23:59:58,186 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.993676603432701 [2021-06-10 23:59:58,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1100 transitions. [2021-06-10 23:59:58,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1100 transitions. [2021-06-10 23:59:58,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 23:59:58,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1100 transitions. [2021-06-10 23:59:58,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:59:58,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:59:58,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:59:58,187 INFO L185 Difference]: Start difference. First operand has 368 places, 185 transitions, 9015 flow. Second operand 3 states and 1100 transitions. [2021-06-10 23:59:58,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 184 transitions, 9015 flow [2021-06-10 23:59:58,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 184 transitions, 825 flow, removed 4095 selfloop flow, removed 0 redundant places. [2021-06-10 23:59:58,517 INFO L241 Difference]: Finished difference. Result has 369 places, 184 transitions, 825 flow [2021-06-10 23:59:58,517 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=369, PETRI_TRANSITIONS=184} [2021-06-10 23:59:58,518 INFO L343 CegarLoopForPetriNet]: 368 programPoint places, 1 predicate places. [2021-06-10 23:59:58,518 INFO L480 AbstractCegarLoop]: Abstraction has has 369 places, 184 transitions, 825 flow [2021-06-10 23:59:58,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 23:59:58,518 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 23:59:58,518 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 23:59:58,518 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2021-06-10 23:59:58,518 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-10 23:59:58,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 23:59:58,518 INFO L82 PathProgramCache]: Analyzing trace with hash 815608456, now seen corresponding path program 1 times [2021-06-10 23:59:58,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 23:59:58,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951681284] [2021-06-10 23:59:58,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 23:59:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:59:58,539 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:59:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 23:59:58,540 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 23:59:58,556 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 23:59:58,556 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 23:59:58,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-06-10 23:59:58,557 WARN L342 ceAbstractionStarter]: 91 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-10 23:59:58,557 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 92 thread instances. [2021-06-10 23:59:58,723 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 23:59:58,723 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-10 23:59:58,723 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 23:59:58,723 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 23:59:58,723 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 23:59:58,723 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 23:59:58,723 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 23:59:58,723 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 23:59:58,723 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 23:59:58,724 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 23:59:58,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 466 places, 281 transitions, 9394 flow [2021-06-10 23:59:58,973 INFO L129 PetriNetUnfolder]: 0/557 cut-off events. [2021-06-10 23:59:58,973 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:59:58,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5112 conditions, 557 events. 0/557 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2112 event pairs, 0 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 0. Up to 93 conditions per place. [2021-06-10 23:59:58,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 466 places, 281 transitions, 9394 flow [2021-06-10 23:59:58,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 464 places, 279 transitions, 9390 flow [2021-06-10 23:59:58,980 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 23:59:58,981 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 464 places, 279 transitions, 9390 flow [2021-06-10 23:59:58,981 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 464 places, 279 transitions, 9390 flow [2021-06-10 23:59:58,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 464 places, 279 transitions, 9390 flow [2021-06-10 23:59:59,092 INFO L129 PetriNetUnfolder]: 0/371 cut-off events. [2021-06-10 23:59:59,092 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 23:59:59,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4926 conditions, 371 events. 0/371 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1140 event pairs, 0 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 0. Up to 93 conditions per place. [2021-06-10 23:59:59,138 INFO L151 LiptonReduction]: Number of co-enabled transitions 50968 [2021-06-11 00:00:40,011 INFO L163 LiptonReduction]: Checked pairs total: 21114 [2021-06-11 00:00:40,012 INFO L165 LiptonReduction]: Total number of compositions: 92 [2021-06-11 00:00:40,012 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41032 [2021-06-11 00:00:40,013 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-11 00:00:40,013 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:00:40,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 00:00:40,013 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-11 00:00:40,013 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 00:00:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 00:00:40,014 INFO L82 PathProgramCache]: Analyzing trace with hash 560419, now seen corresponding path program 1 times [2021-06-11 00:00:40,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 00:00:40,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535680994] [2021-06-11 00:00:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 00:00:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 00:00:40,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 00:00:40,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 00:00:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 00:00:40,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535680994] [2021-06-11 00:00:40,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 00:00:40,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 00:00:40,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597246825] [2021-06-11 00:00:40,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 00:00:40,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 00:00:40,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 00:00:40,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 00:00:40,046 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 373 [2021-06-11 00:00:40,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 187 transitions, 9206 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:00:40,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 00:00:40,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 373 [2021-06-11 00:00:40,046 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 00:00:40,126 INFO L129 PetriNetUnfolder]: 0/186 cut-off events. [2021-06-11 00:00:40,126 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:00:40,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 186 events. 0/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 228 event pairs, 0 based on Foata normal form. 93/279 useless extension candidates. Maximal degree in co-relation 0. Up to 93 conditions per place. [2021-06-11 00:00:40,127 INFO L132 encePairwiseOnDemand]: 371/373 looper letters, 0 selfloop transitions, 1 changer transitions 0/186 dead transitions. [2021-06-11 00:00:40,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 186 transitions, 9206 flow [2021-06-11 00:00:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 00:00:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 00:00:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1112 transitions. [2021-06-11 00:00:40,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9937444146559428 [2021-06-11 00:00:40,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1112 transitions. [2021-06-11 00:00:40,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1112 transitions. [2021-06-11 00:00:40,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 00:00:40,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1112 transitions. [2021-06-11 00:00:40,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:00:40,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 373.0) internal successors, (1492), 4 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:00:40,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 373.0) internal successors, (1492), 4 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:00:40,129 INFO L185 Difference]: Start difference. First operand has 372 places, 187 transitions, 9206 flow. Second operand 3 states and 1112 transitions. [2021-06-11 00:00:40,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 186 transitions, 9206 flow [2021-06-11 00:00:40,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 186 transitions, 834 flow, removed 4186 selfloop flow, removed 0 redundant places. [2021-06-11 00:00:40,495 INFO L241 Difference]: Finished difference. Result has 373 places, 186 transitions, 834 flow [2021-06-11 00:00:40,496 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=373, PETRI_TRANSITIONS=186} [2021-06-11 00:00:40,496 INFO L343 CegarLoopForPetriNet]: 372 programPoint places, 1 predicate places. [2021-06-11 00:00:40,496 INFO L480 AbstractCegarLoop]: Abstraction has has 373 places, 186 transitions, 834 flow [2021-06-11 00:00:40,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:00:40,496 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 00:00:40,496 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 00:00:40,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2021-06-11 00:00:40,496 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 00:00:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 00:00:40,496 INFO L82 PathProgramCache]: Analyzing trace with hash 680422194, now seen corresponding path program 1 times [2021-06-11 00:00:40,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 00:00:40,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310813265] [2021-06-11 00:00:40,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 00:00:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 00:00:40,517 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 00:00:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 00:00:40,519 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 00:00:40,538 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 00:00:40,538 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 00:00:40,538 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2021-06-11 00:00:40,538 WARN L342 ceAbstractionStarter]: 92 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-11 00:00:40,539 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 93 thread instances. [2021-06-11 00:00:40,712 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 00:00:40,713 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-11 00:00:40,713 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 00:00:40,713 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 00:00:40,713 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 00:00:40,713 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 00:00:40,713 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 00:00:40,713 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 00:00:40,713 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 00:00:40,713 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 00:00:40,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 471 places, 284 transitions, 9589 flow [2021-06-11 00:00:40,859 INFO L129 PetriNetUnfolder]: 0/563 cut-off events. [2021-06-11 00:00:40,859 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:00:40,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5214 conditions, 563 events. 0/563 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2093 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 0. Up to 94 conditions per place. [2021-06-11 00:00:40,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 471 places, 284 transitions, 9589 flow [2021-06-11 00:00:40,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 469 places, 282 transitions, 9585 flow [2021-06-11 00:00:40,863 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 00:00:40,863 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 469 places, 282 transitions, 9585 flow [2021-06-11 00:00:40,863 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 469 places, 282 transitions, 9585 flow [2021-06-11 00:00:40,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 469 places, 282 transitions, 9585 flow [2021-06-11 00:00:40,980 INFO L129 PetriNetUnfolder]: 0/375 cut-off events. [2021-06-11 00:00:40,981 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:00:40,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 375 events. 0/375 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1039 event pairs, 0 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 0. Up to 94 conditions per place. [2021-06-11 00:00:41,029 INFO L151 LiptonReduction]: Number of co-enabled transitions 52080 [2021-06-11 00:01:23,089 INFO L163 LiptonReduction]: Checked pairs total: 21576 [2021-06-11 00:01:23,090 INFO L165 LiptonReduction]: Total number of compositions: 93 [2021-06-11 00:01:23,090 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42227 [2021-06-11 00:01:23,091 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-11 00:01:23,091 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:01:23,091 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 00:01:23,091 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-11 00:01:23,091 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 00:01:23,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 00:01:23,091 INFO L82 PathProgramCache]: Analyzing trace with hash 572451, now seen corresponding path program 1 times [2021-06-11 00:01:23,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 00:01:23,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893604374] [2021-06-11 00:01:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 00:01:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 00:01:23,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 00:01:23,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 00:01:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 00:01:23,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893604374] [2021-06-11 00:01:23,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 00:01:23,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 00:01:23,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168906105] [2021-06-11 00:01:23,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 00:01:23,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 00:01:23,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 00:01:23,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 00:01:23,125 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 377 [2021-06-11 00:01:23,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 189 transitions, 9399 flow. Second operand has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:01:23,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 00:01:23,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 377 [2021-06-11 00:01:23,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 00:01:23,202 INFO L129 PetriNetUnfolder]: 0/188 cut-off events. [2021-06-11 00:01:23,202 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:01:23,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4841 conditions, 188 events. 0/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 205 event pairs, 0 based on Foata normal form. 94/282 useless extension candidates. Maximal degree in co-relation 0. Up to 94 conditions per place. [2021-06-11 00:01:23,203 INFO L132 encePairwiseOnDemand]: 375/377 looper letters, 0 selfloop transitions, 1 changer transitions 0/188 dead transitions. [2021-06-11 00:01:23,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 188 transitions, 9399 flow [2021-06-11 00:01:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 00:01:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 00:01:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1124 transitions. [2021-06-11 00:01:23,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9938107869142352 [2021-06-11 00:01:23,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1124 transitions. [2021-06-11 00:01:23,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1124 transitions. [2021-06-11 00:01:23,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 00:01:23,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1124 transitions. [2021-06-11 00:01:23,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:01:23,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:01:23,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:01:23,206 INFO L185 Difference]: Start difference. First operand has 376 places, 189 transitions, 9399 flow. Second operand 3 states and 1124 transitions. [2021-06-11 00:01:23,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 188 transitions, 9399 flow [2021-06-11 00:01:23,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 188 transitions, 843 flow, removed 4278 selfloop flow, removed 0 redundant places. [2021-06-11 00:01:23,571 INFO L241 Difference]: Finished difference. Result has 377 places, 188 transitions, 843 flow [2021-06-11 00:01:23,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=843, PETRI_PLACES=377, PETRI_TRANSITIONS=188} [2021-06-11 00:01:23,571 INFO L343 CegarLoopForPetriNet]: 376 programPoint places, 1 predicate places. [2021-06-11 00:01:23,571 INFO L480 AbstractCegarLoop]: Abstraction has has 377 places, 188 transitions, 843 flow [2021-06-11 00:01:23,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:01:23,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 00:01:23,571 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 00:01:23,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2021-06-11 00:01:23,571 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 00:01:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 00:01:23,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1058408339, now seen corresponding path program 1 times [2021-06-11 00:01:23,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 00:01:23,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132898320] [2021-06-11 00:01:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 00:01:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 00:01:23,593 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 00:01:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 00:01:23,594 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 00:01:23,611 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 00:01:23,612 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 00:01:23,612 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-06-11 00:01:23,612 WARN L342 ceAbstractionStarter]: 93 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-11 00:01:23,612 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 94 thread instances. [2021-06-11 00:01:23,793 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 00:01:23,793 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-11 00:01:23,794 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 00:01:23,794 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 00:01:23,794 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 00:01:23,794 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 00:01:23,794 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 00:01:23,794 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 00:01:23,794 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 00:01:23,794 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 00:01:23,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 476 places, 287 transitions, 9786 flow [2021-06-11 00:01:23,944 INFO L129 PetriNetUnfolder]: 0/569 cut-off events. [2021-06-11 00:01:23,944 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:01:23,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5317 conditions, 569 events. 0/569 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2098 event pairs, 0 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 0. Up to 95 conditions per place. [2021-06-11 00:01:23,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 476 places, 287 transitions, 9786 flow [2021-06-11 00:01:23,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 474 places, 285 transitions, 9782 flow [2021-06-11 00:01:23,948 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 00:01:23,948 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 474 places, 285 transitions, 9782 flow [2021-06-11 00:01:23,948 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 474 places, 285 transitions, 9782 flow [2021-06-11 00:01:23,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 474 places, 285 transitions, 9782 flow [2021-06-11 00:01:24,070 INFO L129 PetriNetUnfolder]: 0/379 cut-off events. [2021-06-11 00:01:24,070 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:01:24,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5127 conditions, 379 events. 0/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1177 event pairs, 0 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 0. Up to 95 conditions per place. [2021-06-11 00:01:24,120 INFO L151 LiptonReduction]: Number of co-enabled transitions 53204 [2021-06-11 00:02:08,059 INFO L163 LiptonReduction]: Checked pairs total: 22043 [2021-06-11 00:02:08,059 INFO L165 LiptonReduction]: Total number of compositions: 94 [2021-06-11 00:02:08,059 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44111 [2021-06-11 00:02:08,060 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-11 00:02:08,060 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:02:08,060 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 00:02:08,060 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-11 00:02:08,060 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 00:02:08,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 00:02:08,060 INFO L82 PathProgramCache]: Analyzing trace with hash 584611, now seen corresponding path program 1 times [2021-06-11 00:02:08,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 00:02:08,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758674178] [2021-06-11 00:02:08,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 00:02:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 00:02:08,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 00:02:08,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 00:02:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 00:02:08,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758674178] [2021-06-11 00:02:08,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 00:02:08,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 00:02:08,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528836743] [2021-06-11 00:02:08,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 00:02:08,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 00:02:08,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 00:02:08,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 00:02:08,094 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 381 [2021-06-11 00:02:08,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 191 transitions, 9594 flow. Second operand has 3 states, 3 states have (on average 378.6666666666667) internal successors, (1136), 3 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:02:08,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 00:02:08,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 381 [2021-06-11 00:02:08,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 00:02:08,173 INFO L129 PetriNetUnfolder]: 0/190 cut-off events. [2021-06-11 00:02:08,173 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:02:08,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4940 conditions, 190 events. 0/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 198 event pairs, 0 based on Foata normal form. 95/285 useless extension candidates. Maximal degree in co-relation 0. Up to 95 conditions per place. [2021-06-11 00:02:08,174 INFO L132 encePairwiseOnDemand]: 379/381 looper letters, 0 selfloop transitions, 1 changer transitions 0/190 dead transitions. [2021-06-11 00:02:08,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 190 transitions, 9594 flow [2021-06-11 00:02:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 00:02:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 00:02:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2021-06-11 00:02:08,175 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9938757655293088 [2021-06-11 00:02:08,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1136 transitions. [2021-06-11 00:02:08,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1136 transitions. [2021-06-11 00:02:08,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 00:02:08,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1136 transitions. [2021-06-11 00:02:08,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 378.6666666666667) internal successors, (1136), 3 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:02:08,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:02:08,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:02:08,177 INFO L185 Difference]: Start difference. First operand has 380 places, 191 transitions, 9594 flow. Second operand 3 states and 1136 transitions. [2021-06-11 00:02:08,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 190 transitions, 9594 flow [2021-06-11 00:02:08,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 190 transitions, 852 flow, removed 4371 selfloop flow, removed 0 redundant places. [2021-06-11 00:02:08,546 INFO L241 Difference]: Finished difference. Result has 381 places, 190 transitions, 852 flow [2021-06-11 00:02:08,546 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=381, PETRI_TRANSITIONS=190} [2021-06-11 00:02:08,546 INFO L343 CegarLoopForPetriNet]: 380 programPoint places, 1 predicate places. [2021-06-11 00:02:08,546 INFO L480 AbstractCegarLoop]: Abstraction has has 381 places, 190 transitions, 852 flow [2021-06-11 00:02:08,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 378.6666666666667) internal successors, (1136), 3 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:02:08,546 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 00:02:08,546 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 00:02:08,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2021-06-11 00:02:08,547 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 00:02:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 00:02:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1970217205, now seen corresponding path program 1 times [2021-06-11 00:02:08,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 00:02:08,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419891802] [2021-06-11 00:02:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 00:02:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 00:02:08,568 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 00:02:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 00:02:08,570 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 00:02:08,587 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 00:02:08,587 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 00:02:08,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2021-06-11 00:02:08,587 WARN L342 ceAbstractionStarter]: 94 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-11 00:02:08,587 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 95 thread instances. [2021-06-11 00:02:08,772 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 00:02:08,772 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-11 00:02:08,772 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 00:02:08,772 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 00:02:08,772 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 00:02:08,773 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 00:02:08,773 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 00:02:08,773 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 00:02:08,773 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 00:02:08,773 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 00:02:08,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 481 places, 290 transitions, 9985 flow [2021-06-11 00:02:08,925 INFO L129 PetriNetUnfolder]: 0/575 cut-off events. [2021-06-11 00:02:08,925 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:02:08,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5421 conditions, 575 events. 0/575 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2089 event pairs, 0 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 0. Up to 96 conditions per place. [2021-06-11 00:02:08,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 481 places, 290 transitions, 9985 flow [2021-06-11 00:02:08,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 479 places, 288 transitions, 9981 flow [2021-06-11 00:02:08,929 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 00:02:08,929 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 479 places, 288 transitions, 9981 flow [2021-06-11 00:02:08,929 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 479 places, 288 transitions, 9981 flow [2021-06-11 00:02:08,931 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 479 places, 288 transitions, 9981 flow [2021-06-11 00:02:09,052 INFO L129 PetriNetUnfolder]: 0/383 cut-off events. [2021-06-11 00:02:09,052 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:02:09,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5229 conditions, 383 events. 0/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1077 event pairs, 0 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 0. Up to 96 conditions per place. [2021-06-11 00:02:09,205 INFO L151 LiptonReduction]: Number of co-enabled transitions 54340 [2021-06-11 00:02:54,165 INFO L163 LiptonReduction]: Checked pairs total: 22515 [2021-06-11 00:02:54,165 INFO L165 LiptonReduction]: Total number of compositions: 95 [2021-06-11 00:02:54,165 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45236 [2021-06-11 00:02:54,166 INFO L129 PetriNetUnfolder]: 0/1 cut-off events. [2021-06-11 00:02:54,166 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:02:54,166 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 00:02:54,166 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1] [2021-06-11 00:02:54,166 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 00:02:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 00:02:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash 596899, now seen corresponding path program 1 times [2021-06-11 00:02:54,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 00:02:54,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128899548] [2021-06-11 00:02:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 00:02:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 00:02:54,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 00:02:54,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 00:02:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 00:02:54,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128899548] [2021-06-11 00:02:54,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 00:02:54,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 00:02:54,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756521519] [2021-06-11 00:02:54,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 00:02:54,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 00:02:54,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 00:02:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 00:02:54,207 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 385 [2021-06-11 00:02:54,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 193 transitions, 9791 flow. Second operand has 3 states, 3 states have (on average 382.6666666666667) internal successors, (1148), 3 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:02:54,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 00:02:54,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 385 [2021-06-11 00:02:54,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 00:02:54,288 INFO L129 PetriNetUnfolder]: 0/192 cut-off events. [2021-06-11 00:02:54,288 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:02:54,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5040 conditions, 192 events. 0/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 185 event pairs, 0 based on Foata normal form. 96/288 useless extension candidates. Maximal degree in co-relation 0. Up to 96 conditions per place. [2021-06-11 00:02:54,289 INFO L132 encePairwiseOnDemand]: 383/385 looper letters, 0 selfloop transitions, 1 changer transitions 0/192 dead transitions. [2021-06-11 00:02:54,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 192 transitions, 9791 flow [2021-06-11 00:02:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 00:02:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 00:02:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1148 transitions. [2021-06-11 00:02:54,290 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9939393939393939 [2021-06-11 00:02:54,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1148 transitions. [2021-06-11 00:02:54,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1148 transitions. [2021-06-11 00:02:54,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 00:02:54,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1148 transitions. [2021-06-11 00:02:54,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 382.6666666666667) internal successors, (1148), 3 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:02:54,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:02:54,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 385.0) internal successors, (1540), 4 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:02:54,292 INFO L185 Difference]: Start difference. First operand has 384 places, 193 transitions, 9791 flow. Second operand 3 states and 1148 transitions. [2021-06-11 00:02:54,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 192 transitions, 9791 flow [2021-06-11 00:02:54,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 192 transitions, 861 flow, removed 4465 selfloop flow, removed 0 redundant places. [2021-06-11 00:02:54,672 INFO L241 Difference]: Finished difference. Result has 385 places, 192 transitions, 861 flow [2021-06-11 00:02:54,672 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=385, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=385, PETRI_TRANSITIONS=192} [2021-06-11 00:02:54,673 INFO L343 CegarLoopForPetriNet]: 384 programPoint places, 1 predicate places. [2021-06-11 00:02:54,673 INFO L480 AbstractCegarLoop]: Abstraction has has 385 places, 192 transitions, 861 flow [2021-06-11 00:02:54,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 382.6666666666667) internal successors, (1148), 3 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 00:02:54,673 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 00:02:54,673 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 00:02:54,673 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-06-11 00:02:54,673 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-11 00:02:54,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 00:02:54,673 INFO L82 PathProgramCache]: Analyzing trace with hash -892477778, now seen corresponding path program 1 times [2021-06-11 00:02:54,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 00:02:54,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638385879] [2021-06-11 00:02:54,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 00:02:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 00:02:54,696 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 00:02:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 00:02:54,697 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 00:02:54,714 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 00:02:54,715 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 00:02:54,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2021-06-11 00:02:54,715 WARN L342 ceAbstractionStarter]: 95 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-11 00:02:54,715 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 96 thread instances. [2021-06-11 00:02:54,907 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 00:02:54,908 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-11 00:02:54,908 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 00:02:54,908 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 00:02:54,908 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 00:02:54,908 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 00:02:54,908 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 00:02:54,908 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 00:02:54,908 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 00:02:54,908 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 00:02:54,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 486 places, 293 transitions, 10186 flow [2021-06-11 00:02:55,064 INFO L129 PetriNetUnfolder]: 0/581 cut-off events. [2021-06-11 00:02:55,064 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:02:55,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5526 conditions, 581 events. 0/581 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2160 event pairs, 0 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 0. Up to 97 conditions per place. [2021-06-11 00:02:55,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 486 places, 293 transitions, 10186 flow [2021-06-11 00:02:55,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 484 places, 291 transitions, 10182 flow [2021-06-11 00:02:55,068 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 00:02:55,068 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 484 places, 291 transitions, 10182 flow [2021-06-11 00:02:55,068 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 484 places, 291 transitions, 10182 flow [2021-06-11 00:02:55,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 484 places, 291 transitions, 10182 flow [2021-06-11 00:02:55,193 INFO L129 PetriNetUnfolder]: 0/387 cut-off events. [2021-06-11 00:02:55,193 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 00:02:55,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 387 events. 0/387 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1030 event pairs, 0 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 0. Up to 97 conditions per place. [2021-06-11 00:02:55,245 INFO L151 LiptonReduction]: Number of co-enabled transitions 55488 Received shutdown request... [2021-06-11 00:03:25,607 WARN L545 AbstractCegarLoop]: Verification canceled [2021-06-11 00:03:25,608 WARN L224 ceAbstractionStarter]: Timeout [2021-06-11 00:03:25,609 INFO L202 PluginConnector]: Adding new model fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 12:03:25 BasicIcfg [2021-06-11 00:03:25,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 00:03:25,609 INFO L168 Benchmark]: Toolchain (without parser) took 804471.22 ms. Allocated memory was 350.2 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 330.6 MB in the beginning and 1.3 GB in the end (delta: -953.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 16.0 GB. [2021-06-11 00:03:25,609 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.09 ms. Allocated memory is still 350.2 MB. Free memory is still 331.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 00:03:25,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.65 ms. Allocated memory is still 350.2 MB. Free memory was 330.5 MB in the beginning and 329.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 00:03:25,610 INFO L168 Benchmark]: Boogie Preprocessor took 12.17 ms. Allocated memory is still 350.2 MB. Free memory was 329.0 MB in the beginning and 328.1 MB in the end (delta: 843.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 00:03:25,610 INFO L168 Benchmark]: RCFGBuilder took 145.77 ms. Allocated memory is still 350.2 MB. Free memory was 328.0 MB in the beginning and 320.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. [2021-06-11 00:03:25,610 INFO L168 Benchmark]: TraceAbstraction took 804238.31 ms. Allocated memory was 350.2 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 319.6 MB in the beginning and 1.3 GB in the end (delta: -964.7 MB). Peak memory consumption was 2.0 GB. Max. memory is 16.0 GB. [2021-06-11 00:03:25,610 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09 ms. Allocated memory is still 350.2 MB. Free memory is still 331.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 52.65 ms. Allocated memory is still 350.2 MB. Free memory was 330.5 MB in the beginning and 329.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 12.17 ms. Allocated memory is still 350.2 MB. Free memory was 329.0 MB in the beginning and 328.1 MB in the end (delta: 843.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 145.77 ms. Allocated memory is still 350.2 MB. Free memory was 328.0 MB in the beginning and 320.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 804238.31 ms. Allocated memory was 350.2 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 319.6 MB in the beginning and 1.3 GB in the end (delta: -964.7 MB). Peak memory consumption was 2.0 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.6ms, 9 PlacesBefore, 8 PlacesAfterwards, 6 TransitionsBefore, 5 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.7ms, 14 PlacesBefore, 12 PlacesAfterwards, 9 TransitionsBefore, 7 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, 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): 11, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.6ms, 19 PlacesBefore, 16 PlacesAfterwards, 12 TransitionsBefore, 9 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 21 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.6ms, 24 PlacesBefore, 20 PlacesAfterwards, 15 TransitionsBefore, 11 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 38 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 38, unknown conditional: 0, unknown unconditional: 38] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.9ms, 29 PlacesBefore, 24 PlacesAfterwards, 18 TransitionsBefore, 13 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 60 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 60, unknown conditional: 0, unknown unconditional: 60] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 145.0ms, 34 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 15 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 87 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 87, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 87, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 87, unknown conditional: 0, unknown unconditional: 87] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 170.3ms, 39 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 17 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 119 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 119, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 119, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 119, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 119, unknown conditional: 0, unknown unconditional: 119] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 161, Positive conditional cache size: 0, Positive unconditional cache size: 161, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 168.1ms, 44 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 19 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 156 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 156, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 156, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 156, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 109, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 156, unknown conditional: 0, unknown unconditional: 156] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 212, Positive conditional cache size: 0, Positive unconditional cache size: 212, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 172.7ms, 49 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 21 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 198, positive: 198, positive conditional: 0, positive unconditional: 198, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, positive: 198, positive conditional: 0, positive unconditional: 198, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 198, positive: 198, positive conditional: 0, positive unconditional: 198, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 198, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 119, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 198, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 198, unknown conditional: 0, unknown unconditional: 198] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 270, Positive conditional cache size: 0, Positive unconditional cache size: 270, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 219.8ms, 54 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 23 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 245 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 245, positive: 245, positive conditional: 0, positive unconditional: 245, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 245, positive: 245, positive conditional: 0, positive unconditional: 245, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 245, positive: 245, positive conditional: 0, positive unconditional: 245, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 245, positive: 155, positive conditional: 0, positive unconditional: 155, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 161, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 245, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 245, unknown conditional: 0, unknown unconditional: 245] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 335, Positive conditional cache size: 0, Positive unconditional cache size: 335, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 205.3ms, 59 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 25 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 297 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 297, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 297, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 297, positive: 187, positive conditional: 0, positive unconditional: 187, negative: 110, negative conditional: 0, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 110, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, positive: 144, positive conditional: 0, positive unconditional: 144, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 297, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 297, unknown conditional: 0, unknown unconditional: 297] , Statistics on independence cache: Total cache size (in pairs): 407, Positive cache size: 407, Positive conditional cache size: 0, Positive unconditional cache size: 407, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 250.5ms, 64 PlacesBefore, 52 PlacesAfterwards, 39 TransitionsBefore, 27 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 354 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 354, positive: 354, positive conditional: 0, positive unconditional: 354, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, positive: 354, positive conditional: 0, positive unconditional: 354, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 354, positive: 354, positive conditional: 0, positive unconditional: 354, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 354, positive: 222, positive conditional: 0, positive unconditional: 222, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 132, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, positive: 189, positive conditional: 0, positive unconditional: 189, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 354, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 354, unknown conditional: 0, unknown unconditional: 354] , Statistics on independence cache: Total cache size (in pairs): 486, Positive cache size: 486, Positive conditional cache size: 0, Positive unconditional cache size: 486, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 283.3ms, 69 PlacesBefore, 56 PlacesAfterwards, 42 TransitionsBefore, 29 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 416 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 416, positive: 416, positive conditional: 0, positive unconditional: 416, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 416, positive: 416, positive conditional: 0, positive unconditional: 416, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 416, positive: 416, positive conditional: 0, positive unconditional: 416, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 416, positive: 260, positive conditional: 0, positive unconditional: 260, negative: 156, negative conditional: 0, negative unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 156, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 209, positive: 209, positive conditional: 0, positive unconditional: 209, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 416, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 416, unknown conditional: 0, unknown unconditional: 416] , Statistics on independence cache: Total cache size (in pairs): 572, Positive cache size: 572, Positive conditional cache size: 0, Positive unconditional cache size: 572, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 382.1ms, 74 PlacesBefore, 60 PlacesAfterwards, 45 TransitionsBefore, 31 TransitionsAfterwards, 1204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 483 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 483, positive: 483, positive conditional: 0, positive unconditional: 483, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 483, positive: 483, positive conditional: 0, positive unconditional: 483, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 483, positive: 483, positive conditional: 0, positive unconditional: 483, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 483, positive: 301, positive conditional: 0, positive unconditional: 301, negative: 182, negative conditional: 0, negative unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 182, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 301, positive: 301, positive conditional: 0, positive unconditional: 301, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 483, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 483, unknown conditional: 0, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 665, Positive cache size: 665, Positive conditional cache size: 0, Positive unconditional cache size: 665, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 428.0ms, 79 PlacesBefore, 64 PlacesAfterwards, 48 TransitionsBefore, 33 TransitionsAfterwards, 1380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 555 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 555, positive: 555, positive conditional: 0, positive unconditional: 555, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 555, positive: 555, positive conditional: 0, positive unconditional: 555, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 555, positive: 555, positive conditional: 0, positive unconditional: 555, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 555, positive: 345, positive conditional: 0, positive unconditional: 345, negative: 210, negative conditional: 0, negative unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 210, positive: 210, positive conditional: 0, positive unconditional: 210, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 343, positive: 343, positive conditional: 0, positive unconditional: 343, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 555, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 555, unknown conditional: 0, unknown unconditional: 555] , Statistics on independence cache: Total cache size (in pairs): 765, Positive cache size: 765, Positive conditional cache size: 0, Positive unconditional cache size: 765, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 403.2ms, 84 PlacesBefore, 68 PlacesAfterwards, 51 TransitionsBefore, 35 TransitionsAfterwards, 1568 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 632 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 632, positive: 632, positive conditional: 0, positive unconditional: 632, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 632, positive: 632, positive conditional: 0, positive unconditional: 632, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 632, positive: 632, positive conditional: 0, positive unconditional: 632, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 632, positive: 392, positive conditional: 0, positive unconditional: 392, negative: 240, negative conditional: 0, negative unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 240, positive: 240, positive conditional: 0, positive unconditional: 240, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 300, positive: 300, positive conditional: 0, positive unconditional: 300, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 632, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 632, unknown conditional: 0, unknown unconditional: 632] , Statistics on independence cache: Total cache size (in pairs): 872, Positive cache size: 872, Positive conditional cache size: 0, Positive unconditional cache size: 872, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 431.0ms, 89 PlacesBefore, 72 PlacesAfterwards, 54 TransitionsBefore, 37 TransitionsAfterwards, 1768 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 714 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 714, positive: 714, positive conditional: 0, positive unconditional: 714, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 714, positive: 714, positive conditional: 0, positive unconditional: 714, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 714, positive: 714, positive conditional: 0, positive unconditional: 714, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 714, positive: 442, positive conditional: 0, positive unconditional: 442, negative: 272, negative conditional: 0, negative unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 272, positive: 272, positive conditional: 0, positive unconditional: 272, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 339, positive: 339, positive conditional: 0, positive unconditional: 339, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 714, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 714, unknown conditional: 0, unknown unconditional: 714] , Statistics on independence cache: Total cache size (in pairs): 986, Positive cache size: 986, Positive conditional cache size: 0, Positive unconditional cache size: 986, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 455.0ms, 94 PlacesBefore, 76 PlacesAfterwards, 57 TransitionsBefore, 39 TransitionsAfterwards, 1980 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, 801 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 801, positive: 801, positive conditional: 0, positive unconditional: 801, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 801, positive: 801, positive conditional: 0, positive unconditional: 801, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 801, positive: 801, positive conditional: 0, positive unconditional: 801, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 801, positive: 495, positive conditional: 0, positive unconditional: 495, negative: 306, negative conditional: 0, negative unconditional: 306, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 306, positive: 306, positive conditional: 0, positive unconditional: 306, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 366, positive: 366, positive conditional: 0, positive unconditional: 366, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 801, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 801, unknown conditional: 0, unknown unconditional: 801] , Statistics on independence cache: Total cache size (in pairs): 1107, Positive cache size: 1107, Positive conditional cache size: 0, Positive unconditional cache size: 1107, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 922.8ms, 99 PlacesBefore, 80 PlacesAfterwards, 60 TransitionsBefore, 41 TransitionsAfterwards, 2204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 19 TotalNumberOfCompositions, 893 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 893, positive: 893, positive conditional: 0, positive unconditional: 893, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 893, positive: 893, positive conditional: 0, positive unconditional: 893, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 893, positive: 893, positive conditional: 0, positive unconditional: 893, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 893, positive: 551, positive conditional: 0, positive unconditional: 551, negative: 342, negative conditional: 0, negative unconditional: 342, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 342, positive: 342, positive conditional: 0, positive unconditional: 342, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 773, positive: 773, positive conditional: 0, positive unconditional: 773, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 893, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 893, unknown conditional: 0, unknown unconditional: 893] , Statistics on independence cache: Total cache size (in pairs): 1235, Positive cache size: 1235, Positive conditional cache size: 0, Positive unconditional cache size: 1235, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 747.8ms, 104 PlacesBefore, 84 PlacesAfterwards, 63 TransitionsBefore, 43 TransitionsAfterwards, 2440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 20 TotalNumberOfCompositions, 990 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 990, positive: 990, positive conditional: 0, positive unconditional: 990, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 990, positive: 990, positive conditional: 0, positive unconditional: 990, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 990, positive: 990, positive conditional: 0, positive unconditional: 990, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 990, positive: 610, positive conditional: 0, positive unconditional: 610, negative: 380, negative conditional: 0, negative unconditional: 380, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 380, positive: 380, positive conditional: 0, positive unconditional: 380, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 570, positive: 570, positive conditional: 0, positive unconditional: 570, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 990, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 990, unknown conditional: 0, unknown unconditional: 990] , Statistics on independence cache: Total cache size (in pairs): 1370, Positive cache size: 1370, Positive conditional cache size: 0, Positive unconditional cache size: 1370, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 656.0ms, 109 PlacesBefore, 88 PlacesAfterwards, 66 TransitionsBefore, 45 TransitionsAfterwards, 2688 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 21 TotalNumberOfCompositions, 1092 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1092, positive: 1092, positive conditional: 0, positive unconditional: 1092, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1092, positive: 1092, positive conditional: 0, positive unconditional: 1092, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1092, positive: 1092, positive conditional: 0, positive unconditional: 1092, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1092, positive: 672, positive conditional: 0, positive unconditional: 672, negative: 420, negative conditional: 0, negative unconditional: 420, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 420, positive: 420, positive conditional: 0, positive unconditional: 420, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 505, positive: 505, positive conditional: 0, positive unconditional: 505, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1092, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1092, unknown conditional: 0, unknown unconditional: 1092] , Statistics on independence cache: Total cache size (in pairs): 1512, Positive cache size: 1512, Positive conditional cache size: 0, Positive unconditional cache size: 1512, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 660.6ms, 114 PlacesBefore, 92 PlacesAfterwards, 69 TransitionsBefore, 47 TransitionsAfterwards, 2948 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 22 TotalNumberOfCompositions, 1199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1199, positive: 1199, positive conditional: 0, positive unconditional: 1199, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1199, positive: 1199, positive conditional: 0, positive unconditional: 1199, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1199, positive: 1199, positive conditional: 0, positive unconditional: 1199, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1199, positive: 737, positive conditional: 0, positive unconditional: 737, negative: 462, negative conditional: 0, negative unconditional: 462, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 462, positive: 462, positive conditional: 0, positive unconditional: 462, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 539, positive: 539, positive conditional: 0, positive unconditional: 539, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1199, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1199, unknown conditional: 0, unknown unconditional: 1199] , Statistics on independence cache: Total cache size (in pairs): 1661, Positive cache size: 1661, Positive conditional cache size: 0, Positive unconditional cache size: 1661, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 760.1ms, 119 PlacesBefore, 96 PlacesAfterwards, 72 TransitionsBefore, 49 TransitionsAfterwards, 3220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 23 TotalNumberOfCompositions, 1311 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1311, positive: 1311, positive conditional: 0, positive unconditional: 1311, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1311, positive: 1311, positive conditional: 0, positive unconditional: 1311, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1311, positive: 1311, positive conditional: 0, positive unconditional: 1311, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1311, positive: 805, positive conditional: 0, positive unconditional: 805, negative: 506, negative conditional: 0, negative unconditional: 506, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 506, positive: 506, positive conditional: 0, positive unconditional: 506, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 614, positive: 614, positive conditional: 0, positive unconditional: 614, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1311, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1311, unknown conditional: 0, unknown unconditional: 1311] , Statistics on independence cache: Total cache size (in pairs): 1817, Positive cache size: 1817, Positive conditional cache size: 0, Positive unconditional cache size: 1817, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 914.4ms, 124 PlacesBefore, 100 PlacesAfterwards, 75 TransitionsBefore, 51 TransitionsAfterwards, 3504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 24 TotalNumberOfCompositions, 1428 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1428, positive: 1428, positive conditional: 0, positive unconditional: 1428, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1428, positive: 1428, positive conditional: 0, positive unconditional: 1428, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1428, positive: 1428, positive conditional: 0, positive unconditional: 1428, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1428, positive: 876, positive conditional: 0, positive unconditional: 876, negative: 552, negative conditional: 0, negative unconditional: 552, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 552, positive: 552, positive conditional: 0, positive unconditional: 552, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 747, positive: 747, positive conditional: 0, positive unconditional: 747, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1428, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1428, unknown conditional: 0, unknown unconditional: 1428] , Statistics on independence cache: Total cache size (in pairs): 1980, Positive cache size: 1980, Positive conditional cache size: 0, Positive unconditional cache size: 1980, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 969.4ms, 129 PlacesBefore, 104 PlacesAfterwards, 78 TransitionsBefore, 53 TransitionsAfterwards, 3800 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 25 TotalNumberOfCompositions, 1550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1550, positive: 1550, positive conditional: 0, positive unconditional: 1550, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1550, positive: 1550, positive conditional: 0, positive unconditional: 1550, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1550, positive: 1550, positive conditional: 0, positive unconditional: 1550, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1550, positive: 950, positive conditional: 0, positive unconditional: 950, negative: 600, negative conditional: 0, negative unconditional: 600, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 600, positive: 600, positive conditional: 0, positive unconditional: 600, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 807, positive: 807, positive conditional: 0, positive unconditional: 807, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1550, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1550, unknown conditional: 0, unknown unconditional: 1550] , Statistics on independence cache: Total cache size (in pairs): 2150, Positive cache size: 2150, Positive conditional cache size: 0, Positive unconditional cache size: 2150, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 999.2ms, 134 PlacesBefore, 108 PlacesAfterwards, 81 TransitionsBefore, 55 TransitionsAfterwards, 4108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 26 TotalNumberOfCompositions, 1677 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1677, positive: 1677, positive conditional: 0, positive unconditional: 1677, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1677, positive: 1677, positive conditional: 0, positive unconditional: 1677, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1677, positive: 1677, positive conditional: 0, positive unconditional: 1677, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1677, positive: 1027, positive conditional: 0, positive unconditional: 1027, negative: 650, negative conditional: 0, negative unconditional: 650, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 650, positive: 650, positive conditional: 0, positive unconditional: 650, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 795, positive: 795, positive conditional: 0, positive unconditional: 795, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1677, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1677, unknown conditional: 0, unknown unconditional: 1677] , Statistics on independence cache: Total cache size (in pairs): 2327, Positive cache size: 2327, Positive conditional cache size: 0, Positive unconditional cache size: 2327, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1038.3ms, 139 PlacesBefore, 112 PlacesAfterwards, 84 TransitionsBefore, 57 TransitionsAfterwards, 4428 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 27 TotalNumberOfCompositions, 1809 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1809, positive: 1809, positive conditional: 0, positive unconditional: 1809, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1809, positive: 1809, positive conditional: 0, positive unconditional: 1809, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1809, positive: 1809, positive conditional: 0, positive unconditional: 1809, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1809, positive: 1107, positive conditional: 0, positive unconditional: 1107, negative: 702, negative conditional: 0, negative unconditional: 702, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 702, positive: 702, positive conditional: 0, positive unconditional: 702, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 862, positive: 862, positive conditional: 0, positive unconditional: 862, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1809, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1809, unknown conditional: 0, unknown unconditional: 1809] , Statistics on independence cache: Total cache size (in pairs): 2511, Positive cache size: 2511, Positive conditional cache size: 0, Positive unconditional cache size: 2511, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1067.6ms, 144 PlacesBefore, 116 PlacesAfterwards, 87 TransitionsBefore, 59 TransitionsAfterwards, 4760 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 28 TotalNumberOfCompositions, 1946 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1946, positive: 1946, positive conditional: 0, positive unconditional: 1946, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1946, positive: 1946, positive conditional: 0, positive unconditional: 1946, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1946, positive: 1946, positive conditional: 0, positive unconditional: 1946, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1946, positive: 1190, positive conditional: 0, positive unconditional: 1190, negative: 756, negative conditional: 0, negative unconditional: 756, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 756, positive: 756, positive conditional: 0, positive unconditional: 756, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 889, positive: 889, positive conditional: 0, positive unconditional: 889, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1946, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1946, unknown conditional: 0, unknown unconditional: 1946] , Statistics on independence cache: Total cache size (in pairs): 2702, Positive cache size: 2702, Positive conditional cache size: 0, Positive unconditional cache size: 2702, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1870.5ms, 149 PlacesBefore, 120 PlacesAfterwards, 90 TransitionsBefore, 61 TransitionsAfterwards, 5104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 29 TotalNumberOfCompositions, 2088 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2088, positive: 2088, positive conditional: 0, positive unconditional: 2088, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2088, positive: 2088, positive conditional: 0, positive unconditional: 2088, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2088, positive: 2088, positive conditional: 0, positive unconditional: 2088, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2088, positive: 1276, positive conditional: 0, positive unconditional: 1276, negative: 812, negative conditional: 0, negative unconditional: 812, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 812, positive: 812, positive conditional: 0, positive unconditional: 812, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1560, positive: 1560, positive conditional: 0, positive unconditional: 1560, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2088, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2088, unknown conditional: 0, unknown unconditional: 2088] , Statistics on independence cache: Total cache size (in pairs): 2900, Positive cache size: 2900, Positive conditional cache size: 0, Positive unconditional cache size: 2900, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1432.9ms, 154 PlacesBefore, 124 PlacesAfterwards, 93 TransitionsBefore, 63 TransitionsAfterwards, 5460 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 30 TotalNumberOfCompositions, 2235 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2235, positive: 2235, positive conditional: 0, positive unconditional: 2235, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2235, positive: 2235, positive conditional: 0, positive unconditional: 2235, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2235, positive: 2235, positive conditional: 0, positive unconditional: 2235, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2235, positive: 1365, positive conditional: 0, positive unconditional: 1365, negative: 870, negative conditional: 0, negative unconditional: 870, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 870, positive: 870, positive conditional: 0, positive unconditional: 870, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1225, positive: 1225, positive conditional: 0, positive unconditional: 1225, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2235, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2235, unknown conditional: 0, unknown unconditional: 2235] , Statistics on independence cache: Total cache size (in pairs): 3105, Positive cache size: 3105, Positive conditional cache size: 0, Positive unconditional cache size: 3105, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1249.1ms, 159 PlacesBefore, 128 PlacesAfterwards, 96 TransitionsBefore, 65 TransitionsAfterwards, 5828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 31 TotalNumberOfCompositions, 2387 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2387, positive: 2387, positive conditional: 0, positive unconditional: 2387, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2387, positive: 2387, positive conditional: 0, positive unconditional: 2387, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2387, positive: 2387, positive conditional: 0, positive unconditional: 2387, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2387, positive: 1457, positive conditional: 0, positive unconditional: 1457, negative: 930, negative conditional: 0, negative unconditional: 930, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 930, positive: 930, positive conditional: 0, positive unconditional: 930, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1085, positive: 1085, positive conditional: 0, positive unconditional: 1085, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2387, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2387, unknown conditional: 0, unknown unconditional: 2387] , Statistics on independence cache: Total cache size (in pairs): 3317, Positive cache size: 3317, Positive conditional cache size: 0, Positive unconditional cache size: 3317, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1418.7ms, 164 PlacesBefore, 132 PlacesAfterwards, 99 TransitionsBefore, 67 TransitionsAfterwards, 6208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 32 TotalNumberOfCompositions, 2544 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2544, positive: 2544, positive conditional: 0, positive unconditional: 2544, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2544, positive: 2544, positive conditional: 0, positive unconditional: 2544, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2544, positive: 2544, positive conditional: 0, positive unconditional: 2544, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2544, positive: 1552, positive conditional: 0, positive unconditional: 1552, negative: 992, negative conditional: 0, negative unconditional: 992, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 992, positive: 992, positive conditional: 0, positive unconditional: 992, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1202, positive: 1202, positive conditional: 0, positive unconditional: 1202, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2544, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2544, unknown conditional: 0, unknown unconditional: 2544] , Statistics on independence cache: Total cache size (in pairs): 3536, Positive cache size: 3536, Positive conditional cache size: 0, Positive unconditional cache size: 3536, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1445.0ms, 169 PlacesBefore, 136 PlacesAfterwards, 102 TransitionsBefore, 69 TransitionsAfterwards, 6600 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 33 TotalNumberOfCompositions, 2706 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2706, positive: 2706, positive conditional: 0, positive unconditional: 2706, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2706, positive: 2706, positive conditional: 0, positive unconditional: 2706, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2706, positive: 2706, positive conditional: 0, positive unconditional: 2706, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2706, positive: 1650, positive conditional: 0, positive unconditional: 1650, negative: 1056, negative conditional: 0, negative unconditional: 1056, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1056, positive: 1056, positive conditional: 0, positive unconditional: 1056, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1230, positive: 1230, positive conditional: 0, positive unconditional: 1230, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2706, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2706, unknown conditional: 0, unknown unconditional: 2706] , Statistics on independence cache: Total cache size (in pairs): 3762, Positive cache size: 3762, Positive conditional cache size: 0, Positive unconditional cache size: 3762, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1577.2ms, 174 PlacesBefore, 140 PlacesAfterwards, 105 TransitionsBefore, 71 TransitionsAfterwards, 7004 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 34 TotalNumberOfCompositions, 2873 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2873, positive: 2873, positive conditional: 0, positive unconditional: 2873, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2873, positive: 2873, positive conditional: 0, positive unconditional: 2873, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2873, positive: 2873, positive conditional: 0, positive unconditional: 2873, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2873, positive: 1751, positive conditional: 0, positive unconditional: 1751, negative: 1122, negative conditional: 0, negative unconditional: 1122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1122, positive: 1122, positive conditional: 0, positive unconditional: 1122, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1380, positive: 1380, positive conditional: 0, positive unconditional: 1380, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2873, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2873, unknown conditional: 0, unknown unconditional: 2873] , Statistics on independence cache: Total cache size (in pairs): 3995, Positive cache size: 3995, Positive conditional cache size: 0, Positive unconditional cache size: 3995, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1641.9ms, 179 PlacesBefore, 144 PlacesAfterwards, 108 TransitionsBefore, 73 TransitionsAfterwards, 7420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 35 TotalNumberOfCompositions, 3045 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3045, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3045, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3045, positive: 3045, positive conditional: 0, positive unconditional: 3045, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3045, positive: 1855, positive conditional: 0, positive unconditional: 1855, negative: 1190, negative conditional: 0, negative unconditional: 1190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1190, positive: 1190, positive conditional: 0, positive unconditional: 1190, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1439, positive: 1439, positive conditional: 0, positive unconditional: 1439, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3045, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3045, unknown conditional: 0, unknown unconditional: 3045] , Statistics on independence cache: Total cache size (in pairs): 4235, Positive cache size: 4235, Positive conditional cache size: 0, Positive unconditional cache size: 4235, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1830.5ms, 184 PlacesBefore, 148 PlacesAfterwards, 111 TransitionsBefore, 75 TransitionsAfterwards, 7848 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 36 TotalNumberOfCompositions, 3222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3222, positive: 3222, positive conditional: 0, positive unconditional: 3222, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3222, positive: 3222, positive conditional: 0, positive unconditional: 3222, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3222, positive: 3222, positive conditional: 0, positive unconditional: 3222, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3222, positive: 1962, positive conditional: 0, positive unconditional: 1962, negative: 1260, negative conditional: 0, negative unconditional: 1260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1260, positive: 1260, positive conditional: 0, positive unconditional: 1260, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1597, positive: 1597, positive conditional: 0, positive unconditional: 1597, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3222, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3222, unknown conditional: 0, unknown unconditional: 3222] , Statistics on independence cache: Total cache size (in pairs): 4482, Positive cache size: 4482, Positive conditional cache size: 0, Positive unconditional cache size: 4482, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1932.5ms, 189 PlacesBefore, 152 PlacesAfterwards, 114 TransitionsBefore, 77 TransitionsAfterwards, 8288 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 37 TotalNumberOfCompositions, 3404 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3404, positive: 3404, positive conditional: 0, positive unconditional: 3404, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3404, positive: 3404, positive conditional: 0, positive unconditional: 3404, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3404, positive: 3404, positive conditional: 0, positive unconditional: 3404, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3404, positive: 2072, positive conditional: 0, positive unconditional: 2072, negative: 1332, negative conditional: 0, negative unconditional: 1332, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1332, positive: 1332, positive conditional: 0, positive unconditional: 1332, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1715, positive: 1715, positive conditional: 0, positive unconditional: 1715, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3404, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3404, unknown conditional: 0, unknown unconditional: 3404] , Statistics on independence cache: Total cache size (in pairs): 4736, Positive cache size: 4736, Positive conditional cache size: 0, Positive unconditional cache size: 4736, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1984.8ms, 194 PlacesBefore, 156 PlacesAfterwards, 117 TransitionsBefore, 79 TransitionsAfterwards, 8740 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 38 TotalNumberOfCompositions, 3591 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3591, positive: 3591, positive conditional: 0, positive unconditional: 3591, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3591, positive: 3591, positive conditional: 0, positive unconditional: 3591, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3591, positive: 3591, positive conditional: 0, positive unconditional: 3591, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3591, positive: 2185, positive conditional: 0, positive unconditional: 2185, negative: 1406, negative conditional: 0, negative unconditional: 1406, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1406, positive: 1406, positive conditional: 0, positive unconditional: 1406, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1743, positive: 1743, positive conditional: 0, positive unconditional: 1743, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3591, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3591, unknown conditional: 0, unknown unconditional: 3591] , Statistics on independence cache: Total cache size (in pairs): 4997, Positive cache size: 4997, Positive conditional cache size: 0, Positive unconditional cache size: 4997, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2057.2ms, 199 PlacesBefore, 160 PlacesAfterwards, 120 TransitionsBefore, 81 TransitionsAfterwards, 9204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 39 TotalNumberOfCompositions, 3783 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3783, positive: 3783, positive conditional: 0, positive unconditional: 3783, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3783, positive: 3783, positive conditional: 0, positive unconditional: 3783, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3783, positive: 3783, positive conditional: 0, positive unconditional: 3783, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3783, positive: 2301, positive conditional: 0, positive unconditional: 2301, negative: 1482, negative conditional: 0, negative unconditional: 1482, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1482, positive: 1482, positive conditional: 0, positive unconditional: 1482, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1824, positive: 1824, positive conditional: 0, positive unconditional: 1824, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3783, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3783, unknown conditional: 0, unknown unconditional: 3783] , Statistics on independence cache: Total cache size (in pairs): 5265, Positive cache size: 5265, Positive conditional cache size: 0, Positive unconditional cache size: 5265, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2324.0ms, 204 PlacesBefore, 164 PlacesAfterwards, 123 TransitionsBefore, 83 TransitionsAfterwards, 9680 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 40 TotalNumberOfCompositions, 3980 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3980, positive: 3980, positive conditional: 0, positive unconditional: 3980, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3980, positive: 3980, positive conditional: 0, positive unconditional: 3980, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3980, positive: 3980, positive conditional: 0, positive unconditional: 3980, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3980, positive: 2420, positive conditional: 0, positive unconditional: 2420, negative: 1560, negative conditional: 0, negative unconditional: 1560, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1560, positive: 1560, positive conditional: 0, positive unconditional: 1560, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2069, positive: 2069, positive conditional: 0, positive unconditional: 2069, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3980, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3980, unknown conditional: 0, unknown unconditional: 3980] , Statistics on independence cache: Total cache size (in pairs): 5540, Positive cache size: 5540, Positive conditional cache size: 0, Positive unconditional cache size: 5540, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2295.9ms, 209 PlacesBefore, 168 PlacesAfterwards, 126 TransitionsBefore, 85 TransitionsAfterwards, 10168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 41 TotalNumberOfCompositions, 4182 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4182, positive: 4182, positive conditional: 0, positive unconditional: 4182, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4182, positive: 4182, positive conditional: 0, positive unconditional: 4182, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4182, positive: 4182, positive conditional: 0, positive unconditional: 4182, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4182, positive: 2542, positive conditional: 0, positive unconditional: 2542, negative: 1640, negative conditional: 0, negative unconditional: 1640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1640, positive: 1640, positive conditional: 0, positive unconditional: 1640, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2020, positive: 2020, positive conditional: 0, positive unconditional: 2020, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4182, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4182, unknown conditional: 0, unknown unconditional: 4182] , Statistics on independence cache: Total cache size (in pairs): 5822, Positive cache size: 5822, Positive conditional cache size: 0, Positive unconditional cache size: 5822, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2472.6ms, 214 PlacesBefore, 172 PlacesAfterwards, 129 TransitionsBefore, 87 TransitionsAfterwards, 10668 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 42 TotalNumberOfCompositions, 4389 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4389, positive: 4389, positive conditional: 0, positive unconditional: 4389, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4389, positive: 4389, positive conditional: 0, positive unconditional: 4389, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4389, positive: 4389, positive conditional: 0, positive unconditional: 4389, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4389, positive: 2667, positive conditional: 0, positive unconditional: 2667, negative: 1722, negative conditional: 0, negative unconditional: 1722, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1722, positive: 1722, positive conditional: 0, positive unconditional: 1722, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2213, positive: 2213, positive conditional: 0, positive unconditional: 2213, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4389, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4389, unknown conditional: 0, unknown unconditional: 4389] , Statistics on independence cache: Total cache size (in pairs): 6111, Positive cache size: 6111, Positive conditional cache size: 0, Positive unconditional cache size: 6111, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2498.7ms, 219 PlacesBefore, 176 PlacesAfterwards, 132 TransitionsBefore, 89 TransitionsAfterwards, 11180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 43 TotalNumberOfCompositions, 4601 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4601, positive: 4601, positive conditional: 0, positive unconditional: 4601, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4601, positive: 4601, positive conditional: 0, positive unconditional: 4601, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4601, positive: 4601, positive conditional: 0, positive unconditional: 4601, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4601, positive: 2795, positive conditional: 0, positive unconditional: 2795, negative: 1806, negative conditional: 0, negative unconditional: 1806, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1806, positive: 1806, positive conditional: 0, positive unconditional: 1806, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2226, positive: 2226, positive conditional: 0, positive unconditional: 2226, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4601, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4601, unknown conditional: 0, unknown unconditional: 4601] , Statistics on independence cache: Total cache size (in pairs): 6407, Positive cache size: 6407, Positive conditional cache size: 0, Positive unconditional cache size: 6407, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2676.7ms, 224 PlacesBefore, 180 PlacesAfterwards, 135 TransitionsBefore, 91 TransitionsAfterwards, 11704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 44 TotalNumberOfCompositions, 4818 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4818, positive: 4818, positive conditional: 0, positive unconditional: 4818, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4818, positive: 4818, positive conditional: 0, positive unconditional: 4818, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4818, positive: 4818, positive conditional: 0, positive unconditional: 4818, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4818, positive: 2926, positive conditional: 0, positive unconditional: 2926, negative: 1892, negative conditional: 0, negative unconditional: 1892, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1892, positive: 1892, positive conditional: 0, positive unconditional: 1892, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2393, positive: 2393, positive conditional: 0, positive unconditional: 2393, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4818, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4818, unknown conditional: 0, unknown unconditional: 4818] , Statistics on independence cache: Total cache size (in pairs): 6710, Positive cache size: 6710, Positive conditional cache size: 0, Positive unconditional cache size: 6710, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2667.9ms, 229 PlacesBefore, 184 PlacesAfterwards, 138 TransitionsBefore, 93 TransitionsAfterwards, 12240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 45 TotalNumberOfCompositions, 5040 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5040, positive: 5040, positive conditional: 0, positive unconditional: 5040, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5040, positive: 5040, positive conditional: 0, positive unconditional: 5040, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5040, positive: 5040, positive conditional: 0, positive unconditional: 5040, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5040, positive: 3060, positive conditional: 0, positive unconditional: 3060, negative: 1980, negative conditional: 0, negative unconditional: 1980, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1980, positive: 1980, positive conditional: 0, positive unconditional: 1980, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2390, positive: 2390, positive conditional: 0, positive unconditional: 2390, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5040, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5040, unknown conditional: 0, unknown unconditional: 5040] , Statistics on independence cache: Total cache size (in pairs): 7020, Positive cache size: 7020, Positive conditional cache size: 0, Positive unconditional cache size: 7020, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2896.6ms, 234 PlacesBefore, 188 PlacesAfterwards, 141 TransitionsBefore, 95 TransitionsAfterwards, 12788 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 46 TotalNumberOfCompositions, 5267 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5267, positive: 5267, positive conditional: 0, positive unconditional: 5267, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5267, positive: 5267, positive conditional: 0, positive unconditional: 5267, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5267, positive: 5267, positive conditional: 0, positive unconditional: 5267, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5267, positive: 3197, positive conditional: 0, positive unconditional: 3197, negative: 2070, negative conditional: 0, negative unconditional: 2070, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2070, positive: 2070, positive conditional: 0, positive unconditional: 2070, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2599, positive: 2599, positive conditional: 0, positive unconditional: 2599, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5267, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5267, unknown conditional: 0, unknown unconditional: 5267] , Statistics on independence cache: Total cache size (in pairs): 7337, Positive cache size: 7337, Positive conditional cache size: 0, Positive unconditional cache size: 7337, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2904.2ms, 239 PlacesBefore, 192 PlacesAfterwards, 144 TransitionsBefore, 97 TransitionsAfterwards, 13348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 47 TotalNumberOfCompositions, 5499 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5499, positive: 5499, positive conditional: 0, positive unconditional: 5499, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5499, positive: 5499, positive conditional: 0, positive unconditional: 5499, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5499, positive: 5499, positive conditional: 0, positive unconditional: 5499, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5499, positive: 3337, positive conditional: 0, positive unconditional: 3337, negative: 2162, negative conditional: 0, negative unconditional: 2162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2162, positive: 2162, positive conditional: 0, positive unconditional: 2162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2611, positive: 2611, positive conditional: 0, positive unconditional: 2611, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5499, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5499, unknown conditional: 0, unknown unconditional: 5499] , Statistics on independence cache: Total cache size (in pairs): 7661, Positive cache size: 7661, Positive conditional cache size: 0, Positive unconditional cache size: 7661, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3040.6ms, 244 PlacesBefore, 196 PlacesAfterwards, 147 TransitionsBefore, 99 TransitionsAfterwards, 13920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 48 TotalNumberOfCompositions, 5736 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5736, positive: 5736, positive conditional: 0, positive unconditional: 5736, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5736, positive: 5736, positive conditional: 0, positive unconditional: 5736, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5736, positive: 5736, positive conditional: 0, positive unconditional: 5736, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5736, positive: 3480, positive conditional: 0, positive unconditional: 3480, negative: 2256, negative conditional: 0, negative unconditional: 2256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2256, positive: 2256, positive conditional: 0, positive unconditional: 2256, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2739, positive: 2739, positive conditional: 0, positive unconditional: 2739, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5736, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5736, unknown conditional: 0, unknown unconditional: 5736] , Statistics on independence cache: Total cache size (in pairs): 7992, Positive cache size: 7992, Positive conditional cache size: 0, Positive unconditional cache size: 7992, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3166.6ms, 249 PlacesBefore, 200 PlacesAfterwards, 150 TransitionsBefore, 101 TransitionsAfterwards, 14504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 49 TotalNumberOfCompositions, 5978 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5978, positive: 5978, positive conditional: 0, positive unconditional: 5978, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5978, positive: 5978, positive conditional: 0, positive unconditional: 5978, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5978, positive: 5978, positive conditional: 0, positive unconditional: 5978, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5978, positive: 3626, positive conditional: 0, positive unconditional: 3626, negative: 2352, negative conditional: 0, negative unconditional: 2352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2352, positive: 2352, positive conditional: 0, positive unconditional: 2352, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2848, positive: 2848, positive conditional: 0, positive unconditional: 2848, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5978, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5978, unknown conditional: 0, unknown unconditional: 5978] , Statistics on independence cache: Total cache size (in pairs): 8330, Positive cache size: 8330, Positive conditional cache size: 0, Positive unconditional cache size: 8330, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3469.8ms, 254 PlacesBefore, 204 PlacesAfterwards, 153 TransitionsBefore, 103 TransitionsAfterwards, 15100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 50 TotalNumberOfCompositions, 6225 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6225, positive: 6225, positive conditional: 0, positive unconditional: 6225, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6225, positive: 6225, positive conditional: 0, positive unconditional: 6225, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6225, positive: 6225, positive conditional: 0, positive unconditional: 6225, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6225, positive: 3775, positive conditional: 0, positive unconditional: 3775, negative: 2450, negative conditional: 0, negative unconditional: 2450, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2450, positive: 2450, positive conditional: 0, positive unconditional: 2450, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3131, positive: 3131, positive conditional: 0, positive unconditional: 3131, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6225, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6225, unknown conditional: 0, unknown unconditional: 6225] , Statistics on independence cache: Total cache size (in pairs): 8675, Positive cache size: 8675, Positive conditional cache size: 0, Positive unconditional cache size: 8675, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3497.7ms, 259 PlacesBefore, 208 PlacesAfterwards, 156 TransitionsBefore, 105 TransitionsAfterwards, 15708 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 51 TotalNumberOfCompositions, 6477 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6477, positive: 6477, positive conditional: 0, positive unconditional: 6477, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6477, positive: 6477, positive conditional: 0, positive unconditional: 6477, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6477, positive: 6477, positive conditional: 0, positive unconditional: 6477, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6477, positive: 3927, positive conditional: 0, positive unconditional: 3927, negative: 2550, negative conditional: 0, negative unconditional: 2550, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2550, positive: 2550, positive conditional: 0, positive unconditional: 2550, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3140, positive: 3140, positive conditional: 0, positive unconditional: 3140, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6477, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6477, unknown conditional: 0, unknown unconditional: 6477] , Statistics on independence cache: Total cache size (in pairs): 9027, Positive cache size: 9027, Positive conditional cache size: 0, Positive unconditional cache size: 9027, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3740.5ms, 264 PlacesBefore, 212 PlacesAfterwards, 159 TransitionsBefore, 107 TransitionsAfterwards, 16328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 52 TotalNumberOfCompositions, 6734 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6734, positive: 6734, positive conditional: 0, positive unconditional: 6734, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6734, positive: 6734, positive conditional: 0, positive unconditional: 6734, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6734, positive: 6734, positive conditional: 0, positive unconditional: 6734, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6734, positive: 4082, positive conditional: 0, positive unconditional: 4082, negative: 2652, negative conditional: 0, negative unconditional: 2652, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2652, positive: 2652, positive conditional: 0, positive unconditional: 2652, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3378, positive: 3378, positive conditional: 0, positive unconditional: 3378, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6734, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6734, unknown conditional: 0, unknown unconditional: 6734] , Statistics on independence cache: Total cache size (in pairs): 9386, Positive cache size: 9386, Positive conditional cache size: 0, Positive unconditional cache size: 9386, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3923.1ms, 269 PlacesBefore, 216 PlacesAfterwards, 162 TransitionsBefore, 109 TransitionsAfterwards, 16960 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 53 TotalNumberOfCompositions, 6996 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6996, positive: 6996, positive conditional: 0, positive unconditional: 6996, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6996, positive: 6996, positive conditional: 0, positive unconditional: 6996, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6996, positive: 6996, positive conditional: 0, positive unconditional: 6996, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6996, positive: 4240, positive conditional: 0, positive unconditional: 4240, negative: 2756, negative conditional: 0, negative unconditional: 2756, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2756, positive: 2756, positive conditional: 0, positive unconditional: 2756, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3529, positive: 3529, positive conditional: 0, positive unconditional: 3529, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6996, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6996, unknown conditional: 0, unknown unconditional: 6996] , Statistics on independence cache: Total cache size (in pairs): 9752, Positive cache size: 9752, Positive conditional cache size: 0, Positive unconditional cache size: 9752, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4063.0ms, 274 PlacesBefore, 220 PlacesAfterwards, 165 TransitionsBefore, 111 TransitionsAfterwards, 17604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 54 TotalNumberOfCompositions, 7263 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7263, positive: 7263, positive conditional: 0, positive unconditional: 7263, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7263, positive: 7263, positive conditional: 0, positive unconditional: 7263, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7263, positive: 7263, positive conditional: 0, positive unconditional: 7263, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7263, positive: 4401, positive conditional: 0, positive unconditional: 4401, negative: 2862, negative conditional: 0, negative unconditional: 2862, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2862, positive: 2862, positive conditional: 0, positive unconditional: 2862, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3688, positive: 3688, positive conditional: 0, positive unconditional: 3688, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7263, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7263, unknown conditional: 0, unknown unconditional: 7263] , Statistics on independence cache: Total cache size (in pairs): 10125, Positive cache size: 10125, Positive conditional cache size: 0, Positive unconditional cache size: 10125, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4280.0ms, 279 PlacesBefore, 224 PlacesAfterwards, 168 TransitionsBefore, 113 TransitionsAfterwards, 18260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 55 TotalNumberOfCompositions, 7535 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7535, positive: 7535, positive conditional: 0, positive unconditional: 7535, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7535, positive: 7535, positive conditional: 0, positive unconditional: 7535, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7535, positive: 7535, positive conditional: 0, positive unconditional: 7535, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7535, positive: 4565, positive conditional: 0, positive unconditional: 4565, negative: 2970, negative conditional: 0, negative unconditional: 2970, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2970, positive: 2970, positive conditional: 0, positive unconditional: 2970, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3891, positive: 3891, positive conditional: 0, positive unconditional: 3891, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7535, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7535, unknown conditional: 0, unknown unconditional: 7535] , Statistics on independence cache: Total cache size (in pairs): 10505, Positive cache size: 10505, Positive conditional cache size: 0, Positive unconditional cache size: 10505, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4357.2ms, 284 PlacesBefore, 228 PlacesAfterwards, 171 TransitionsBefore, 115 TransitionsAfterwards, 18928 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 56 TotalNumberOfCompositions, 7812 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7812, positive: 7812, positive conditional: 0, positive unconditional: 7812, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7812, positive: 7812, positive conditional: 0, positive unconditional: 7812, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7812, positive: 7812, positive conditional: 0, positive unconditional: 7812, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7812, positive: 4732, positive conditional: 0, positive unconditional: 4732, negative: 3080, negative conditional: 0, negative unconditional: 3080, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3080, positive: 3080, positive conditional: 0, positive unconditional: 3080, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3942, positive: 3942, positive conditional: 0, positive unconditional: 3942, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7812, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7812, unknown conditional: 0, unknown unconditional: 7812] , Statistics on independence cache: Total cache size (in pairs): 10892, Positive cache size: 10892, Positive conditional cache size: 0, Positive unconditional cache size: 10892, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4630.7ms, 289 PlacesBefore, 232 PlacesAfterwards, 174 TransitionsBefore, 117 TransitionsAfterwards, 19608 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 57 TotalNumberOfCompositions, 8094 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8094, positive: 8094, positive conditional: 0, positive unconditional: 8094, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8094, positive: 8094, positive conditional: 0, positive unconditional: 8094, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8094, positive: 8094, positive conditional: 0, positive unconditional: 8094, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8094, positive: 4902, positive conditional: 0, positive unconditional: 4902, negative: 3192, negative conditional: 0, negative unconditional: 3192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3192, positive: 3192, positive conditional: 0, positive unconditional: 3192, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4210, positive: 4210, positive conditional: 0, positive unconditional: 4210, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8094, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8094, unknown conditional: 0, unknown unconditional: 8094] , Statistics on independence cache: Total cache size (in pairs): 11286, Positive cache size: 11286, Positive conditional cache size: 0, Positive unconditional cache size: 11286, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4735.7ms, 294 PlacesBefore, 236 PlacesAfterwards, 177 TransitionsBefore, 119 TransitionsAfterwards, 20300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 58 TotalNumberOfCompositions, 8381 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8381, positive: 8381, positive conditional: 0, positive unconditional: 8381, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8381, positive: 8381, positive conditional: 0, positive unconditional: 8381, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8381, positive: 8381, positive conditional: 0, positive unconditional: 8381, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8381, positive: 5075, positive conditional: 0, positive unconditional: 5075, negative: 3306, negative conditional: 0, negative unconditional: 3306, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3306, positive: 3306, positive conditional: 0, positive unconditional: 3306, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4312, positive: 4312, positive conditional: 0, positive unconditional: 4312, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8381, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8381, unknown conditional: 0, unknown unconditional: 8381] , Statistics on independence cache: Total cache size (in pairs): 11687, Positive cache size: 11687, Positive conditional cache size: 0, Positive unconditional cache size: 11687, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4973.1ms, 299 PlacesBefore, 240 PlacesAfterwards, 180 TransitionsBefore, 121 TransitionsAfterwards, 21004 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 59 TotalNumberOfCompositions, 8673 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8673, positive: 8673, positive conditional: 0, positive unconditional: 8673, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8673, positive: 8673, positive conditional: 0, positive unconditional: 8673, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8673, positive: 8673, positive conditional: 0, positive unconditional: 8673, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8673, positive: 5251, positive conditional: 0, positive unconditional: 5251, negative: 3422, negative conditional: 0, negative unconditional: 3422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3422, positive: 3422, positive conditional: 0, positive unconditional: 3422, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4526, positive: 4526, positive conditional: 0, positive unconditional: 4526, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8673, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8673, unknown conditional: 0, unknown unconditional: 8673] , Statistics on independence cache: Total cache size (in pairs): 12095, Positive cache size: 12095, Positive conditional cache size: 0, Positive unconditional cache size: 12095, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5217.8ms, 304 PlacesBefore, 244 PlacesAfterwards, 183 TransitionsBefore, 123 TransitionsAfterwards, 21720 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 60 TotalNumberOfCompositions, 8970 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8970, positive: 8970, positive conditional: 0, positive unconditional: 8970, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8970, positive: 8970, positive conditional: 0, positive unconditional: 8970, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8970, positive: 8970, positive conditional: 0, positive unconditional: 8970, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8970, positive: 5430, positive conditional: 0, positive unconditional: 5430, negative: 3540, negative conditional: 0, negative unconditional: 3540, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3540, positive: 3540, positive conditional: 0, positive unconditional: 3540, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4764, positive: 4764, positive conditional: 0, positive unconditional: 4764, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8970, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8970, unknown conditional: 0, unknown unconditional: 8970] , Statistics on independence cache: Total cache size (in pairs): 12510, Positive cache size: 12510, Positive conditional cache size: 0, Positive unconditional cache size: 12510, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5427.3ms, 309 PlacesBefore, 248 PlacesAfterwards, 186 TransitionsBefore, 125 TransitionsAfterwards, 22448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 61 TotalNumberOfCompositions, 9272 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9272, positive: 9272, positive conditional: 0, positive unconditional: 9272, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9272, positive: 9272, positive conditional: 0, positive unconditional: 9272, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9272, positive: 9272, positive conditional: 0, positive unconditional: 9272, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9272, positive: 5612, positive conditional: 0, positive unconditional: 5612, negative: 3660, negative conditional: 0, negative unconditional: 3660, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3660, positive: 3660, positive conditional: 0, positive unconditional: 3660, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4950, positive: 4950, positive conditional: 0, positive unconditional: 4950, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9272, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9272, unknown conditional: 0, unknown unconditional: 9272] , Statistics on independence cache: Total cache size (in pairs): 12932, Positive cache size: 12932, Positive conditional cache size: 0, Positive unconditional cache size: 12932, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5721.0ms, 314 PlacesBefore, 252 PlacesAfterwards, 189 TransitionsBefore, 127 TransitionsAfterwards, 23188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 62 TotalNumberOfCompositions, 9579 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9579, positive: 9579, positive conditional: 0, positive unconditional: 9579, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9579, positive: 9579, positive conditional: 0, positive unconditional: 9579, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9579, positive: 9579, positive conditional: 0, positive unconditional: 9579, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9579, positive: 5797, positive conditional: 0, positive unconditional: 5797, negative: 3782, negative conditional: 0, negative unconditional: 3782, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3782, positive: 3782, positive conditional: 0, positive unconditional: 3782, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5161, positive: 5161, positive conditional: 0, positive unconditional: 5161, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9579, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9579, unknown conditional: 0, unknown unconditional: 9579] , Statistics on independence cache: Total cache size (in pairs): 13361, Positive cache size: 13361, Positive conditional cache size: 0, Positive unconditional cache size: 13361, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5858.4ms, 319 PlacesBefore, 256 PlacesAfterwards, 192 TransitionsBefore, 129 TransitionsAfterwards, 23940 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 63 TotalNumberOfCompositions, 9891 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9891, positive: 9891, positive conditional: 0, positive unconditional: 9891, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9891, positive: 9891, positive conditional: 0, positive unconditional: 9891, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9891, positive: 9891, positive conditional: 0, positive unconditional: 9891, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9891, positive: 5985, positive conditional: 0, positive unconditional: 5985, negative: 3906, negative conditional: 0, negative unconditional: 3906, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3906, positive: 3906, positive conditional: 0, positive unconditional: 3906, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5357, positive: 5357, positive conditional: 0, positive unconditional: 5357, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9891, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9891, unknown conditional: 0, unknown unconditional: 9891] , Statistics on independence cache: Total cache size (in pairs): 13797, Positive cache size: 13797, Positive conditional cache size: 0, Positive unconditional cache size: 13797, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6183.2ms, 324 PlacesBefore, 260 PlacesAfterwards, 195 TransitionsBefore, 131 TransitionsAfterwards, 24704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 64 TotalNumberOfCompositions, 10208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10208, positive: 10208, positive conditional: 0, positive unconditional: 10208, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10208, positive: 10208, positive conditional: 0, positive unconditional: 10208, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10208, positive: 10208, positive conditional: 0, positive unconditional: 10208, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10208, positive: 6176, positive conditional: 0, positive unconditional: 6176, negative: 4032, negative conditional: 0, negative unconditional: 4032, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4032, positive: 4032, positive conditional: 0, positive unconditional: 4032, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5653, positive: 5653, positive conditional: 0, positive unconditional: 5653, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10208, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 10208, unknown conditional: 0, unknown unconditional: 10208] , Statistics on independence cache: Total cache size (in pairs): 14240, Positive cache size: 14240, Positive conditional cache size: 0, Positive unconditional cache size: 14240, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6557.6ms, 329 PlacesBefore, 264 PlacesAfterwards, 198 TransitionsBefore, 133 TransitionsAfterwards, 25480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 65 TotalNumberOfCompositions, 10530 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10530, positive: 10530, positive conditional: 0, positive unconditional: 10530, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10530, positive: 10530, positive conditional: 0, positive unconditional: 10530, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10530, positive: 10530, positive conditional: 0, positive unconditional: 10530, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10530, positive: 6370, positive conditional: 0, positive unconditional: 6370, negative: 4160, negative conditional: 0, negative unconditional: 4160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4160, positive: 4160, positive conditional: 0, positive unconditional: 4160, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6013, positive: 6013, positive conditional: 0, positive unconditional: 6013, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10530, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 10530, unknown conditional: 0, unknown unconditional: 10530] , Statistics on independence cache: Total cache size (in pairs): 14690, Positive cache size: 14690, Positive conditional cache size: 0, Positive unconditional cache size: 14690, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7006.6ms, 334 PlacesBefore, 268 PlacesAfterwards, 201 TransitionsBefore, 135 TransitionsAfterwards, 26268 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 66 TotalNumberOfCompositions, 10857 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10857, positive: 10857, positive conditional: 0, positive unconditional: 10857, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10857, positive: 10857, positive conditional: 0, positive unconditional: 10857, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10857, positive: 10857, positive conditional: 0, positive unconditional: 10857, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10857, positive: 6567, positive conditional: 0, positive unconditional: 6567, negative: 4290, negative conditional: 0, negative unconditional: 4290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4290, positive: 4290, positive conditional: 0, positive unconditional: 4290, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6445, positive: 6445, positive conditional: 0, positive unconditional: 6445, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10857, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 10857, unknown conditional: 0, unknown unconditional: 10857] , Statistics on independence cache: Total cache size (in pairs): 15147, Positive cache size: 15147, Positive conditional cache size: 0, Positive unconditional cache size: 15147, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7097.6ms, 339 PlacesBefore, 272 PlacesAfterwards, 204 TransitionsBefore, 137 TransitionsAfterwards, 27068 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 67 TotalNumberOfCompositions, 11189 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11189, positive: 11189, positive conditional: 0, positive unconditional: 11189, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11189, positive: 11189, positive conditional: 0, positive unconditional: 11189, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11189, positive: 11189, positive conditional: 0, positive unconditional: 11189, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11189, positive: 6767, positive conditional: 0, positive unconditional: 6767, negative: 4422, negative conditional: 0, negative unconditional: 4422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4422, positive: 4422, positive conditional: 0, positive unconditional: 4422, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6516, positive: 6516, positive conditional: 0, positive unconditional: 6516, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11189, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 11189, unknown conditional: 0, unknown unconditional: 11189] , Statistics on independence cache: Total cache size (in pairs): 15611, Positive cache size: 15611, Positive conditional cache size: 0, Positive unconditional cache size: 15611, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7465.8ms, 344 PlacesBefore, 276 PlacesAfterwards, 207 TransitionsBefore, 139 TransitionsAfterwards, 27880 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 68 TotalNumberOfCompositions, 11526 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11526, positive: 11526, positive conditional: 0, positive unconditional: 11526, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11526, positive: 11526, positive conditional: 0, positive unconditional: 11526, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11526, positive: 11526, positive conditional: 0, positive unconditional: 11526, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11526, positive: 6970, positive conditional: 0, positive unconditional: 6970, negative: 4556, negative conditional: 0, negative unconditional: 4556, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4556, positive: 4556, positive conditional: 0, positive unconditional: 4556, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6859, positive: 6859, positive conditional: 0, positive unconditional: 6859, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11526, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 11526, unknown conditional: 0, unknown unconditional: 11526] , Statistics on independence cache: Total cache size (in pairs): 16082, Positive cache size: 16082, Positive conditional cache size: 0, Positive unconditional cache size: 16082, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7937.2ms, 349 PlacesBefore, 280 PlacesAfterwards, 210 TransitionsBefore, 141 TransitionsAfterwards, 28704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 69 TotalNumberOfCompositions, 11868 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11868, positive: 11868, positive conditional: 0, positive unconditional: 11868, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11868, positive: 11868, positive conditional: 0, positive unconditional: 11868, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11868, positive: 11868, positive conditional: 0, positive unconditional: 11868, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11868, positive: 7176, positive conditional: 0, positive unconditional: 7176, negative: 4692, negative conditional: 0, negative unconditional: 4692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4692, positive: 4692, positive conditional: 0, positive unconditional: 4692, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7295, positive: 7295, positive conditional: 0, positive unconditional: 7295, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11868, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 11868, unknown conditional: 0, unknown unconditional: 11868] , Statistics on independence cache: Total cache size (in pairs): 16560, Positive cache size: 16560, Positive conditional cache size: 0, Positive unconditional cache size: 16560, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8311.7ms, 354 PlacesBefore, 284 PlacesAfterwards, 213 TransitionsBefore, 143 TransitionsAfterwards, 29540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 70 TotalNumberOfCompositions, 12215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12215, positive: 12215, positive conditional: 0, positive unconditional: 12215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12215, positive: 12215, positive conditional: 0, positive unconditional: 12215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12215, positive: 12215, positive conditional: 0, positive unconditional: 12215, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12215, positive: 7385, positive conditional: 0, positive unconditional: 7385, negative: 4830, negative conditional: 0, negative unconditional: 4830, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4830, positive: 4830, positive conditional: 0, positive unconditional: 4830, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7650, positive: 7650, positive conditional: 0, positive unconditional: 7650, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12215, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 12215, unknown conditional: 0, unknown unconditional: 12215] , Statistics on independence cache: Total cache size (in pairs): 17045, Positive cache size: 17045, Positive conditional cache size: 0, Positive unconditional cache size: 17045, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8814.8ms, 359 PlacesBefore, 288 PlacesAfterwards, 216 TransitionsBefore, 145 TransitionsAfterwards, 30388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 71 TotalNumberOfCompositions, 12567 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12567, positive: 12567, positive conditional: 0, positive unconditional: 12567, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12567, positive: 12567, positive conditional: 0, positive unconditional: 12567, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12567, positive: 12567, positive conditional: 0, positive unconditional: 12567, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12567, positive: 7597, positive conditional: 0, positive unconditional: 7597, negative: 4970, negative conditional: 0, negative unconditional: 4970, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4970, positive: 4970, positive conditional: 0, positive unconditional: 4970, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8120, positive: 8120, positive conditional: 0, positive unconditional: 8120, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12567, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 12567, unknown conditional: 0, unknown unconditional: 12567] , Statistics on independence cache: Total cache size (in pairs): 17537, Positive cache size: 17537, Positive conditional cache size: 0, Positive unconditional cache size: 17537, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9537.3ms, 364 PlacesBefore, 292 PlacesAfterwards, 219 TransitionsBefore, 147 TransitionsAfterwards, 31248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 72 TotalNumberOfCompositions, 12924 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12924, positive: 12924, positive conditional: 0, positive unconditional: 12924, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12924, positive: 12924, positive conditional: 0, positive unconditional: 12924, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12924, positive: 12924, positive conditional: 0, positive unconditional: 12924, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12924, positive: 7812, positive conditional: 0, positive unconditional: 7812, negative: 5112, negative conditional: 0, negative unconditional: 5112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5112, positive: 5112, positive conditional: 0, positive unconditional: 5112, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8804, positive: 8804, positive conditional: 0, positive unconditional: 8804, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12924, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 12924, unknown conditional: 0, unknown unconditional: 12924] , Statistics on independence cache: Total cache size (in pairs): 18036, Positive cache size: 18036, Positive conditional cache size: 0, Positive unconditional cache size: 18036, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9927.1ms, 369 PlacesBefore, 296 PlacesAfterwards, 222 TransitionsBefore, 149 TransitionsAfterwards, 32120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 73 TotalNumberOfCompositions, 13286 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13286, positive: 13286, positive conditional: 0, positive unconditional: 13286, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13286, positive: 13286, positive conditional: 0, positive unconditional: 13286, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13286, positive: 13286, positive conditional: 0, positive unconditional: 13286, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13286, positive: 8030, positive conditional: 0, positive unconditional: 8030, negative: 5256, negative conditional: 0, negative unconditional: 5256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5256, positive: 5256, positive conditional: 0, positive unconditional: 5256, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9116, positive: 9116, positive conditional: 0, positive unconditional: 9116, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13286, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 13286, unknown conditional: 0, unknown unconditional: 13286] , Statistics on independence cache: Total cache size (in pairs): 18542, Positive cache size: 18542, Positive conditional cache size: 0, Positive unconditional cache size: 18542, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10678.4ms, 374 PlacesBefore, 300 PlacesAfterwards, 225 TransitionsBefore, 151 TransitionsAfterwards, 33004 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 74 TotalNumberOfCompositions, 13653 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13653, positive: 13653, positive conditional: 0, positive unconditional: 13653, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13653, positive: 13653, positive conditional: 0, positive unconditional: 13653, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13653, positive: 13653, positive conditional: 0, positive unconditional: 13653, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13653, positive: 8251, positive conditional: 0, positive unconditional: 8251, negative: 5402, negative conditional: 0, negative unconditional: 5402, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5402, positive: 5402, positive conditional: 0, positive unconditional: 5402, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9864, positive: 9864, positive conditional: 0, positive unconditional: 9864, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13653, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 13653, unknown conditional: 0, unknown unconditional: 13653] , Statistics on independence cache: Total cache size (in pairs): 19055, Positive cache size: 19055, Positive conditional cache size: 0, Positive unconditional cache size: 19055, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11512.0ms, 379 PlacesBefore, 304 PlacesAfterwards, 228 TransitionsBefore, 153 TransitionsAfterwards, 33900 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 75 TotalNumberOfCompositions, 14025 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14025, positive: 14025, positive conditional: 0, positive unconditional: 14025, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14025, positive: 14025, positive conditional: 0, positive unconditional: 14025, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14025, positive: 14025, positive conditional: 0, positive unconditional: 14025, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14025, positive: 8475, positive conditional: 0, positive unconditional: 8475, negative: 5550, negative conditional: 0, negative unconditional: 5550, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5550, positive: 5550, positive conditional: 0, positive unconditional: 5550, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10531, positive: 10531, positive conditional: 0, positive unconditional: 10531, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14025, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14025, unknown conditional: 0, unknown unconditional: 14025] , Statistics on independence cache: Total cache size (in pairs): 19575, Positive cache size: 19575, Positive conditional cache size: 0, Positive unconditional cache size: 19575, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12153.1ms, 384 PlacesBefore, 308 PlacesAfterwards, 231 TransitionsBefore, 155 TransitionsAfterwards, 34808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 76 TotalNumberOfCompositions, 14402 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14402, positive: 14402, positive conditional: 0, positive unconditional: 14402, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14402, positive: 14402, positive conditional: 0, positive unconditional: 14402, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14402, positive: 14402, positive conditional: 0, positive unconditional: 14402, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14402, positive: 8702, positive conditional: 0, positive unconditional: 8702, negative: 5700, negative conditional: 0, negative unconditional: 5700, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5700, positive: 5700, positive conditional: 0, positive unconditional: 5700, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11209, positive: 11209, positive conditional: 0, positive unconditional: 11209, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14402, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14402, unknown conditional: 0, unknown unconditional: 14402] , Statistics on independence cache: Total cache size (in pairs): 20102, Positive cache size: 20102, Positive conditional cache size: 0, Positive unconditional cache size: 20102, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13234.6ms, 389 PlacesBefore, 312 PlacesAfterwards, 234 TransitionsBefore, 157 TransitionsAfterwards, 35728 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 77 TotalNumberOfCompositions, 14784 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14784, positive: 14784, positive conditional: 0, positive unconditional: 14784, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14784, positive: 14784, positive conditional: 0, positive unconditional: 14784, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14784, positive: 14784, positive conditional: 0, positive unconditional: 14784, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14784, positive: 8932, positive conditional: 0, positive unconditional: 8932, negative: 5852, negative conditional: 0, negative unconditional: 5852, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5852, positive: 5852, positive conditional: 0, positive unconditional: 5852, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12140, positive: 12140, positive conditional: 0, positive unconditional: 12140, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14784, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14784, unknown conditional: 0, unknown unconditional: 14784] , Statistics on independence cache: Total cache size (in pairs): 20636, Positive cache size: 20636, Positive conditional cache size: 0, Positive unconditional cache size: 20636, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14092.5ms, 394 PlacesBefore, 316 PlacesAfterwards, 237 TransitionsBefore, 159 TransitionsAfterwards, 36660 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 78 TotalNumberOfCompositions, 15171 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15171, positive: 15171, positive conditional: 0, positive unconditional: 15171, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15171, positive: 15171, positive conditional: 0, positive unconditional: 15171, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15171, positive: 15171, positive conditional: 0, positive unconditional: 15171, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15171, positive: 9165, positive conditional: 0, positive unconditional: 9165, negative: 6006, negative conditional: 0, negative unconditional: 6006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6006, positive: 6006, positive conditional: 0, positive unconditional: 6006, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13038, positive: 13038, positive conditional: 0, positive unconditional: 13038, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15171, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 15171, unknown conditional: 0, unknown unconditional: 15171] , Statistics on independence cache: Total cache size (in pairs): 21177, Positive cache size: 21177, Positive conditional cache size: 0, Positive unconditional cache size: 21177, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14904.9ms, 399 PlacesBefore, 320 PlacesAfterwards, 240 TransitionsBefore, 161 TransitionsAfterwards, 37604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 79 TotalNumberOfCompositions, 15563 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15563, positive: 15563, positive conditional: 0, positive unconditional: 15563, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15563, positive: 15563, positive conditional: 0, positive unconditional: 15563, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15563, positive: 15563, positive conditional: 0, positive unconditional: 15563, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15563, positive: 9401, positive conditional: 0, positive unconditional: 9401, negative: 6162, negative conditional: 0, negative unconditional: 6162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6162, positive: 6162, positive conditional: 0, positive unconditional: 6162, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13791, positive: 13791, positive conditional: 0, positive unconditional: 13791, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15563, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 15563, unknown conditional: 0, unknown unconditional: 15563] , Statistics on independence cache: Total cache size (in pairs): 21725, Positive cache size: 21725, Positive conditional cache size: 0, Positive unconditional cache size: 21725, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17487.8ms, 404 PlacesBefore, 324 PlacesAfterwards, 243 TransitionsBefore, 163 TransitionsAfterwards, 38560 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 80 TotalNumberOfCompositions, 15960 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15960, positive: 15960, positive conditional: 0, positive unconditional: 15960, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15960, positive: 15960, positive conditional: 0, positive unconditional: 15960, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15960, positive: 15960, positive conditional: 0, positive unconditional: 15960, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15960, positive: 9640, positive conditional: 0, positive unconditional: 9640, negative: 6320, negative conditional: 0, negative unconditional: 6320, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6320, positive: 6320, positive conditional: 0, positive unconditional: 6320, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16180, positive: 16180, positive conditional: 0, positive unconditional: 16180, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15960, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 15960, unknown conditional: 0, unknown unconditional: 15960] , Statistics on independence cache: Total cache size (in pairs): 22280, Positive cache size: 22280, Positive conditional cache size: 0, Positive unconditional cache size: 22280, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18510.3ms, 409 PlacesBefore, 328 PlacesAfterwards, 246 TransitionsBefore, 165 TransitionsAfterwards, 39528 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 81 TotalNumberOfCompositions, 16362 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16362, positive: 16362, positive conditional: 0, positive unconditional: 16362, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16362, positive: 16362, positive conditional: 0, positive unconditional: 16362, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16362, positive: 16362, positive conditional: 0, positive unconditional: 16362, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16362, positive: 9882, positive conditional: 0, positive unconditional: 9882, negative: 6480, negative conditional: 0, negative unconditional: 6480, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6480, positive: 6480, positive conditional: 0, positive unconditional: 6480, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17143, positive: 17143, positive conditional: 0, positive unconditional: 17143, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16362, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 16362, unknown conditional: 0, unknown unconditional: 16362] , Statistics on independence cache: Total cache size (in pairs): 22842, Positive cache size: 22842, Positive conditional cache size: 0, Positive unconditional cache size: 22842, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19987.4ms, 414 PlacesBefore, 332 PlacesAfterwards, 249 TransitionsBefore, 167 TransitionsAfterwards, 40508 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 82 TotalNumberOfCompositions, 16769 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16769, positive: 16769, positive conditional: 0, positive unconditional: 16769, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16769, positive: 16769, positive conditional: 0, positive unconditional: 16769, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16769, positive: 16769, positive conditional: 0, positive unconditional: 16769, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16769, positive: 10127, positive conditional: 0, positive unconditional: 10127, negative: 6642, negative conditional: 0, negative unconditional: 6642, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6642, positive: 6642, positive conditional: 0, positive unconditional: 6642, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18476, positive: 18476, positive conditional: 0, positive unconditional: 18476, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16769, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 16769, unknown conditional: 0, unknown unconditional: 16769] , Statistics on independence cache: Total cache size (in pairs): 23411, Positive cache size: 23411, Positive conditional cache size: 0, Positive unconditional cache size: 23411, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20498.4ms, 419 PlacesBefore, 336 PlacesAfterwards, 252 TransitionsBefore, 169 TransitionsAfterwards, 41500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 83 TotalNumberOfCompositions, 17181 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17181, positive: 17181, positive conditional: 0, positive unconditional: 17181, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17181, positive: 17181, positive conditional: 0, positive unconditional: 17181, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17181, positive: 17181, positive conditional: 0, positive unconditional: 17181, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17181, positive: 10375, positive conditional: 0, positive unconditional: 10375, negative: 6806, negative conditional: 0, negative unconditional: 6806, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6806, positive: 6806, positive conditional: 0, positive unconditional: 6806, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18990, positive: 18990, positive conditional: 0, positive unconditional: 18990, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17181, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 17181, unknown conditional: 0, unknown unconditional: 17181] , Statistics on independence cache: Total cache size (in pairs): 23987, Positive cache size: 23987, Positive conditional cache size: 0, Positive unconditional cache size: 23987, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21082.1ms, 424 PlacesBefore, 340 PlacesAfterwards, 255 TransitionsBefore, 171 TransitionsAfterwards, 42504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 84 TotalNumberOfCompositions, 17598 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17598, positive: 17598, positive conditional: 0, positive unconditional: 17598, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17598, positive: 17598, positive conditional: 0, positive unconditional: 17598, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17598, positive: 17598, positive conditional: 0, positive unconditional: 17598, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17598, positive: 10626, positive conditional: 0, positive unconditional: 10626, negative: 6972, negative conditional: 0, negative unconditional: 6972, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6972, positive: 6972, positive conditional: 0, positive unconditional: 6972, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19520, positive: 19520, positive conditional: 0, positive unconditional: 19520, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17598, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 17598, unknown conditional: 0, unknown unconditional: 17598] , Statistics on independence cache: Total cache size (in pairs): 24570, Positive cache size: 24570, Positive conditional cache size: 0, Positive unconditional cache size: 24570, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22581.2ms, 429 PlacesBefore, 344 PlacesAfterwards, 258 TransitionsBefore, 173 TransitionsAfterwards, 43520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 85 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 85 TotalNumberOfCompositions, 18020 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18020, positive: 18020, positive conditional: 0, positive unconditional: 18020, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18020, positive: 18020, positive conditional: 0, positive unconditional: 18020, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18020, positive: 18020, positive conditional: 0, positive unconditional: 18020, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18020, positive: 10880, positive conditional: 0, positive unconditional: 10880, negative: 7140, negative conditional: 0, negative unconditional: 7140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7140, positive: 7140, positive conditional: 0, positive unconditional: 7140, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20905, positive: 20905, positive conditional: 0, positive unconditional: 20905, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18020, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 18020, unknown conditional: 0, unknown unconditional: 18020] , Statistics on independence cache: Total cache size (in pairs): 25160, Positive cache size: 25160, Positive conditional cache size: 0, Positive unconditional cache size: 25160, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24247.2ms, 434 PlacesBefore, 348 PlacesAfterwards, 261 TransitionsBefore, 175 TransitionsAfterwards, 44548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 86 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 86 TotalNumberOfCompositions, 18447 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18447, positive: 18447, positive conditional: 0, positive unconditional: 18447, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18447, positive: 18447, positive conditional: 0, positive unconditional: 18447, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18447, positive: 18447, positive conditional: 0, positive unconditional: 18447, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18447, positive: 11137, positive conditional: 0, positive unconditional: 11137, negative: 7310, negative conditional: 0, negative unconditional: 7310, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7310, positive: 7310, positive conditional: 0, positive unconditional: 7310, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22442, positive: 22442, positive conditional: 0, positive unconditional: 22442, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18447, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 18447, unknown conditional: 0, unknown unconditional: 18447] , Statistics on independence cache: Total cache size (in pairs): 25757, Positive cache size: 25757, Positive conditional cache size: 0, Positive unconditional cache size: 25757, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26522.6ms, 439 PlacesBefore, 352 PlacesAfterwards, 264 TransitionsBefore, 177 TransitionsAfterwards, 45588 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 87 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 87 TotalNumberOfCompositions, 18879 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18879, positive: 18879, positive conditional: 0, positive unconditional: 18879, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18879, positive: 18879, positive conditional: 0, positive unconditional: 18879, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18879, positive: 18879, positive conditional: 0, positive unconditional: 18879, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18879, positive: 11397, positive conditional: 0, positive unconditional: 11397, negative: 7482, negative conditional: 0, negative unconditional: 7482, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7482, positive: 7482, positive conditional: 0, positive unconditional: 7482, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24519, positive: 24519, positive conditional: 0, positive unconditional: 24519, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18879, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 18879, unknown conditional: 0, unknown unconditional: 18879] , Statistics on independence cache: Total cache size (in pairs): 26361, Positive cache size: 26361, Positive conditional cache size: 0, Positive unconditional cache size: 26361, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29745.3ms, 444 PlacesBefore, 356 PlacesAfterwards, 267 TransitionsBefore, 179 TransitionsAfterwards, 46640 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 88 TotalNumberOfCompositions, 19316 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19316, positive: 19316, positive conditional: 0, positive unconditional: 19316, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19316, positive: 19316, positive conditional: 0, positive unconditional: 19316, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19316, positive: 19316, positive conditional: 0, positive unconditional: 19316, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19316, positive: 11660, positive conditional: 0, positive unconditional: 11660, negative: 7656, negative conditional: 0, negative unconditional: 7656, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7656, positive: 7656, positive conditional: 0, positive unconditional: 7656, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27595, positive: 27595, positive conditional: 0, positive unconditional: 27595, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19316, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 19316, unknown conditional: 0, unknown unconditional: 19316] , Statistics on independence cache: Total cache size (in pairs): 26972, Positive cache size: 26972, Positive conditional cache size: 0, Positive unconditional cache size: 26972, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30833.1ms, 449 PlacesBefore, 360 PlacesAfterwards, 270 TransitionsBefore, 181 TransitionsAfterwards, 47704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 89 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 89 TotalNumberOfCompositions, 19758 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19758, positive: 19758, positive conditional: 0, positive unconditional: 19758, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19758, positive: 19758, positive conditional: 0, positive unconditional: 19758, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19758, positive: 19758, positive conditional: 0, positive unconditional: 19758, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19758, positive: 11926, positive conditional: 0, positive unconditional: 11926, negative: 7832, negative conditional: 0, negative unconditional: 7832, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7832, positive: 7832, positive conditional: 0, positive unconditional: 7832, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28608, positive: 28608, positive conditional: 0, positive unconditional: 28608, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19758, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 19758, unknown conditional: 0, unknown unconditional: 19758] , Statistics on independence cache: Total cache size (in pairs): 27590, Positive cache size: 27590, Positive conditional cache size: 0, Positive unconditional cache size: 27590, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32528.3ms, 454 PlacesBefore, 364 PlacesAfterwards, 273 TransitionsBefore, 183 TransitionsAfterwards, 48780 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, 20205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20205, positive: 20205, positive conditional: 0, positive unconditional: 20205, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20205, positive: 20205, positive conditional: 0, positive unconditional: 20205, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20205, positive: 20205, positive conditional: 0, positive unconditional: 20205, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20205, positive: 12195, positive conditional: 0, positive unconditional: 12195, negative: 8010, negative conditional: 0, negative unconditional: 8010, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8010, positive: 8010, positive conditional: 0, positive unconditional: 8010, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30200, positive: 30200, positive conditional: 0, positive unconditional: 30200, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20205, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 20205, unknown conditional: 0, unknown unconditional: 20205] , Statistics on independence cache: Total cache size (in pairs): 28215, Positive cache size: 28215, Positive conditional cache size: 0, Positive unconditional cache size: 28215, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34399.1ms, 459 PlacesBefore, 368 PlacesAfterwards, 276 TransitionsBefore, 185 TransitionsAfterwards, 49868 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 91 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, 20657 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20657, positive: 20657, positive conditional: 0, positive unconditional: 20657, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20657, positive: 20657, positive conditional: 0, positive unconditional: 20657, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20657, positive: 20657, positive conditional: 0, positive unconditional: 20657, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20657, positive: 12467, positive conditional: 0, positive unconditional: 12467, negative: 8190, negative conditional: 0, negative unconditional: 8190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8190, positive: 8190, positive conditional: 0, positive unconditional: 8190, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31931, positive: 31931, positive conditional: 0, positive unconditional: 31931, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20657, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 20657, unknown conditional: 0, unknown unconditional: 20657] , Statistics on independence cache: Total cache size (in pairs): 28847, Positive cache size: 28847, Positive conditional cache size: 0, Positive unconditional cache size: 28847, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41031.0ms, 464 PlacesBefore, 372 PlacesAfterwards, 279 TransitionsBefore, 187 TransitionsAfterwards, 50968 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 21114 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21114, positive: 21114, positive conditional: 0, positive unconditional: 21114, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21114, positive: 21114, positive conditional: 0, positive unconditional: 21114, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21114, positive: 21114, positive conditional: 0, positive unconditional: 21114, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21114, positive: 12742, positive conditional: 0, positive unconditional: 12742, negative: 8372, negative conditional: 0, negative unconditional: 8372, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8372, positive: 8372, positive conditional: 0, positive unconditional: 8372, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38223, positive: 38223, positive conditional: 0, positive unconditional: 38223, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21114, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 21114, unknown conditional: 0, unknown unconditional: 21114] , Statistics on independence cache: Total cache size (in pairs): 29486, Positive cache size: 29486, Positive conditional cache size: 0, Positive unconditional cache size: 29486, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42226.6ms, 469 PlacesBefore, 376 PlacesAfterwards, 282 TransitionsBefore, 189 TransitionsAfterwards, 52080 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 93 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 93 TotalNumberOfCompositions, 21576 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21576, positive: 21576, positive conditional: 0, positive unconditional: 21576, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21576, positive: 21576, positive conditional: 0, positive unconditional: 21576, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21576, positive: 21576, positive conditional: 0, positive unconditional: 21576, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21576, positive: 13020, positive conditional: 0, positive unconditional: 13020, negative: 8556, negative conditional: 0, negative unconditional: 8556, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8556, positive: 8556, positive conditional: 0, positive unconditional: 8556, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39277, positive: 39277, positive conditional: 0, positive unconditional: 39277, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21576, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 21576, unknown conditional: 0, unknown unconditional: 21576] , Statistics on independence cache: Total cache size (in pairs): 30132, Positive cache size: 30132, Positive conditional cache size: 0, Positive unconditional cache size: 30132, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44110.9ms, 474 PlacesBefore, 380 PlacesAfterwards, 285 TransitionsBefore, 191 TransitionsAfterwards, 53204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 94 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 94 TotalNumberOfCompositions, 22043 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22043, positive: 22043, positive conditional: 0, positive unconditional: 22043, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22043, positive: 22043, positive conditional: 0, positive unconditional: 22043, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22043, positive: 22043, positive conditional: 0, positive unconditional: 22043, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22043, positive: 13301, positive conditional: 0, positive unconditional: 13301, negative: 8742, negative conditional: 0, negative unconditional: 8742, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8742, positive: 8742, positive conditional: 0, positive unconditional: 8742, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41012, positive: 41012, positive conditional: 0, positive unconditional: 41012, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22043, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 22043, unknown conditional: 0, unknown unconditional: 22043] , Statistics on independence cache: Total cache size (in pairs): 30785, Positive cache size: 30785, Positive conditional cache size: 0, Positive unconditional cache size: 30785, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45235.8ms, 479 PlacesBefore, 384 PlacesAfterwards, 288 TransitionsBefore, 193 TransitionsAfterwards, 54340 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 95 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 95 TotalNumberOfCompositions, 22515 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22515, positive: 22515, positive conditional: 0, positive unconditional: 22515, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22515, positive: 22515, positive conditional: 0, positive unconditional: 22515, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22515, positive: 22515, positive conditional: 0, positive unconditional: 22515, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22515, positive: 13585, positive conditional: 0, positive unconditional: 13585, negative: 8930, negative conditional: 0, negative unconditional: 8930, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8930, positive: 8930, positive conditional: 0, positive unconditional: 8930, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41991, positive: 41991, positive conditional: 0, positive unconditional: 41991, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22515, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 22515, unknown conditional: 0, unknown unconditional: 22515] , Statistics on independence cache: Total cache size (in pairs): 31445, Positive cache size: 31445, Positive conditional cache size: 0, Positive unconditional cache size: 31445, 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 CegarLoopForPetriNet was constructing initial abstraction,while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 484 places, 291 transitions, 10182 flow,while LiptonReduction was applying LiptonReduction to Petri net that has 484 places, 291 transitions, 10182 flow and 55488 co-enabled transitions pairs.,while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. Started 96 CEGAR loops. EmptinessCheckTime: 50.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 799032.9ms, OverallIterations: 190, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 10697.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 784529.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 95 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 269.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9791occurred in iteration=0, InterpolantAutomatonStates: 285, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 77.6ms SsaConstructionTime, 210.7ms SatisfiabilityAnalysisTime, 643.4ms InterpolantComputationTime, 4940 NumberOfCodeBlocks, 4940 NumberOfCodeBlocksAsserted, 190 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 95 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