./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:49:03,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:49:03,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:49:03,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:49:03,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:49:03,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:49:03,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:49:03,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:49:03,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:49:03,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:49:03,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:49:03,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:49:03,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:49:03,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:49:03,370 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:49:03,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:49:03,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:49:03,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:49:03,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:49:03,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:49:03,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:49:03,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:49:03,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:49:03,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:49:03,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:49:03,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:49:03,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:49:03,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:49:03,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:49:03,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:49:03,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:49:03,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:49:03,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:49:03,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:49:03,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:49:03,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:49:03,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:49:03,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:49:03,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:49:03,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:49:03,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:49:03,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:49:03,382 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2024-11-09 02:49:03,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:49:03,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:49:03,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:49:03,697 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:49:03,697 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:49:03,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-11-09 02:49:05,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:49:05,321 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:49:05,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-11-09 02:49:05,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f82496b5/4bd26c90fc0a473d9c680b8aaeff70de/FLAG9dac90538 [2024-11-09 02:49:05,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f82496b5/4bd26c90fc0a473d9c680b8aaeff70de [2024-11-09 02:49:05,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:49:05,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:49:05,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:49:05,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:49:05,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:49:05,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:49:05" (1/1) ... [2024-11-09 02:49:05,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b71cd2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:05, skipping insertion in model container [2024-11-09 02:49:05,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:49:05" (1/1) ... [2024-11-09 02:49:05,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:49:05,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2024-11-09 02:49:05,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:49:05,990 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:49:06,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2024-11-09 02:49:06,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:49:06,027 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:49:06,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06 WrapperNode [2024-11-09 02:49:06,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:49:06,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:49:06,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:49:06,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:49:06,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,059 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2024-11-09 02:49:06,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:49:06,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:49:06,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:49:06,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:49:06,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,083 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 02:49:06,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:49:06,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:49:06,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:49:06,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:49:06,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (1/1) ... [2024-11-09 02:49:06,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:49:06,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:49:06,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:49:06,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:49:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:49:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 02:49:06,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 02:49:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 02:49:06,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 02:49:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 02:49:06,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 02:49:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:49:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 02:49:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 02:49:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:49:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:49:06,171 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:49:06,257 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:49:06,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:49:06,467 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:49:06,467 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:49:06,614 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:49:06,616 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 02:49:06,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:49:06 BoogieIcfgContainer [2024-11-09 02:49:06,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:49:06,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:49:06,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:49:06,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:49:06,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:49:05" (1/3) ... [2024-11-09 02:49:06,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66870507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:49:06, skipping insertion in model container [2024-11-09 02:49:06,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:06" (2/3) ... [2024-11-09 02:49:06,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66870507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:49:06, skipping insertion in model container [2024-11-09 02:49:06,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:49:06" (3/3) ... [2024-11-09 02:49:06,623 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-11-09 02:49:06,639 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:49:06,640 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:49:06,640 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:49:06,692 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 02:49:06,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 85 flow [2024-11-09 02:49:06,768 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-11-09 02:49:06,769 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 02:49:06,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-11-09 02:49:06,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 85 flow [2024-11-09 02:49:06,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 74 flow [2024-11-09 02:49:06,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:49:06,797 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1cad336b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:49:06,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 02:49:06,816 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:49:06,816 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-11-09 02:49:06,816 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 02:49:06,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:06,817 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:06,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:06,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1857037086, now seen corresponding path program 1 times [2024-11-09 02:49:06,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90928034] [2024-11-09 02:49:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:07,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:07,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90928034] [2024-11-09 02:49:07,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90928034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:07,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:07,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:49:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908598088] [2024-11-09 02:49:07,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:07,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:49:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:07,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:49:07,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:49:07,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-09 02:49:07,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:07,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:07,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-09 02:49:07,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:07,679 INFO L124 PetriNetUnfolderBase]: 321/552 cut-off events. [2024-11-09 02:49:07,679 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 02:49:07,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 552 events. 321/552 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2475 event pairs, 34 based on Foata normal form. 1/536 useless extension candidates. Maximal degree in co-relation 896. Up to 376 conditions per place. [2024-11-09 02:49:07,690 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 26 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-11-09 02:49:07,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2024-11-09 02:49:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:49:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:49:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-11-09 02:49:07,704 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-11-09 02:49:07,706 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 74 flow. Second operand 3 states and 74 transitions. [2024-11-09 02:49:07,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2024-11-09 02:49:07,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 02:49:07,714 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2024-11-09 02:49:07,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2024-11-09 02:49:07,722 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2024-11-09 02:49:07,723 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2024-11-09 02:49:07,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:07,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:07,723 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:07,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:49:07,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:07,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:07,725 INFO L85 PathProgramCache]: Analyzing trace with hash 345968512, now seen corresponding path program 1 times [2024-11-09 02:49:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:07,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898500172] [2024-11-09 02:49:07,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:08,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898500172] [2024-11-09 02:49:08,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898500172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:08,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:08,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:08,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177517073] [2024-11-09 02:49:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:08,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:49:08,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:08,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:49:08,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:49:08,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-09 02:49:08,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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) [2024-11-09 02:49:08,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:08,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-09 02:49:08,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:08,416 INFO L124 PetriNetUnfolderBase]: 577/914 cut-off events. [2024-11-09 02:49:08,416 INFO L125 PetriNetUnfolderBase]: For 198/221 co-relation queries the response was YES. [2024-11-09 02:49:08,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 914 events. 577/914 cut-off events. For 198/221 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4362 event pairs, 20 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 619. Up to 436 conditions per place. [2024-11-09 02:49:08,429 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 62 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-11-09 02:49:08,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 84 transitions, 389 flow [2024-11-09 02:49:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:49:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 02:49:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-11-09 02:49:08,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2024-11-09 02:49:08,433 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 7 states and 150 transitions. [2024-11-09 02:49:08,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 84 transitions, 389 flow [2024-11-09 02:49:08,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 84 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:49:08,438 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 184 flow [2024-11-09 02:49:08,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2024-11-09 02:49:08,440 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2024-11-09 02:49:08,440 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 184 flow [2024-11-09 02:49:08,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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) [2024-11-09 02:49:08,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:08,441 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:08,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:49:08,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:08,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash 160537772, now seen corresponding path program 2 times [2024-11-09 02:49:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:08,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043350611] [2024-11-09 02:49:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:08,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043350611] [2024-11-09 02:49:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043350611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:08,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375962737] [2024-11-09 02:49:08,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:08,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:49:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:08,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:49:08,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:49:08,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-09 02:49:08,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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) [2024-11-09 02:49:08,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:08,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-09 02:49:08,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:08,977 INFO L124 PetriNetUnfolderBase]: 698/1103 cut-off events. [2024-11-09 02:49:08,977 INFO L125 PetriNetUnfolderBase]: For 734/804 co-relation queries the response was YES. [2024-11-09 02:49:08,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 1103 events. 698/1103 cut-off events. For 734/804 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5450 event pairs, 78 based on Foata normal form. 31/1088 useless extension candidates. Maximal degree in co-relation 2785. Up to 713 conditions per place. [2024-11-09 02:49:08,990 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 55 selfloop transitions, 21 changer transitions 2/86 dead transitions. [2024-11-09 02:49:08,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 511 flow [2024-11-09 02:49:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:49:08,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 02:49:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-11-09 02:49:08,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-11-09 02:49:08,994 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 184 flow. Second operand 7 states and 144 transitions. [2024-11-09 02:49:08,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 511 flow [2024-11-09 02:49:08,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 02:49:09,002 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 340 flow [2024-11-09 02:49:09,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2024-11-09 02:49:09,004 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2024-11-09 02:49:09,004 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 340 flow [2024-11-09 02:49:09,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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) [2024-11-09 02:49:09,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:09,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:09,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:49:09,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:09,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1462173970, now seen corresponding path program 3 times [2024-11-09 02:49:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949710105] [2024-11-09 02:49:09,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:09,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:09,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:09,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949710105] [2024-11-09 02:49:09,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949710105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:09,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:09,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017771313] [2024-11-09 02:49:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:09,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:49:09,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:49:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:49:09,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-09 02:49:09,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:09,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:09,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-09 02:49:09,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:09,665 INFO L124 PetriNetUnfolderBase]: 1472/2215 cut-off events. [2024-11-09 02:49:09,665 INFO L125 PetriNetUnfolderBase]: For 2673/2751 co-relation queries the response was YES. [2024-11-09 02:49:09,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6970 conditions, 2215 events. 1472/2215 cut-off events. For 2673/2751 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 11761 event pairs, 120 based on Foata normal form. 37/2204 useless extension candidates. Maximal degree in co-relation 5295. Up to 915 conditions per place. [2024-11-09 02:49:09,686 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 88 selfloop transitions, 38 changer transitions 2/135 dead transitions. [2024-11-09 02:49:09,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 135 transitions, 922 flow [2024-11-09 02:49:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:49:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 02:49:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-11-09 02:49:09,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-11-09 02:49:09,690 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 340 flow. Second operand 9 states and 198 transitions. [2024-11-09 02:49:09,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 135 transitions, 922 flow [2024-11-09 02:49:09,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 135 transitions, 878 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-09 02:49:09,705 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 584 flow [2024-11-09 02:49:09,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=584, PETRI_PLACES=64, PETRI_TRANSITIONS=72} [2024-11-09 02:49:09,707 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2024-11-09 02:49:09,707 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 584 flow [2024-11-09 02:49:09,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:09,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:09,709 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:09,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:49:09,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:09,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:09,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1153795878, now seen corresponding path program 4 times [2024-11-09 02:49:09,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:09,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867272399] [2024-11-09 02:49:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:09,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:09,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867272399] [2024-11-09 02:49:09,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867272399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:09,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:09,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:49:09,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440477535] [2024-11-09 02:49:09,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:09,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:09,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:09,887 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-09 02:49:09,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 72 transitions, 584 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:09,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:09,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-09 02:49:09,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:10,239 INFO L124 PetriNetUnfolderBase]: 1361/2148 cut-off events. [2024-11-09 02:49:10,239 INFO L125 PetriNetUnfolderBase]: For 6235/6379 co-relation queries the response was YES. [2024-11-09 02:49:10,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8276 conditions, 2148 events. 1361/2148 cut-off events. For 6235/6379 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 12175 event pairs, 141 based on Foata normal form. 38/2128 useless extension candidates. Maximal degree in co-relation 6477. Up to 1240 conditions per place. [2024-11-09 02:49:10,264 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 65 selfloop transitions, 34 changer transitions 2/110 dead transitions. [2024-11-09 02:49:10,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 993 flow [2024-11-09 02:49:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:49:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:49:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-09 02:49:10,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-09 02:49:10,267 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 584 flow. Second operand 6 states and 126 transitions. [2024-11-09 02:49:10,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 993 flow [2024-11-09 02:49:10,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 110 transitions, 972 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-09 02:49:10,287 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 742 flow [2024-11-09 02:49:10,288 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2024-11-09 02:49:10,289 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 36 predicate places. [2024-11-09 02:49:10,290 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 742 flow [2024-11-09 02:49:10,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:10,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:10,291 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:10,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:49:10,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:10,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:10,292 INFO L85 PathProgramCache]: Analyzing trace with hash 973411842, now seen corresponding path program 1 times [2024-11-09 02:49:10,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:10,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618780728] [2024-11-09 02:49:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:10,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:10,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:10,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618780728] [2024-11-09 02:49:10,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618780728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:10,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:10,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:10,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204771891] [2024-11-09 02:49:10,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:10,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:49:10,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:10,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:49:10,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:49:10,486 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-09 02:49:10,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:10,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:10,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-09 02:49:10,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:10,854 INFO L124 PetriNetUnfolderBase]: 1771/2729 cut-off events. [2024-11-09 02:49:10,855 INFO L125 PetriNetUnfolderBase]: For 11436/11618 co-relation queries the response was YES. [2024-11-09 02:49:10,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11686 conditions, 2729 events. 1771/2729 cut-off events. For 11436/11618 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 15486 event pairs, 196 based on Foata normal form. 49/2728 useless extension candidates. Maximal degree in co-relation 9056. Up to 1448 conditions per place. [2024-11-09 02:49:10,883 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 99 selfloop transitions, 29 changer transitions 2/137 dead transitions. [2024-11-09 02:49:10,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 137 transitions, 1371 flow [2024-11-09 02:49:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:49:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 02:49:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-11-09 02:49:10,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-09 02:49:10,885 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 742 flow. Second operand 7 states and 147 transitions. [2024-11-09 02:49:10,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 137 transitions, 1371 flow [2024-11-09 02:49:10,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 137 transitions, 1314 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-11-09 02:49:10,954 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 834 flow [2024-11-09 02:49:10,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=834, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2024-11-09 02:49:10,955 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2024-11-09 02:49:10,955 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 834 flow [2024-11-09 02:49:10,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:10,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:10,955 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:10,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:49:10,956 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:10,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:10,957 INFO L85 PathProgramCache]: Analyzing trace with hash 686345294, now seen corresponding path program 2 times [2024-11-09 02:49:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:10,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812130883] [2024-11-09 02:49:10,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:10,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812130883] [2024-11-09 02:49:11,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812130883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:11,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:11,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:49:11,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792989289] [2024-11-09 02:49:11,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:11,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:11,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:11,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:11,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:11,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-09 02:49:11,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 834 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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) [2024-11-09 02:49:11,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:11,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-09 02:49:11,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:11,541 INFO L124 PetriNetUnfolderBase]: 1540/2483 cut-off events. [2024-11-09 02:49:11,541 INFO L125 PetriNetUnfolderBase]: For 12251/12586 co-relation queries the response was YES. [2024-11-09 02:49:11,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11134 conditions, 2483 events. 1540/2483 cut-off events. For 12251/12586 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 14721 event pairs, 267 based on Foata normal form. 30/2409 useless extension candidates. Maximal degree in co-relation 8566. Up to 1995 conditions per place. [2024-11-09 02:49:11,573 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 71 selfloop transitions, 25 changer transitions 0/109 dead transitions. [2024-11-09 02:49:11,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 109 transitions, 1144 flow [2024-11-09 02:49:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:49:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:49:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-09 02:49:11,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.69375 [2024-11-09 02:49:11,575 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 834 flow. Second operand 5 states and 111 transitions. [2024-11-09 02:49:11,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 109 transitions, 1144 flow [2024-11-09 02:49:11,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 109 transitions, 1109 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-11-09 02:49:11,604 INFO L231 Difference]: Finished difference. Result has 84 places, 84 transitions, 915 flow [2024-11-09 02:49:11,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=915, PETRI_PLACES=84, PETRI_TRANSITIONS=84} [2024-11-09 02:49:11,605 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2024-11-09 02:49:11,605 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 915 flow [2024-11-09 02:49:11,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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) [2024-11-09 02:49:11,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:11,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:49:11,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:11,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1387687040, now seen corresponding path program 1 times [2024-11-09 02:49:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468854012] [2024-11-09 02:49:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:11,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:11,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468854012] [2024-11-09 02:49:11,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468854012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:11,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:11,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54922427] [2024-11-09 02:49:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:11,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:11,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:11,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:11,833 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-09 02:49:11,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 915 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:11,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:11,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-09 02:49:11,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:12,418 INFO L124 PetriNetUnfolderBase]: 2611/4222 cut-off events. [2024-11-09 02:49:12,418 INFO L125 PetriNetUnfolderBase]: For 20146/20434 co-relation queries the response was YES. [2024-11-09 02:49:12,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18385 conditions, 4222 events. 2611/4222 cut-off events. For 20146/20434 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 25712 event pairs, 873 based on Foata normal form. 1/3906 useless extension candidates. Maximal degree in co-relation 15844. Up to 2374 conditions per place. [2024-11-09 02:49:12,465 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 71 selfloop transitions, 43 changer transitions 0/127 dead transitions. [2024-11-09 02:49:12,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 127 transitions, 1351 flow [2024-11-09 02:49:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:49:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:49:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-11-09 02:49:12,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-11-09 02:49:12,467 INFO L175 Difference]: Start difference. First operand has 84 places, 84 transitions, 915 flow. Second operand 5 states and 108 transitions. [2024-11-09 02:49:12,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 127 transitions, 1351 flow [2024-11-09 02:49:12,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 127 transitions, 1299 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-11-09 02:49:12,554 INFO L231 Difference]: Finished difference. Result has 88 places, 90 transitions, 1066 flow [2024-11-09 02:49:12,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1066, PETRI_PLACES=88, PETRI_TRANSITIONS=90} [2024-11-09 02:49:12,556 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 53 predicate places. [2024-11-09 02:49:12,556 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 90 transitions, 1066 flow [2024-11-09 02:49:12,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:12,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:12,556 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:12,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:49:12,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:12,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2095788596, now seen corresponding path program 2 times [2024-11-09 02:49:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:12,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346604577] [2024-11-09 02:49:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:12,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:12,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:12,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346604577] [2024-11-09 02:49:12,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346604577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:12,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:12,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:12,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067867483] [2024-11-09 02:49:12,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:12,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:12,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:12,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:12,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-09 02:49:12,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 1066 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:12,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:12,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-09 02:49:12,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:13,514 INFO L124 PetriNetUnfolderBase]: 3372/5322 cut-off events. [2024-11-09 02:49:13,515 INFO L125 PetriNetUnfolderBase]: For 38275/38780 co-relation queries the response was YES. [2024-11-09 02:49:13,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26271 conditions, 5322 events. 3372/5322 cut-off events. For 38275/38780 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 33277 event pairs, 501 based on Foata normal form. 36/5296 useless extension candidates. Maximal degree in co-relation 22364. Up to 2467 conditions per place. [2024-11-09 02:49:13,650 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 122 selfloop transitions, 82 changer transitions 2/219 dead transitions. [2024-11-09 02:49:13,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 219 transitions, 3189 flow [2024-11-09 02:49:13,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:49:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:49:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-11-09 02:49:13,652 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.63125 [2024-11-09 02:49:13,652 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 1066 flow. Second operand 5 states and 101 transitions. [2024-11-09 02:49:13,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 219 transitions, 3189 flow [2024-11-09 02:49:13,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 219 transitions, 3036 flow, removed 21 selfloop flow, removed 1 redundant places. [2024-11-09 02:49:13,749 INFO L231 Difference]: Finished difference. Result has 94 places, 151 transitions, 2256 flow [2024-11-09 02:49:13,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2256, PETRI_PLACES=94, PETRI_TRANSITIONS=151} [2024-11-09 02:49:13,750 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 59 predicate places. [2024-11-09 02:49:13,750 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 151 transitions, 2256 flow [2024-11-09 02:49:13,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:13,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:13,753 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:13,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:49:13,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:13,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:13,753 INFO L85 PathProgramCache]: Analyzing trace with hash -318411364, now seen corresponding path program 3 times [2024-11-09 02:49:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:13,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554710415] [2024-11-09 02:49:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:13,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:13,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:13,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554710415] [2024-11-09 02:49:13,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554710415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:13,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:13,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:13,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610427449] [2024-11-09 02:49:13,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:13,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:13,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:13,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:13,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:14,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-09 02:49:14,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 151 transitions, 2256 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:14,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:14,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-09 02:49:14,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:15,227 INFO L124 PetriNetUnfolderBase]: 4223/6917 cut-off events. [2024-11-09 02:49:15,227 INFO L125 PetriNetUnfolderBase]: For 49010/49648 co-relation queries the response was YES. [2024-11-09 02:49:15,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36449 conditions, 6917 events. 4223/6917 cut-off events. For 49010/49648 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 46649 event pairs, 1077 based on Foata normal form. 41/6896 useless extension candidates. Maximal degree in co-relation 30830. Up to 3408 conditions per place. [2024-11-09 02:49:15,309 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 94 selfloop transitions, 155 changer transitions 4/266 dead transitions. [2024-11-09 02:49:15,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 266 transitions, 4200 flow [2024-11-09 02:49:15,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:49:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:49:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-09 02:49:15,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-09 02:49:15,311 INFO L175 Difference]: Start difference. First operand has 94 places, 151 transitions, 2256 flow. Second operand 6 states and 126 transitions. [2024-11-09 02:49:15,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 266 transitions, 4200 flow [2024-11-09 02:49:15,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 266 transitions, 4196 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-09 02:49:15,459 INFO L231 Difference]: Finished difference. Result has 102 places, 210 transitions, 3777 flow [2024-11-09 02:49:15,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3777, PETRI_PLACES=102, PETRI_TRANSITIONS=210} [2024-11-09 02:49:15,461 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 67 predicate places. [2024-11-09 02:49:15,461 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 210 transitions, 3777 flow [2024-11-09 02:49:15,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:15,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:15,461 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:15,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:49:15,462 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:15,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash 750086166, now seen corresponding path program 4 times [2024-11-09 02:49:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:15,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499469036] [2024-11-09 02:49:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:15,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499469036] [2024-11-09 02:49:15,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499469036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:15,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:15,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:15,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998201327] [2024-11-09 02:49:15,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:15,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:15,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:15,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:15,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:15,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-11-09 02:49:15,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 210 transitions, 3777 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:15,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:15,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-11-09 02:49:15,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:16,842 INFO L124 PetriNetUnfolderBase]: 4203/6971 cut-off events. [2024-11-09 02:49:16,843 INFO L125 PetriNetUnfolderBase]: For 64975/65629 co-relation queries the response was YES. [2024-11-09 02:49:16,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40686 conditions, 6971 events. 4203/6971 cut-off events. For 64975/65629 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 48051 event pairs, 684 based on Foata normal form. 48/6941 useless extension candidates. Maximal degree in co-relation 34458. Up to 2948 conditions per place. [2024-11-09 02:49:16,977 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 116 selfloop transitions, 143 changer transitions 4/276 dead transitions. [2024-11-09 02:49:16,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 276 transitions, 5029 flow [2024-11-09 02:49:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:49:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:49:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-11-09 02:49:16,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6625 [2024-11-09 02:49:16,981 INFO L175 Difference]: Start difference. First operand has 102 places, 210 transitions, 3777 flow. Second operand 5 states and 106 transitions. [2024-11-09 02:49:16,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 276 transitions, 5029 flow [2024-11-09 02:49:17,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 276 transitions, 5007 flow, removed 11 selfloop flow, removed 0 redundant places. [2024-11-09 02:49:17,239 INFO L231 Difference]: Finished difference. Result has 110 places, 228 transitions, 4673 flow [2024-11-09 02:49:17,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3755, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4673, PETRI_PLACES=110, PETRI_TRANSITIONS=228} [2024-11-09 02:49:17,241 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2024-11-09 02:49:17,241 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 228 transitions, 4673 flow [2024-11-09 02:49:17,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:17,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:17,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:17,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:49:17,244 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:17,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1157206214, now seen corresponding path program 5 times [2024-11-09 02:49:17,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:17,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055228886] [2024-11-09 02:49:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:17,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:17,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055228886] [2024-11-09 02:49:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055228886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:17,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:17,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:17,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165716413] [2024-11-09 02:49:17,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:17,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:17,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:17,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:17,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:17,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-09 02:49:17,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 228 transitions, 4673 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:17,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:17,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-09 02:49:17,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:18,786 INFO L124 PetriNetUnfolderBase]: 5239/8265 cut-off events. [2024-11-09 02:49:18,786 INFO L125 PetriNetUnfolderBase]: For 96833/97423 co-relation queries the response was YES. [2024-11-09 02:49:18,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51677 conditions, 8265 events. 5239/8265 cut-off events. For 96833/97423 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 53294 event pairs, 1241 based on Foata normal form. 39/8261 useless extension candidates. Maximal degree in co-relation 43171. Up to 4329 conditions per place. [2024-11-09 02:49:18,891 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 104 selfloop transitions, 187 changer transitions 3/304 dead transitions. [2024-11-09 02:49:18,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 304 transitions, 5983 flow [2024-11-09 02:49:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:49:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:49:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-09 02:49:18,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-09 02:49:18,893 INFO L175 Difference]: Start difference. First operand has 110 places, 228 transitions, 4673 flow. Second operand 6 states and 126 transitions. [2024-11-09 02:49:18,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 304 transitions, 5983 flow [2024-11-09 02:49:19,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 304 transitions, 5977 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-09 02:49:19,318 INFO L231 Difference]: Finished difference. Result has 118 places, 245 transitions, 5483 flow [2024-11-09 02:49:19,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4645, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5483, PETRI_PLACES=118, PETRI_TRANSITIONS=245} [2024-11-09 02:49:19,320 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 83 predicate places. [2024-11-09 02:49:19,320 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 245 transitions, 5483 flow [2024-11-09 02:49:19,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:19,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:19,320 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:19,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:49:19,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:19,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash 365433910, now seen corresponding path program 6 times [2024-11-09 02:49:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701952166] [2024-11-09 02:49:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:19,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:19,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701952166] [2024-11-09 02:49:19,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701952166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:49:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308100677] [2024-11-09 02:49:19,507 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 02:49:19,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:49:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:49:19,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:49:19,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:49:19,580 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-09 02:49:19,580 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:49:19,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 02:49:19,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:49:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:19,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:49:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:20,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308100677] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:49:20,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:49:20,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-11-09 02:49:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191565265] [2024-11-09 02:49:20,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:49:20,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:49:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:20,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:49:20,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:49:20,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-09 02:49:20,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 245 transitions, 5483 flow. Second operand has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:20,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:20,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-09 02:49:20,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:22,727 INFO L124 PetriNetUnfolderBase]: 6801/10631 cut-off events. [2024-11-09 02:49:22,727 INFO L125 PetriNetUnfolderBase]: For 138048/138836 co-relation queries the response was YES. [2024-11-09 02:49:22,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70006 conditions, 10631 events. 6801/10631 cut-off events. For 138048/138836 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 69620 event pairs, 521 based on Foata normal form. 153/10753 useless extension candidates. Maximal degree in co-relation 58979. Up to 2847 conditions per place. [2024-11-09 02:49:22,868 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 177 selfloop transitions, 243 changer transitions 14/444 dead transitions. [2024-11-09 02:49:22,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 444 transitions, 8203 flow [2024-11-09 02:49:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 02:49:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 02:49:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 330 transitions. [2024-11-09 02:49:22,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64453125 [2024-11-09 02:49:22,871 INFO L175 Difference]: Start difference. First operand has 118 places, 245 transitions, 5483 flow. Second operand 16 states and 330 transitions. [2024-11-09 02:49:22,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 444 transitions, 8203 flow [2024-11-09 02:49:23,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 444 transitions, 7998 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-09 02:49:23,471 INFO L231 Difference]: Finished difference. Result has 138 places, 293 transitions, 6845 flow [2024-11-09 02:49:23,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5303, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6845, PETRI_PLACES=138, PETRI_TRANSITIONS=293} [2024-11-09 02:49:23,472 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 103 predicate places. [2024-11-09 02:49:23,472 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 293 transitions, 6845 flow [2024-11-09 02:49:23,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:23,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:23,473 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:23,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 02:49:23,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 02:49:23,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:23,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 284609908, now seen corresponding path program 3 times [2024-11-09 02:49:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:23,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465138179] [2024-11-09 02:49:23,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:23,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:23,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465138179] [2024-11-09 02:49:23,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465138179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:23,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:23,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:49:23,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054427783] [2024-11-09 02:49:23,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:23,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:23,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:23,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-09 02:49:23,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 293 transitions, 6845 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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) [2024-11-09 02:49:23,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:23,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-09 02:49:23,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:25,072 INFO L124 PetriNetUnfolderBase]: 4813/7835 cut-off events. [2024-11-09 02:49:25,072 INFO L125 PetriNetUnfolderBase]: For 155497/156507 co-relation queries the response was YES. [2024-11-09 02:49:25,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59861 conditions, 7835 events. 4813/7835 cut-off events. For 155497/156507 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 53408 event pairs, 854 based on Foata normal form. 123/7697 useless extension candidates. Maximal degree in co-relation 50288. Up to 6295 conditions per place. [2024-11-09 02:49:25,180 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 235 selfloop transitions, 60 changer transitions 7/328 dead transitions. [2024-11-09 02:49:25,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 328 transitions, 7644 flow [2024-11-09 02:49:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:49:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:49:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-11-09 02:49:25,182 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-11-09 02:49:25,182 INFO L175 Difference]: Start difference. First operand has 138 places, 293 transitions, 6845 flow. Second operand 5 states and 108 transitions. [2024-11-09 02:49:25,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 328 transitions, 7644 flow [2024-11-09 02:49:25,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 328 transitions, 7380 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-11-09 02:49:25,580 INFO L231 Difference]: Finished difference. Result has 139 places, 283 transitions, 6462 flow [2024-11-09 02:49:25,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6293, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6462, PETRI_PLACES=139, PETRI_TRANSITIONS=283} [2024-11-09 02:49:25,582 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2024-11-09 02:49:25,582 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 283 transitions, 6462 flow [2024-11-09 02:49:25,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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) [2024-11-09 02:49:25,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:25,582 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:25,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:49:25,583 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:25,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:25,583 INFO L85 PathProgramCache]: Analyzing trace with hash -915003742, now seen corresponding path program 7 times [2024-11-09 02:49:25,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:25,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588297403] [2024-11-09 02:49:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:25,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:25,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588297403] [2024-11-09 02:49:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588297403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:25,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939548493] [2024-11-09 02:49:25,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:25,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:25,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:25,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:25,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:25,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-09 02:49:25,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 283 transitions, 6462 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:25,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:25,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-09 02:49:25,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:27,192 INFO L124 PetriNetUnfolderBase]: 6007/9180 cut-off events. [2024-11-09 02:49:27,192 INFO L125 PetriNetUnfolderBase]: For 161900/162797 co-relation queries the response was YES. [2024-11-09 02:49:27,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67092 conditions, 9180 events. 6007/9180 cut-off events. For 161900/162797 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 57853 event pairs, 889 based on Foata normal form. 60/9192 useless extension candidates. Maximal degree in co-relation 55084. Up to 3898 conditions per place. [2024-11-09 02:49:27,284 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 160 selfloop transitions, 166 changer transitions 5/341 dead transitions. [2024-11-09 02:49:27,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 341 transitions, 7704 flow [2024-11-09 02:49:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:49:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:49:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-11-09 02:49:27,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-09 02:49:27,285 INFO L175 Difference]: Start difference. First operand has 139 places, 283 transitions, 6462 flow. Second operand 5 states and 105 transitions. [2024-11-09 02:49:27,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 341 transitions, 7704 flow [2024-11-09 02:49:27,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 341 transitions, 7337 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-09 02:49:27,853 INFO L231 Difference]: Finished difference. Result has 140 places, 280 transitions, 6484 flow [2024-11-09 02:49:27,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6023, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6484, PETRI_PLACES=140, PETRI_TRANSITIONS=280} [2024-11-09 02:49:27,854 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 105 predicate places. [2024-11-09 02:49:27,854 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 280 transitions, 6484 flow [2024-11-09 02:49:27,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:27,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:27,855 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:27,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 02:49:27,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:27,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1474280036, now seen corresponding path program 8 times [2024-11-09 02:49:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:27,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619552113] [2024-11-09 02:49:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:27,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:27,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:27,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619552113] [2024-11-09 02:49:27,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619552113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:27,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:27,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:49:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388374416] [2024-11-09 02:49:27,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:27,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:27,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:27,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:27,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:27,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-09 02:49:27,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 280 transitions, 6484 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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) [2024-11-09 02:49:27,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:27,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-09 02:49:27,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:28,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([251] L83-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (<= (mod v_~L~0_44 4294967296) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {~L~0=v_~L~0_44} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, ~L~0=v_~L~0_44, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][57], [Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 138#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 144#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 101#true, 124#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 142#(or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), 181#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 154#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 151#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 9#thread3EXITtrue, Black: 161#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 164#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 16#L99-4true, Black: 160#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 136#true, Black: 172#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 175#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 49#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 53#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 31#L53true, Black: 65#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 60#(= ~N~0 ~L~0), 361#true, 370#true, Black: 63#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 62#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 51#(<= (mod ~L~0 4294967296) 0), Black: 78#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 179#true, Black: 76#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 335#(and (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (or (and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~p~0 2) 0)))), Black: 84#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 7#thread2EXITtrue, Black: 286#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 71#true, Black: 184#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 341#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= ~p~0 0) (or (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (= ~q~0 0)), Black: 333#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (= (mod ~p~0 2) 0)), 75#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 97#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 95#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 94#(< 0 (mod ~N~0 4294967296)), Black: 358#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 106#(<= 1 (mod ~L~0 4294967296)), Black: 104#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 367#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 103#(= ~N~0 ~L~0), Black: 364#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 116#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 119#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-09 02:49:28,764 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-11-09 02:49:28,764 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-11-09 02:49:28,765 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-11-09 02:49:28,765 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-11-09 02:49:28,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([251] L83-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (<= (mod v_~L~0_44 4294967296) 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {~L~0=v_~L~0_44} OutVars{thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, ~L~0=v_~L~0_44, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][57], [Black: 128#(and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 131#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 138#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 144#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 101#true, 124#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 142#(or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), 181#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 154#(and (= thread2Thread1of1ForFork2_~cond~1 0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~N~0 4294967296) 1)))), Black: 151#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 9#thread3EXITtrue, Black: 161#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 164#(and (<= (mod ~N~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 160#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 150#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 136#true, Black: 172#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 175#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 25#L100true, Black: 49#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 53#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 31#L53true, Black: 65#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 60#(= ~N~0 ~L~0), 361#true, 370#true, Black: 63#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 62#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 51#(<= (mod ~L~0 4294967296) 0), Black: 78#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 179#true, Black: 76#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 335#(and (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (or (and (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (= (mod ~p~0 2) 0)))), Black: 84#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 7#thread2EXITtrue, Black: 286#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 71#true, Black: 184#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 341#(and (or (= thread1Thread1of1ForFork1_~cond~0 1) (= thread1Thread1of1ForFork1_~cond~0 0)) (= ~p~0 0) (or (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2) (< 0 thread1Thread1of1ForFork1_~cond~0)) (= ~q~0 0)), Black: 333#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (= (mod ~p~0 2) 0)), 75#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 97#(and (<= 1 (mod ~N~0 4294967296)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 95#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 94#(< 0 (mod ~N~0 4294967296)), Black: 358#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 106#(<= 1 (mod ~L~0 4294967296)), Black: 104#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 367#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 103#(= ~N~0 ~L~0), Black: 364#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 116#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 119#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-09 02:49:28,857 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2024-11-09 02:49:28,857 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2024-11-09 02:49:28,858 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-11-09 02:49:28,858 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2024-11-09 02:49:29,044 INFO L124 PetriNetUnfolderBase]: 4994/7993 cut-off events. [2024-11-09 02:49:29,044 INFO L125 PetriNetUnfolderBase]: For 153069/154094 co-relation queries the response was YES. [2024-11-09 02:49:29,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60211 conditions, 7993 events. 4994/7993 cut-off events. For 153069/154094 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 53349 event pairs, 902 based on Foata normal form. 120/7884 useless extension candidates. Maximal degree in co-relation 49101. Up to 6417 conditions per place. [2024-11-09 02:49:29,130 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 144 selfloop transitions, 55 changer transitions 17/318 dead transitions. [2024-11-09 02:49:29,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 318 transitions, 7279 flow [2024-11-09 02:49:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:49:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:49:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-11-09 02:49:29,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-09 02:49:29,131 INFO L175 Difference]: Start difference. First operand has 140 places, 280 transitions, 6484 flow. Second operand 5 states and 105 transitions. [2024-11-09 02:49:29,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 318 transitions, 7279 flow [2024-11-09 02:49:29,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 318 transitions, 7043 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-11-09 02:49:29,656 INFO L231 Difference]: Finished difference. Result has 142 places, 277 transitions, 6284 flow [2024-11-09 02:49:29,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6238, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6284, PETRI_PLACES=142, PETRI_TRANSITIONS=277} [2024-11-09 02:49:29,656 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 107 predicate places. [2024-11-09 02:49:29,657 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 277 transitions, 6284 flow [2024-11-09 02:49:29,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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) [2024-11-09 02:49:29,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:29,657 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:29,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 02:49:29,657 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:29,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1439566944, now seen corresponding path program 9 times [2024-11-09 02:49:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:29,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433939616] [2024-11-09 02:49:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433939616] [2024-11-09 02:49:29,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433939616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387371520] [2024-11-09 02:49:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:29,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:49:29,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:49:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:49:29,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-09 02:49:29,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 277 transitions, 6284 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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) [2024-11-09 02:49:29,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:29,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-09 02:49:29,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:31,342 INFO L124 PetriNetUnfolderBase]: 5433/8882 cut-off events. [2024-11-09 02:49:31,342 INFO L125 PetriNetUnfolderBase]: For 170106/171104 co-relation queries the response was YES. [2024-11-09 02:49:31,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66297 conditions, 8882 events. 5433/8882 cut-off events. For 170106/171104 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 61342 event pairs, 774 based on Foata normal form. 316/9001 useless extension candidates. Maximal degree in co-relation 58709. Up to 5234 conditions per place. [2024-11-09 02:49:31,618 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 172 selfloop transitions, 78 changer transitions 1/353 dead transitions. [2024-11-09 02:49:31,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 353 transitions, 7871 flow [2024-11-09 02:49:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:49:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:49:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-11-09 02:49:31,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6510416666666666 [2024-11-09 02:49:31,619 INFO L175 Difference]: Start difference. First operand has 142 places, 277 transitions, 6284 flow. Second operand 6 states and 125 transitions. [2024-11-09 02:49:31,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 353 transitions, 7871 flow [2024-11-09 02:49:32,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 353 transitions, 7524 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-11-09 02:49:32,023 INFO L231 Difference]: Finished difference. Result has 144 places, 293 transitions, 6527 flow [2024-11-09 02:49:32,023 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5988, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6527, PETRI_PLACES=144, PETRI_TRANSITIONS=293} [2024-11-09 02:49:32,024 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 109 predicate places. [2024-11-09 02:49:32,024 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 293 transitions, 6527 flow [2024-11-09 02:49:32,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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) [2024-11-09 02:49:32,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:32,024 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:32,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 02:49:32,025 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:32,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:32,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1153080196, now seen corresponding path program 10 times [2024-11-09 02:49:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:32,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409012417] [2024-11-09 02:49:32,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:32,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:32,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:32,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409012417] [2024-11-09 02:49:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409012417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:49:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857372913] [2024-11-09 02:49:32,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:32,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:32,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:32,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:32,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-11-09 02:49:32,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 293 transitions, 6527 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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) [2024-11-09 02:49:32,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:32,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-11-09 02:49:32,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:33,549 INFO L124 PetriNetUnfolderBase]: 5589/9175 cut-off events. [2024-11-09 02:49:33,549 INFO L125 PetriNetUnfolderBase]: For 187738/188883 co-relation queries the response was YES. [2024-11-09 02:49:33,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70782 conditions, 9175 events. 5589/9175 cut-off events. For 187738/188883 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 64226 event pairs, 975 based on Foata normal form. 147/9127 useless extension candidates. Maximal degree in co-relation 63443. Up to 7168 conditions per place. [2024-11-09 02:49:33,670 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 151 selfloop transitions, 80 changer transitions 5/334 dead transitions. [2024-11-09 02:49:33,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 334 transitions, 7458 flow [2024-11-09 02:49:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:49:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:49:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-11-09 02:49:33,671 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-11-09 02:49:33,671 INFO L175 Difference]: Start difference. First operand has 144 places, 293 transitions, 6527 flow. Second operand 6 states and 123 transitions. [2024-11-09 02:49:33,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 334 transitions, 7458 flow [2024-11-09 02:49:34,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 334 transitions, 7347 flow, removed 24 selfloop flow, removed 4 redundant places. [2024-11-09 02:49:34,166 INFO L231 Difference]: Finished difference. Result has 146 places, 298 transitions, 6725 flow [2024-11-09 02:49:34,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6260, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6725, PETRI_PLACES=146, PETRI_TRANSITIONS=298} [2024-11-09 02:49:34,167 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 111 predicate places. [2024-11-09 02:49:34,167 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 298 transitions, 6725 flow [2024-11-09 02:49:34,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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) [2024-11-09 02:49:34,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:34,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:34,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 02:49:34,168 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:34,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1423963428, now seen corresponding path program 1 times [2024-11-09 02:49:34,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:34,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463654442] [2024-11-09 02:49:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:34,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:34,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463654442] [2024-11-09 02:49:34,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463654442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:49:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463492268] [2024-11-09 02:49:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:34,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:49:34,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:49:34,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:49:34,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 02:49:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:34,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 02:49:34,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:49:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:34,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:49:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:35,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463492268] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:49:35,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:49:35,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-09 02:49:35,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574337461] [2024-11-09 02:49:35,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:49:35,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:49:35,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:35,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:49:35,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:49:35,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-09 02:49:35,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 298 transitions, 6725 flow. Second operand has 15 states, 15 states have (on average 14.0) internal successors, (210), 15 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:35,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:35,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-09 02:49:35,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:39,041 INFO L124 PetriNetUnfolderBase]: 13673/21556 cut-off events. [2024-11-09 02:49:39,042 INFO L125 PetriNetUnfolderBase]: For 411605/412773 co-relation queries the response was YES. [2024-11-09 02:49:39,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159887 conditions, 21556 events. 13673/21556 cut-off events. For 411605/412773 co-relation queries the response was YES. Maximal size of possible extension queue 1454. Compared 160883 event pairs, 705 based on Foata normal form. 324/21794 useless extension candidates. Maximal degree in co-relation 151216. Up to 8853 conditions per place. [2024-11-09 02:49:39,348 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 497 selfloop transitions, 395 changer transitions 8/923 dead transitions. [2024-11-09 02:49:39,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 923 transitions, 20711 flow [2024-11-09 02:49:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:49:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-09 02:49:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 322 transitions. [2024-11-09 02:49:39,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6708333333333333 [2024-11-09 02:49:39,350 INFO L175 Difference]: Start difference. First operand has 146 places, 298 transitions, 6725 flow. Second operand 15 states and 322 transitions. [2024-11-09 02:49:39,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 923 transitions, 20711 flow [2024-11-09 02:49:40,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 923 transitions, 20454 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-11-09 02:49:40,824 INFO L231 Difference]: Finished difference. Result has 154 places, 603 transitions, 14912 flow [2024-11-09 02:49:40,824 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6492, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14912, PETRI_PLACES=154, PETRI_TRANSITIONS=603} [2024-11-09 02:49:40,824 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 119 predicate places. [2024-11-09 02:49:40,824 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 603 transitions, 14912 flow [2024-11-09 02:49:40,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.0) internal successors, (210), 15 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:40,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:40,825 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:40,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 02:49:41,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:49:41,025 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:41,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash 419469264, now seen corresponding path program 2 times [2024-11-09 02:49:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:41,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239897540] [2024-11-09 02:49:41,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:41,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:41,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239897540] [2024-11-09 02:49:41,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239897540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:49:41,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466810027] [2024-11-09 02:49:41,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 02:49:41,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:49:41,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:49:41,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:49:41,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 02:49:41,524 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 02:49:41,525 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:49:41,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 02:49:41,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:49:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:41,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:49:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466810027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:49:42,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:49:42,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-09 02:49:42,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664423067] [2024-11-09 02:49:42,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:49:42,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:49:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:42,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:49:42,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:49:42,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-09 02:49:42,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 603 transitions, 14912 flow. Second operand has 13 states, 13 states have (on average 14.538461538461538) internal successors, (189), 13 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:42,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:42,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-09 02:49:42,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:47,109 INFO L124 PetriNetUnfolderBase]: 16238/25567 cut-off events. [2024-11-09 02:49:47,109 INFO L125 PetriNetUnfolderBase]: For 596683/598786 co-relation queries the response was YES. [2024-11-09 02:49:47,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207550 conditions, 25567 events. 16238/25567 cut-off events. For 596683/598786 co-relation queries the response was YES. Maximal size of possible extension queue 1876. Compared 195308 event pairs, 1885 based on Foata normal form. 578/25934 useless extension candidates. Maximal degree in co-relation 202710. Up to 18024 conditions per place. [2024-11-09 02:49:47,477 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 535 selfloop transitions, 420 changer transitions 5/983 dead transitions. [2024-11-09 02:49:47,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 983 transitions, 25692 flow [2024-11-09 02:49:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:49:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 02:49:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 217 transitions. [2024-11-09 02:49:47,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6164772727272727 [2024-11-09 02:49:47,479 INFO L175 Difference]: Start difference. First operand has 154 places, 603 transitions, 14912 flow. Second operand 11 states and 217 transitions. [2024-11-09 02:49:47,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 983 transitions, 25692 flow [2024-11-09 02:49:50,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 983 transitions, 24551 flow, removed 521 selfloop flow, removed 4 redundant places. [2024-11-09 02:49:50,404 INFO L231 Difference]: Finished difference. Result has 163 places, 823 transitions, 21470 flow [2024-11-09 02:49:50,405 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=14075, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21470, PETRI_PLACES=163, PETRI_TRANSITIONS=823} [2024-11-09 02:49:50,405 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 128 predicate places. [2024-11-09 02:49:50,405 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 823 transitions, 21470 flow [2024-11-09 02:49:50,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.538461538461538) internal successors, (189), 13 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:50,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:50,406 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:50,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 02:49:50,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:49:50,607 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-09 02:49:50,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:50,607 INFO L85 PathProgramCache]: Analyzing trace with hash 591370744, now seen corresponding path program 1 times [2024-11-09 02:49:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:50,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016257273] [2024-11-09 02:49:50,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016257273] [2024-11-09 02:49:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016257273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:49:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142186690] [2024-11-09 02:49:50,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:50,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:49:50,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:49:50,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:49:50,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 02:49:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:50,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 02:49:50,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:49:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:51,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:49:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:49:51,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142186690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:49:51,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:49:51,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 21 [2024-11-09 02:49:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205318770] [2024-11-09 02:49:51,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:49:51,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 02:49:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:51,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 02:49:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2024-11-09 02:49:51,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-09 02:49:51,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 823 transitions, 21470 flow. Second operand has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:51,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:51,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-09 02:49:51,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:50:12,338 INFO L124 PetriNetUnfolderBase]: 53111/79260 cut-off events. [2024-11-09 02:50:12,338 INFO L125 PetriNetUnfolderBase]: For 1719697/1719702 co-relation queries the response was YES. [2024-11-09 02:50:13,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638046 conditions, 79260 events. 53111/79260 cut-off events. For 1719697/1719702 co-relation queries the response was YES. Maximal size of possible extension queue 3536. Compared 602686 event pairs, 1694 based on Foata normal form. 1650/80908 useless extension candidates. Maximal degree in co-relation 629508. Up to 17912 conditions per place. [2024-11-09 02:50:13,922 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1821 selfloop transitions, 2741 changer transitions 0/4566 dead transitions. [2024-11-09 02:50:13,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 4566 transitions, 109428 flow [2024-11-09 02:50:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-09 02:50:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2024-11-09 02:50:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 1389 transitions. [2024-11-09 02:50:13,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5711348684210527 [2024-11-09 02:50:13,927 INFO L175 Difference]: Start difference. First operand has 163 places, 823 transitions, 21470 flow. Second operand 76 states and 1389 transitions. [2024-11-09 02:50:13,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 4566 transitions, 109428 flow