/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/example_multiple_interleavings.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 13:21:34,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 13:21:34,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 13:21:34,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 13:21:34,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 13:21:34,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 13:21:34,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 13:21:34,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 13:21:34,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 13:21:34,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 13:21:34,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 13:21:34,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 13:21:34,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 13:21:34,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 13:21:34,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 13:21:34,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 13:21:34,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 13:21:34,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 13:21:34,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 13:21:34,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 13:21:34,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 13:21:34,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 13:21:34,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 13:21:34,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 13:21:34,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 13:21:34,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 13:21:34,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 13:21:34,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 13:21:34,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 13:21:34,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 13:21:34,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 13:21:34,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 13:21:34,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 13:21:34,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 13:21:34,247 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 13:21:34,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 13:21:34,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 13:21:34,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 13:21:34,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 13:21:34,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 13:21:34,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 13:21:34,253 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 13:21:34,291 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 13:21:34,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 13:21:34,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 13:21:34,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 13:21:34,295 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 13:21:34,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 13:21:34,295 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 13:21:34,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 13:21:34,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 13:21:34,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 13:21:34,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 13:21:34,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 13:21:34,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 13:21:34,297 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 13:21:34,297 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 13:21:34,297 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 13:21:34,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 13:21:34,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 13:21:34,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 13:21:34,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 13:21:34,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 13:21:34,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 13:21:34,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 13:21:34,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 13:21:34,299 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 13:21:34,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 13:21:34,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 13:21:34,299 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 13:21:34,299 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 13:21:34,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 13:21:34,299 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 13:21:34,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 13:21:34,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 13:21:34,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 13:21:34,608 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-26 13:21:34,609 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-26 13:21:34,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/example_multiple_interleavings.bpl [2021-03-26 13:21:34,610 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/example_multiple_interleavings.bpl' [2021-03-26 13:21:34,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 13:21:34,848 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-26 13:21:34,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 13:21:34,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 13:21:34,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 13:21:34,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/1) ... [2021-03-26 13:21:34,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/1) ... [2021-03-26 13:21:34,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 13:21:34,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 13:21:34,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 13:21:34,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 13:21:34,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/1) ... [2021-03-26 13:21:34,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/1) ... [2021-03-26 13:21:34,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/1) ... [2021-03-26 13:21:34,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/1) ... [2021-03-26 13:21:34,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/1) ... [2021-03-26 13:21:34,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/1) ... [2021-03-26 13:21:34,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/1) ... [2021-03-26 13:21:34,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 13:21:34,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 13:21:34,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 13:21:34,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 13:21:34,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 13:21:34,965 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_y given in one single declaration [2021-03-26 13:21:34,965 INFO L130 BoogieDeclarations]: Found specification of procedure set_y [2021-03-26 13:21:34,965 INFO L138 BoogieDeclarations]: Found implementation of procedure set_y [2021-03-26 13:21:34,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_x_1 given in one single declaration [2021-03-26 13:21:34,966 INFO L130 BoogieDeclarations]: Found specification of procedure set_x_1 [2021-03-26 13:21:34,966 INFO L138 BoogieDeclarations]: Found implementation of procedure set_x_1 [2021-03-26 13:21:34,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_x_0 given in one single declaration [2021-03-26 13:21:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure set_x_0 [2021-03-26 13:21:34,967 INFO L138 BoogieDeclarations]: Found implementation of procedure set_x_0 [2021-03-26 13:21:34,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-26 13:21:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 13:21:34,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 13:21:34,968 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 13:21:35,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 13:21:35,072 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-26 13:21:35,073 INFO L202 PluginConnector]: Adding new model example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 01:21:35 BoogieIcfgContainer [2021-03-26 13:21:35,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 13:21:35,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 13:21:35,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 13:21:35,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 13:21:35,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.03 01:21:34" (1/2) ... [2021-03-26 13:21:35,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d2d778 and model type example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 01:21:35, skipping insertion in model container [2021-03-26 13:21:35,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 01:21:35" (2/2) ... [2021-03-26 13:21:35,079 INFO L111 eAbstractionObserver]: Analyzing ICFG example_multiple_interleavings.bpl [2021-03-26 13:21:35,084 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 13:21:35,086 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 13:21:35,087 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 13:21:35,160 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-03-26 13:21:35,179 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-26 13:21:35,210 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 13:21:35,210 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 13:21:35,210 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 13:21:35,211 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 13:21:35,211 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 13:21:35,211 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 13:21:35,211 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 13:21:35,211 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 13:21:35,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 90 flow [2021-03-26 13:21:35,257 INFO L129 PetriNetUnfolder]: 5/24 cut-off events. [2021-03-26 13:21:35,257 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-26 13:21:35,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 24 events. 5/24 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 6 conditions per place. [2021-03-26 13:21:35,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 90 flow [2021-03-26 13:21:35,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 19 transitions, 74 flow [2021-03-26 13:21:35,265 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:21:35,281 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 74 flow [2021-03-26 13:21:35,290 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 74 flow [2021-03-26 13:21:35,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 74 flow [2021-03-26 13:21:35,307 INFO L129 PetriNetUnfolder]: 5/22 cut-off events. [2021-03-26 13:21:35,308 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-26 13:21:35,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 22 events. 5/22 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 20. Up to 6 conditions per place. [2021-03-26 13:21:35,311 INFO L142 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-26 13:21:35,423 INFO L154 LiptonReduction]: Checked pairs total: 46 [2021-03-26 13:21:35,423 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 13:21:35,425 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 161 [2021-03-26 13:21:35,445 INFO L129 PetriNetUnfolder]: 5/18 cut-off events. [2021-03-26 13:21:35,445 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-26 13:21:35,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:21:35,446 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:21:35,447 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 13:21:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:21:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash 902393523, now seen corresponding path program 1 times [2021-03-26 13:21:35,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:21:35,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595759273] [2021-03-26 13:21:35,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:21:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:21:35,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:21:35,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:21:35,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:21:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:21:35,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595759273] [2021-03-26 13:21:35,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:21:35,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:21:35,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574112188] [2021-03-26 13:21:35,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 13:21:35,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:21:35,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 13:21:35,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 13:21:35,587 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 27 [2021-03-26 13:21:35,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:21:35,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 27 [2021-03-26 13:21:35,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:21:35,616 INFO L129 PetriNetUnfolder]: 3/16 cut-off events. [2021-03-26 13:21:35,617 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-03-26 13:21:35,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 1/17 useless extension candidates. Maximal degree in co-relation 14. Up to 4 conditions per place. [2021-03-26 13:21:35,618 INFO L132 encePairwiseOnDemand]: 25/27 looper letters, 2 selfloop transitions, 1 changer transitions 0/15 dead transitions. [2021-03-26 13:21:35,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 15 transitions, 69 flow [2021-03-26 13:21:35,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 13:21:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 13:21:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2021-03-26 13:21:35,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2021-03-26 13:21:35,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 73 transitions. [2021-03-26 13:21:35,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 73 transitions. [2021-03-26 13:21:35,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:21:35,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 73 transitions. [2021-03-26 13:21:35,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,640 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,641 INFO L185 Difference]: Start difference. First operand has 20 places, 16 transitions, 68 flow. Second operand 3 states and 73 transitions. [2021-03-26 13:21:35,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 15 transitions, 69 flow [2021-03-26 13:21:35,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 15 transitions, 47 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-26 13:21:35,650 INFO L241 Difference]: Finished difference. Result has 16 places, 15 transitions, 43 flow [2021-03-26 13:21:35,652 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=43, PETRI_PLACES=16, PETRI_TRANSITIONS=15} [2021-03-26 13:21:35,653 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, -4 predicate places. [2021-03-26 13:21:35,653 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:21:35,653 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 15 transitions, 43 flow [2021-03-26 13:21:35,654 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 15 transitions, 43 flow [2021-03-26 13:21:35,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 16 places, 15 transitions, 43 flow [2021-03-26 13:21:35,664 INFO L129 PetriNetUnfolder]: 3/16 cut-off events. [2021-03-26 13:21:35,665 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 13:21:35,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 16 events. 3/16 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. 0/16 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2021-03-26 13:21:35,666 INFO L142 LiptonReduction]: Number of co-enabled transitions 28 [2021-03-26 13:21:35,669 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 13:21:35,669 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:21:35,669 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-26 13:21:35,671 INFO L480 AbstractCegarLoop]: Abstraction has has 16 places, 15 transitions, 43 flow [2021-03-26 13:21:35,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,672 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:21:35,672 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:21:35,673 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 13:21:35,673 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 13:21:35,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:21:35,674 INFO L82 PathProgramCache]: Analyzing trace with hash 892361613, now seen corresponding path program 1 times [2021-03-26 13:21:35,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:21:35,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683457940] [2021-03-26 13:21:35,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:21:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:21:35,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:21:35,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:21:35,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:21:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:21:35,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683457940] [2021-03-26 13:21:35,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:21:35,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:21:35,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331830382] [2021-03-26 13:21:35,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 13:21:35,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:21:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 13:21:35,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 13:21:35,710 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 27 [2021-03-26 13:21:35,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 15 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:21:35,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 27 [2021-03-26 13:21:35,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:21:35,716 INFO L129 PetriNetUnfolder]: 0/10 cut-off events. [2021-03-26 13:21:35,717 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 13:21:35,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19 conditions, 10 events. 0/10 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 5 event pairs, 0 based on Foata normal form. 2/12 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 13:21:35,724 INFO L132 encePairwiseOnDemand]: 24/27 looper letters, 1 selfloop transitions, 1 changer transitions 0/10 dead transitions. [2021-03-26 13:21:35,724 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 10 transitions, 32 flow [2021-03-26 13:21:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 13:21:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 13:21:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2021-03-26 13:21:35,726 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2021-03-26 13:21:35,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 73 transitions. [2021-03-26 13:21:35,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 73 transitions. [2021-03-26 13:21:35,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:21:35,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 73 transitions. [2021-03-26 13:21:35,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,728 INFO L185 Difference]: Start difference. First operand has 16 places, 15 transitions, 43 flow. Second operand 3 states and 73 transitions. [2021-03-26 13:21:35,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 10 transitions, 32 flow [2021-03-26 13:21:35,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 10 transitions, 31 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 13:21:35,729 INFO L241 Difference]: Finished difference. Result has 17 places, 10 transitions, 29 flow [2021-03-26 13:21:35,729 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=27, PETRI_DIFFERENCE_MINUEND_PLACES=15, 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=29, PETRI_PLACES=17, PETRI_TRANSITIONS=10} [2021-03-26 13:21:35,730 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, -3 predicate places. [2021-03-26 13:21:35,730 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:21:35,730 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 10 transitions, 29 flow [2021-03-26 13:21:35,730 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 10 transitions, 29 flow [2021-03-26 13:21:35,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 17 places, 10 transitions, 29 flow [2021-03-26 13:21:35,733 INFO L129 PetriNetUnfolder]: 0/10 cut-off events. [2021-03-26 13:21:35,733 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 13:21:35,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17 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 7 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-03-26 13:21:35,733 INFO L142 LiptonReduction]: Number of co-enabled transitions 18 [2021-03-26 13:21:35,734 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 13:21:35,734 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:21:35,734 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4 [2021-03-26 13:21:35,735 INFO L480 AbstractCegarLoop]: Abstraction has has 17 places, 10 transitions, 29 flow [2021-03-26 13:21:35,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:21:35,736 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:21:35,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 13:21:35,736 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 13:21:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:21:35,736 INFO L82 PathProgramCache]: Analyzing trace with hash 957775953, now seen corresponding path program 1 times [2021-03-26 13:21:35,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:21:35,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961205214] [2021-03-26 13:21:35,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:21:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:21:35,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:21:35,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:21:35,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 13:21:35,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-03-26 13:21:35,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961205214] [2021-03-26 13:21:35,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:21:35,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:21:35,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564416097] [2021-03-26 13:21:35,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 13:21:35,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:21:35,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 13:21:35,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 13:21:35,770 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 27 [2021-03-26 13:21:35,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 10 transitions, 29 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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-03-26 13:21:35,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:21:35,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 27 [2021-03-26 13:21:35,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:21:35,783 INFO L129 PetriNetUnfolder]: 4/25 cut-off events. [2021-03-26 13:21:35,784 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 13:21:35,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 48 event pairs, 1 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 39. Up to 8 conditions per place. [2021-03-26 13:21:35,784 INFO L132 encePairwiseOnDemand]: 23/27 looper letters, 4 selfloop transitions, 3 changer transitions 0/13 dead transitions. [2021-03-26 13:21:35,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 13 transitions, 49 flow [2021-03-26 13:21:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 13:21:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 13:21:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2021-03-26 13:21:35,786 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2021-03-26 13:21:35,786 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 84 transitions. [2021-03-26 13:21:35,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 84 transitions. [2021-03-26 13:21:35,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:21:35,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 84 transitions. [2021-03-26 13:21:35,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-03-26 13:21:35,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,788 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,788 INFO L185 Difference]: Start difference. First operand has 17 places, 10 transitions, 29 flow. Second operand 4 states and 84 transitions. [2021-03-26 13:21:35,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 13 transitions, 49 flow [2021-03-26 13:21:35,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 13 transitions, 48 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 13:21:35,789 INFO L241 Difference]: Finished difference. Result has 21 places, 12 transitions, 49 flow [2021-03-26 13:21:35,789 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=49, PETRI_PLACES=21, PETRI_TRANSITIONS=12} [2021-03-26 13:21:35,790 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2021-03-26 13:21:35,790 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:21:35,790 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 12 transitions, 49 flow [2021-03-26 13:21:35,790 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 12 transitions, 49 flow [2021-03-26 13:21:35,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 12 transitions, 49 flow [2021-03-26 13:21:35,794 INFO L129 PetriNetUnfolder]: 1/20 cut-off events. [2021-03-26 13:21:35,794 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 13:21:35,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 20 events. 1/20 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 34 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 31. Up to 4 conditions per place. [2021-03-26 13:21:35,795 INFO L142 LiptonReduction]: Number of co-enabled transitions 18 [2021-03-26 13:21:35,796 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 13:21:35,796 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:21:35,796 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-26 13:21:35,797 INFO L480 AbstractCegarLoop]: Abstraction has has 21 places, 12 transitions, 49 flow [2021-03-26 13:21:35,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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-03-26 13:21:35,797 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:21:35,797 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:21:35,797 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 13:21:35,797 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 13:21:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:21:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash -842576759, now seen corresponding path program 2 times [2021-03-26 13:21:35,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:21:35,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825813408] [2021-03-26 13:21:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:21:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:21:35,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:21:35,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:21:35,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 13:21:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:21:35,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825813408] [2021-03-26 13:21:35,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:21:35,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:21:35,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232404629] [2021-03-26 13:21:35,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 13:21:35,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:21:35,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 13:21:35,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 13:21:35,824 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 27 [2021-03-26 13:21:35,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 12 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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-03-26 13:21:35,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:21:35,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 27 [2021-03-26 13:21:35,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:21:35,842 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-26 13:21:35,842 INFO L130 PetriNetUnfolder]: For 23/26 co-relation queries the response was YES. [2021-03-26 13:21:35,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 28 events. 3/28 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 73 event pairs, 1 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 61. Up to 10 conditions per place. [2021-03-26 13:21:35,843 INFO L132 encePairwiseOnDemand]: 23/27 looper letters, 2 selfloop transitions, 6 changer transitions 1/15 dead transitions. [2021-03-26 13:21:35,843 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 15 transitions, 80 flow [2021-03-26 13:21:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 13:21:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 13:21:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2021-03-26 13:21:35,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2021-03-26 13:21:35,849 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 84 transitions. [2021-03-26 13:21:35,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 84 transitions. [2021-03-26 13:21:35,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:21:35,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 84 transitions. [2021-03-26 13:21:35,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-03-26 13:21:35,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,851 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,851 INFO L185 Difference]: Start difference. First operand has 21 places, 12 transitions, 49 flow. Second operand 4 states and 84 transitions. [2021-03-26 13:21:35,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 15 transitions, 80 flow [2021-03-26 13:21:35,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 15 transitions, 78 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 13:21:35,853 INFO L241 Difference]: Finished difference. Result has 25 places, 14 transitions, 79 flow [2021-03-26 13:21:35,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=25, PETRI_TRANSITIONS=14} [2021-03-26 13:21:35,853 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2021-03-26 13:21:35,854 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:21:35,854 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 14 transitions, 79 flow [2021-03-26 13:21:35,854 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 14 transitions, 79 flow [2021-03-26 13:21:35,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 14 transitions, 79 flow [2021-03-26 13:21:35,861 INFO L129 PetriNetUnfolder]: 2/16 cut-off events. [2021-03-26 13:21:35,861 INFO L130 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2021-03-26 13:21:35,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 16 events. 2/16 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2021-03-26 13:21:35,862 INFO L142 LiptonReduction]: Number of co-enabled transitions 18 [2021-03-26 13:21:35,863 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 13:21:35,864 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:21:35,864 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-26 13:21:35,865 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 79 flow [2021-03-26 13:21:35,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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-03-26 13:21:35,865 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:21:35,865 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:21:35,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 13:21:35,866 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 13:21:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:21:35,866 INFO L82 PathProgramCache]: Analyzing trace with hash 71195793, now seen corresponding path program 3 times [2021-03-26 13:21:35,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:21:35,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270836927] [2021-03-26 13:21:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:21:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:21:35,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:21:35,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 13:21:35,885 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 13:21:35,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 13:21:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:21:35,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270836927] [2021-03-26 13:21:35,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:21:35,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:21:35,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030366131] [2021-03-26 13:21:35,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 13:21:35,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:21:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 13:21:35,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 13:21:35,895 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 27 [2021-03-26 13:21:35,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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-03-26 13:21:35,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:21:35,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 27 [2021-03-26 13:21:35,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:21:35,904 INFO L129 PetriNetUnfolder]: 1/18 cut-off events. [2021-03-26 13:21:35,904 INFO L130 PetriNetUnfolder]: For 31/37 co-relation queries the response was YES. [2021-03-26 13:21:35,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 18 events. 1/18 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 51. Up to 6 conditions per place. [2021-03-26 13:21:35,904 INFO L132 encePairwiseOnDemand]: 24/27 looper letters, 5 selfloop transitions, 2 changer transitions 2/15 dead transitions. [2021-03-26 13:21:35,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 15 transitions, 103 flow [2021-03-26 13:21:35,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 13:21:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 13:21:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2021-03-26 13:21:35,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7592592592592593 [2021-03-26 13:21:35,906 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 82 transitions. [2021-03-26 13:21:35,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 82 transitions. [2021-03-26 13:21:35,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:21:35,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 82 transitions. [2021-03-26 13:21:35,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,908 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,908 INFO L185 Difference]: Start difference. First operand has 25 places, 14 transitions, 79 flow. Second operand 4 states and 82 transitions. [2021-03-26 13:21:35,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 15 transitions, 103 flow [2021-03-26 13:21:35,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 15 transitions, 90 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 13:21:35,910 INFO L241 Difference]: Finished difference. Result has 28 places, 13 transitions, 70 flow [2021-03-26 13:21:35,910 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=13} [2021-03-26 13:21:35,910 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2021-03-26 13:21:35,911 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:21:35,911 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 13 transitions, 70 flow [2021-03-26 13:21:35,911 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 13 transitions, 70 flow [2021-03-26 13:21:35,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 13 transitions, 70 flow [2021-03-26 13:21:35,914 INFO L129 PetriNetUnfolder]: 1/14 cut-off events. [2021-03-26 13:21:35,915 INFO L130 PetriNetUnfolder]: For 13/15 co-relation queries the response was YES. [2021-03-26 13:21:35,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 14 events. 1/14 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 13 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2021-03-26 13:21:35,915 INFO L142 LiptonReduction]: Number of co-enabled transitions 10 [2021-03-26 13:21:35,916 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 13:21:35,916 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:21:35,916 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-03-26 13:21:35,917 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 13 transitions, 70 flow [2021-03-26 13:21:35,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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-03-26 13:21:35,917 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 13:21:35,918 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 13:21:35,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 13:21:35,918 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-26 13:21:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 13:21:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash 66230165, now seen corresponding path program 4 times [2021-03-26 13:21:35,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 13:21:35,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199167351] [2021-03-26 13:21:35,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 13:21:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 13:21:35,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 13:21:35,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 13:21:35,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 13:21:35,942 INFO L142 QuantifierPusher]: treesize reduction 2, result has 77.8 percent of original size [2021-03-26 13:21:35,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 13:21:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 13:21:35,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199167351] [2021-03-26 13:21:35,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 13:21:35,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 13:21:35,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922712600] [2021-03-26 13:21:35,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 13:21:35,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 13:21:35,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 13:21:35,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 13:21:35,952 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 27 [2021-03-26 13:21:35,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 13 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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-03-26 13:21:35,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 13:21:35,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 27 [2021-03-26 13:21:35,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 13:21:35,959 INFO L129 PetriNetUnfolder]: 1/13 cut-off events. [2021-03-26 13:21:35,959 INFO L130 PetriNetUnfolder]: For 24/30 co-relation queries the response was YES. [2021-03-26 13:21:35,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 13 events. 1/13 cut-off events. For 24/30 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 1/14 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2021-03-26 13:21:35,959 INFO L132 encePairwiseOnDemand]: 24/27 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2021-03-26 13:21:35,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 12 transitions, 78 flow [2021-03-26 13:21:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 13:21:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 13:21:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2021-03-26 13:21:35,961 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.75 [2021-03-26 13:21:35,961 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 81 transitions. [2021-03-26 13:21:35,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 81 transitions. [2021-03-26 13:21:35,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 13:21:35,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 81 transitions. [2021-03-26 13:21:35,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,962 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 13:21:35,963 INFO L185 Difference]: Start difference. First operand has 27 places, 13 transitions, 70 flow. Second operand 4 states and 81 transitions. [2021-03-26 13:21:35,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 12 transitions, 78 flow [2021-03-26 13:21:35,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 12 transitions, 64 flow, removed 1 selfloop flow, removed 5 redundant places. [2021-03-26 13:21:35,964 INFO L241 Difference]: Finished difference. Result has 24 places, 0 transitions, 0 flow [2021-03-26 13:21:35,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=24, PETRI_TRANSITIONS=0} [2021-03-26 13:21:35,964 INFO L343 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2021-03-26 13:21:35,964 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 13:21:35,964 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 0 transitions, 0 flow [2021-03-26 13:21:35,965 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 0 transitions, 0 flow [2021-03-26 13:21:35,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-03-26 13:21:35,965 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-03-26 13:21:35,965 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 13:21:35,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2021-03-26 13:21:35,965 INFO L142 LiptonReduction]: Number of co-enabled transitions 0 [2021-03-26 13:21:35,965 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 13:21:35,965 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 13:21:35,966 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2 [2021-03-26 13:21:35,966 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-03-26 13:21:35,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 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-03-26 13:21:35,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 13:21:35,970 INFO L202 PluginConnector]: Adding new model example_multiple_interleavings.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 01:21:35 BasicIcfg [2021-03-26 13:21:35,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 13:21:35,971 INFO L168 Benchmark]: Toolchain (without parser) took 1123.09 ms. Allocated memory was 255.9 MB in the beginning and 333.4 MB in the end (delta: 77.6 MB). Free memory was 236.5 MB in the beginning and 299.4 MB in the end (delta: -62.9 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.0 GB. [2021-03-26 13:21:35,971 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.54 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 13:21:35,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.22 ms. Allocated memory is still 255.9 MB. Free memory was 236.3 MB in the beginning and 234.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 13:21:35,972 INFO L168 Benchmark]: Boogie Preprocessor took 11.13 ms. Allocated memory is still 255.9 MB. Free memory was 234.8 MB in the beginning and 234.1 MB in the end (delta: 713.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 13:21:35,973 INFO L168 Benchmark]: RCFGBuilder took 191.96 ms. Allocated memory is still 255.9 MB. Free memory was 233.9 MB in the beginning and 241.2 MB in the end (delta: -7.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.0 GB. [2021-03-26 13:21:35,973 INFO L168 Benchmark]: TraceAbstraction took 895.45 ms. Allocated memory was 255.9 MB in the beginning and 333.4 MB in the end (delta: 77.6 MB). Free memory was 240.6 MB in the beginning and 299.4 MB in the end (delta: -58.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.0 GB. [2021-03-26 13:21:35,975 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.54 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 20.22 ms. Allocated memory is still 255.9 MB. Free memory was 236.3 MB in the beginning and 234.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 11.13 ms. Allocated memory is still 255.9 MB. Free memory was 234.8 MB in the beginning and 234.1 MB in the end (delta: 713.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 191.96 ms. Allocated memory is still 255.9 MB. Free memory was 233.9 MB in the beginning and 241.2 MB in the end (delta: -7.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 895.45 ms. Allocated memory was 255.9 MB in the beginning and 333.4 MB in the end (delta: 77.6 MB). Free memory was 240.6 MB in the beginning and 299.4 MB in the end (delta: -58.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 133.7ms, 23 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 16 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 46 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.2ms, 16 PlacesBefore, 16 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9ms, 17 PlacesBefore, 17 PlacesAfterwards, 10 TransitionsBefore, 10 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4ms, 21 PlacesBefore, 21 PlacesAfterwards, 12 TransitionsBefore, 12 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5ms, 25 PlacesBefore, 25 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1ms, 28 PlacesBefore, 27 PlacesAfterwards, 13 TransitionsBefore, 13 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8ms, 24 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0 - PositiveResult [Line: 19]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 9.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 760.7ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 170.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 225.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 21 SDtfs, 10 SDslu, 5 SDs, 0 SdLazy, 19 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=4, InterpolantAutomatonStates: 22, 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: 7.9ms SsaConstructionTime, 25.7ms SatisfiabilityAnalysisTime, 148.8ms InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...