./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/parallel-ticket-4.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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:30:38,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:30:38,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:30:38,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:30:38,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:30:38,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:30:38,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:30:38,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:30:38,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:30:38,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:30:38,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:30:38,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:30:38,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:30:38,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:30:38,489 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:30:38,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:30:38,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:30:38,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:30:38,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:30:38,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:30:38,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:30:38,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:30:38,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:30:38,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:30:38,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:30:38,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:30:38,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:30:38,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:30:38,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:30:38,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:30:38,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:30:38,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:30:38,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:30:38,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:30:38,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:30:38,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:30:38,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:30:38,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:30:38,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:30:38,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:30:38,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:30:38,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:30:38,498 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2024-11-10 10:30:38,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:30:38,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:30:38,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:30:38,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:30:38,697 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:30:38,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-10 10:30:39,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:30:40,107 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:30:40,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-10 10:30:40,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158ceb0b2/abc1167c7bd9459888e649723401d1f8/FLAG43a4c414b [2024-11-10 10:30:40,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158ceb0b2/abc1167c7bd9459888e649723401d1f8 [2024-11-10 10:30:40,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:30:40,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:30:40,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:30:40,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:30:40,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:30:40,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4587db7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40, skipping insertion in model container [2024-11-10 10:30:40,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:30:40,345 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/parallel-ticket-4.wvr.c[2554,2567] [2024-11-10 10:30:40,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:30:40,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:30:40,384 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/parallel-ticket-4.wvr.c[2554,2567] [2024-11-10 10:30:40,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:30:40,401 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:30:40,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40 WrapperNode [2024-11-10 10:30:40,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:30:40,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:30:40,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:30:40,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:30:40,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,444 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-10 10:30:40,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:30:40,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:30:40,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:30:40,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:30:40,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,472 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-10 10:30:40,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:30:40,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:30:40,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:30:40,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:30:40,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (1/1) ... [2024-11-10 10:30:40,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:30:40,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:30:40,514 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-10 10:30:40,515 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-10 10:30:40,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:30:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 10:30:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 10:30:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 10:30:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 10:30:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 10:30:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 10:30:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-10 10:30:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-10 10:30:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:30:40,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:30:40,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:30:40,555 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:30:40,637 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:30:40,639 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:30:40,858 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:30:40,858 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:30:40,995 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:30:40,995 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:30:40,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:30:40 BoogieIcfgContainer [2024-11-10 10:30:40,997 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:30:40,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:30:40,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:30:41,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:30:41,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:30:40" (1/3) ... [2024-11-10 10:30:41,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c95face and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:30:41, skipping insertion in model container [2024-11-10 10:30:41,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:30:40" (2/3) ... [2024-11-10 10:30:41,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c95face and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:30:41, skipping insertion in model container [2024-11-10 10:30:41,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:30:40" (3/3) ... [2024-11-10 10:30:41,006 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-11-10 10:30:41,019 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:30:41,020 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:30:41,020 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:30:41,082 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-10 10:30:41,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 146 flow [2024-11-10 10:30:41,147 INFO L124 PetriNetUnfolderBase]: 3/55 cut-off events. [2024-11-10 10:30:41,147 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:30:41,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 3/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-10 10:30:41,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 59 transitions, 146 flow [2024-11-10 10:30:41,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 54 transitions, 132 flow [2024-11-10 10:30:41,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:30:41,172 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;@3603d546, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:30:41,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:30:41,190 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:30:41,191 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2024-11-10 10:30:41,191 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:30:41,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:41,192 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, 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-10 10:30:41,192 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 2 more)] === [2024-11-10 10:30:41,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:41,197 INFO L85 PathProgramCache]: Analyzing trace with hash 91534751, now seen corresponding path program 1 times [2024-11-10 10:30:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:41,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626956854] [2024-11-10 10:30:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:41,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:41,559 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-10 10:30:41,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:41,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626956854] [2024-11-10 10:30:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626956854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:41,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:41,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:30:41,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895747030] [2024-11-10 10:30:41,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:41,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:30:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:41,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:30:41,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:30:41,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:30:41,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-10 10:30:41,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:41,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:30:41,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:43,293 INFO L124 PetriNetUnfolderBase]: 17631/24113 cut-off events. [2024-11-10 10:30:43,295 INFO L125 PetriNetUnfolderBase]: For 1365/1365 co-relation queries the response was YES. [2024-11-10 10:30:43,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48642 conditions, 24113 events. 17631/24113 cut-off events. For 1365/1365 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 139193 event pairs, 6173 based on Foata normal form. 1/23348 useless extension candidates. Maximal degree in co-relation 45351. Up to 14774 conditions per place. [2024-11-10 10:30:43,526 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 66 selfloop transitions, 6 changer transitions 1/84 dead transitions. [2024-11-10 10:30:43,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 356 flow [2024-11-10 10:30:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:30:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:30:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-11-10 10:30:43,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2024-11-10 10:30:43,536 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 3 states and 119 transitions. [2024-11-10 10:30:43,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 356 flow [2024-11-10 10:30:43,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 328 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-10 10:30:43,557 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2024-11-10 10:30:43,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-11-10 10:30:43,561 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2024-11-10 10:30:43,561 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2024-11-10 10:30:43,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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-10 10:30:43,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:43,561 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, 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-10 10:30:43,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:30:43,562 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 2 more)] === [2024-11-10 10:30:43,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1023503031, now seen corresponding path program 1 times [2024-11-10 10:30:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037280004] [2024-11-10 10:30:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:43,706 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-10 10:30:43,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037280004] [2024-11-10 10:30:43,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037280004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:43,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:43,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:30:43,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525372664] [2024-11-10 10:30:43,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:43,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:30:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:43,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:30:43,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:30:43,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:30:43,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:43,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:43,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:30:43,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:46,284 INFO L124 PetriNetUnfolderBase]: 37141/53406 cut-off events. [2024-11-10 10:30:46,284 INFO L125 PetriNetUnfolderBase]: For 6178/6178 co-relation queries the response was YES. [2024-11-10 10:30:46,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112069 conditions, 53406 events. 37141/53406 cut-off events. For 6178/6178 co-relation queries the response was YES. Maximal size of possible extension queue 2202. Compared 373035 event pairs, 9960 based on Foata normal form. 751/52213 useless extension candidates. Maximal degree in co-relation 40621. Up to 17109 conditions per place. [2024-11-10 10:30:46,704 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 119 selfloop transitions, 19 changer transitions 0/149 dead transitions. [2024-11-10 10:30:46,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 149 transitions, 665 flow [2024-11-10 10:30:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:30:46,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:30:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2024-11-10 10:30:46,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.688135593220339 [2024-11-10 10:30:46,707 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 5 states and 203 transitions. [2024-11-10 10:30:46,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 149 transitions, 665 flow [2024-11-10 10:30:46,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 149 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:30:46,716 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 252 flow [2024-11-10 10:30:46,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2024-11-10 10:30:46,717 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2024-11-10 10:30:46,717 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 252 flow [2024-11-10 10:30:46,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:46,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:46,718 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, 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-10 10:30:46,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:30:46,718 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 2 more)] === [2024-11-10 10:30:46,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash 205774361, now seen corresponding path program 2 times [2024-11-10 10:30:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177371668] [2024-11-10 10:30:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:46,798 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-10 10:30:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:46,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177371668] [2024-11-10 10:30:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177371668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:46,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:30:46,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302963633] [2024-11-10 10:30:46,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:46,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:30:46,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:46,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:30:46,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:30:46,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2024-11-10 10:30:46,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-10 10:30:46,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:46,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2024-11-10 10:30:46,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:49,267 INFO L124 PetriNetUnfolderBase]: 33558/47690 cut-off events. [2024-11-10 10:30:49,268 INFO L125 PetriNetUnfolderBase]: For 26000/26046 co-relation queries the response was YES. [2024-11-10 10:30:49,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121102 conditions, 47690 events. 33558/47690 cut-off events. For 26000/26046 co-relation queries the response was YES. Maximal size of possible extension queue 1939. Compared 324950 event pairs, 19143 based on Foata normal form. 4685/51989 useless extension candidates. Maximal degree in co-relation 62474. Up to 38443 conditions per place. [2024-11-10 10:30:49,550 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 97 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2024-11-10 10:30:49,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 597 flow [2024-11-10 10:30:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:30:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:30:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-11-10 10:30:49,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6045197740112994 [2024-11-10 10:30:49,558 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 252 flow. Second operand 3 states and 107 transitions. [2024-11-10 10:30:49,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 597 flow [2024-11-10 10:30:49,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 110 transitions, 597 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:49,565 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 273 flow [2024-11-10 10:30:49,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2024-11-10 10:30:49,566 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2024-11-10 10:30:49,566 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 273 flow [2024-11-10 10:30:49,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-10 10:30:49,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:49,567 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, 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-10 10:30:49,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:30:49,567 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 2 more)] === [2024-11-10 10:30:49,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:49,567 INFO L85 PathProgramCache]: Analyzing trace with hash -149089447, now seen corresponding path program 1 times [2024-11-10 10:30:49,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:49,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352971721] [2024-11-10 10:30:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:49,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:49,687 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-10 10:30:49,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352971721] [2024-11-10 10:30:49,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352971721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:49,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:30:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845328204] [2024-11-10 10:30:49,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:49,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:30:49,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:49,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:30:49,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:30:49,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:30:49,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:49,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:49,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:30:49,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:52,495 INFO L124 PetriNetUnfolderBase]: 31674/46277 cut-off events. [2024-11-10 10:30:52,495 INFO L125 PetriNetUnfolderBase]: For 30065/30095 co-relation queries the response was YES. [2024-11-10 10:30:52,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120096 conditions, 46277 events. 31674/46277 cut-off events. For 30065/30095 co-relation queries the response was YES. Maximal size of possible extension queue 1920. Compared 328086 event pairs, 8273 based on Foata normal form. 548/46492 useless extension candidates. Maximal degree in co-relation 64535. Up to 15584 conditions per place. [2024-11-10 10:30:52,820 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 112 selfloop transitions, 24 changer transitions 3/150 dead transitions. [2024-11-10 10:30:52,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 150 transitions, 805 flow [2024-11-10 10:30:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:30:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:30:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2024-11-10 10:30:52,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6745762711864407 [2024-11-10 10:30:52,822 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 273 flow. Second operand 5 states and 199 transitions. [2024-11-10 10:30:52,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 150 transitions, 805 flow [2024-11-10 10:30:52,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 150 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:30:52,868 INFO L231 Difference]: Finished difference. Result has 71 places, 79 transitions, 364 flow [2024-11-10 10:30:52,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=71, PETRI_TRANSITIONS=79} [2024-11-10 10:30:52,868 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2024-11-10 10:30:52,869 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 79 transitions, 364 flow [2024-11-10 10:30:52,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:52,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:52,869 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, 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-10 10:30:52,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:30:52,869 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 2 more)] === [2024-11-10 10:30:52,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash -260426727, now seen corresponding path program 2 times [2024-11-10 10:30:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:52,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872022886] [2024-11-10 10:30:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:52,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:53,044 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-10 10:30:53,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872022886] [2024-11-10 10:30:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872022886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:53,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:53,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:30:53,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903720876] [2024-11-10 10:30:53,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:53,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:30:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:53,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:30:53,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:30:53,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:30:53,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 79 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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-10 10:30:53,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:53,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:30:53,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:55,604 INFO L124 PetriNetUnfolderBase]: 31731/47375 cut-off events. [2024-11-10 10:30:55,604 INFO L125 PetriNetUnfolderBase]: For 43137/43151 co-relation queries the response was YES. [2024-11-10 10:30:55,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129960 conditions, 47375 events. 31731/47375 cut-off events. For 43137/43151 co-relation queries the response was YES. Maximal size of possible extension queue 2014. Compared 348653 event pairs, 6398 based on Foata normal form. 328/47331 useless extension candidates. Maximal degree in co-relation 81956. Up to 18586 conditions per place. [2024-11-10 10:30:55,821 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 130 selfloop transitions, 61 changer transitions 7/209 dead transitions. [2024-11-10 10:30:55,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 209 transitions, 1270 flow [2024-11-10 10:30:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:30:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:30:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2024-11-10 10:30:55,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6751412429378532 [2024-11-10 10:30:55,823 INFO L175 Difference]: Start difference. First operand has 71 places, 79 transitions, 364 flow. Second operand 6 states and 239 transitions. [2024-11-10 10:30:55,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 209 transitions, 1270 flow [2024-11-10 10:30:55,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 209 transitions, 1224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:30:55,854 INFO L231 Difference]: Finished difference. Result has 77 places, 116 transitions, 773 flow [2024-11-10 10:30:55,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=773, PETRI_PLACES=77, PETRI_TRANSITIONS=116} [2024-11-10 10:30:55,855 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2024-11-10 10:30:55,855 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 116 transitions, 773 flow [2024-11-10 10:30:55,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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-10 10:30:55,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:55,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, 1, 1, 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-10 10:30:55,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:30:55,856 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 2 more)] === [2024-11-10 10:30:55,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2058507545, now seen corresponding path program 3 times [2024-11-10 10:30:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:55,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305564456] [2024-11-10 10:30:55,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:55,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:55,901 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-10 10:30:55,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:55,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305564456] [2024-11-10 10:30:55,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305564456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:55,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:55,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:30:55,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905685126] [2024-11-10 10:30:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:55,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:30:55,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:55,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:30:55,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:30:55,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 59 [2024-11-10 10:30:55,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 116 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:55,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:55,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 59 [2024-11-10 10:30:55,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:30:59,455 INFO L124 PetriNetUnfolderBase]: 42584/60097 cut-off events. [2024-11-10 10:30:59,455 INFO L125 PetriNetUnfolderBase]: For 97660/97670 co-relation queries the response was YES. [2024-11-10 10:30:59,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183013 conditions, 60097 events. 42584/60097 cut-off events. For 97660/97670 co-relation queries the response was YES. Maximal size of possible extension queue 2180. Compared 402185 event pairs, 26316 based on Foata normal form. 632/60715 useless extension candidates. Maximal degree in co-relation 124377. Up to 52328 conditions per place. [2024-11-10 10:30:59,712 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 162 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2024-11-10 10:30:59,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 169 transitions, 1457 flow [2024-11-10 10:30:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:30:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:30:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-11-10 10:30:59,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5706214689265536 [2024-11-10 10:30:59,713 INFO L175 Difference]: Start difference. First operand has 77 places, 116 transitions, 773 flow. Second operand 3 states and 101 transitions. [2024-11-10 10:30:59,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 169 transitions, 1457 flow [2024-11-10 10:30:59,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 169 transitions, 1441 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-11-10 10:30:59,811 INFO L231 Difference]: Finished difference. Result has 80 places, 116 transitions, 771 flow [2024-11-10 10:30:59,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=80, PETRI_TRANSITIONS=116} [2024-11-10 10:30:59,812 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places. [2024-11-10 10:30:59,812 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 116 transitions, 771 flow [2024-11-10 10:30:59,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:30:59,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:59,812 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, 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-10 10:30:59,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:30:59,812 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 2 more)] === [2024-11-10 10:30:59,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1222303837, now seen corresponding path program 4 times [2024-11-10 10:30:59,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:59,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817798792] [2024-11-10 10:30:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:59,938 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-10 10:30:59,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:59,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817798792] [2024-11-10 10:30:59,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817798792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:30:59,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:30:59,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:30:59,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323106748] [2024-11-10 10:30:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:30:59,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:30:59,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:59,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:30:59,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:30:59,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:30:59,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 116 transitions, 771 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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-10 10:30:59,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:59,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:30:59,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:31:03,121 INFO L124 PetriNetUnfolderBase]: 32320/47774 cut-off events. [2024-11-10 10:31:03,121 INFO L125 PetriNetUnfolderBase]: For 90469/90570 co-relation queries the response was YES. [2024-11-10 10:31:03,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156592 conditions, 47774 events. 32320/47774 cut-off events. For 90469/90570 co-relation queries the response was YES. Maximal size of possible extension queue 2137. Compared 347975 event pairs, 6496 based on Foata normal form. 601/47464 useless extension candidates. Maximal degree in co-relation 103869. Up to 18527 conditions per place. [2024-11-10 10:31:03,300 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 132 selfloop transitions, 69 changer transitions 5/217 dead transitions. [2024-11-10 10:31:03,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 217 transitions, 1597 flow [2024-11-10 10:31:03,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:31:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:31:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 240 transitions. [2024-11-10 10:31:03,302 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2024-11-10 10:31:03,302 INFO L175 Difference]: Start difference. First operand has 80 places, 116 transitions, 771 flow. Second operand 6 states and 240 transitions. [2024-11-10 10:31:03,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 217 transitions, 1597 flow [2024-11-10 10:31:03,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 217 transitions, 1577 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:31:03,432 INFO L231 Difference]: Finished difference. Result has 84 places, 124 transitions, 1008 flow [2024-11-10 10:31:03,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1008, PETRI_PLACES=84, PETRI_TRANSITIONS=124} [2024-11-10 10:31:03,432 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 20 predicate places. [2024-11-10 10:31:03,433 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 124 transitions, 1008 flow [2024-11-10 10:31:03,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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-10 10:31:03,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:31:03,433 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, 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-10 10:31:03,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:31:03,433 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 2 more)] === [2024-11-10 10:31:03,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:31:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash 536050155, now seen corresponding path program 5 times [2024-11-10 10:31:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:31:03,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462842410] [2024-11-10 10:31:03,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:31:03,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:31:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:31:03,532 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-10 10:31:03,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:31:03,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462842410] [2024-11-10 10:31:03,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462842410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:31:03,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:31:03,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:31:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315997868] [2024-11-10 10:31:03,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:31:03,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:31:03,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:31:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:31:03,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:31:03,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:31:03,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 124 transitions, 1008 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 10:31:03,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:31:03,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:31:03,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:31:06,835 INFO L124 PetriNetUnfolderBase]: 33742/50118 cut-off events. [2024-11-10 10:31:06,835 INFO L125 PetriNetUnfolderBase]: For 143003/143116 co-relation queries the response was YES. [2024-11-10 10:31:06,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176521 conditions, 50118 events. 33742/50118 cut-off events. For 143003/143116 co-relation queries the response was YES. Maximal size of possible extension queue 2221. Compared 370573 event pairs, 6915 based on Foata normal form. 674/49816 useless extension candidates. Maximal degree in co-relation 117903. Up to 18589 conditions per place. [2024-11-10 10:31:07,118 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 162 selfloop transitions, 88 changer transitions 3/264 dead transitions. [2024-11-10 10:31:07,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 264 transitions, 2172 flow [2024-11-10 10:31:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:31:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:31:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 308 transitions. [2024-11-10 10:31:07,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.652542372881356 [2024-11-10 10:31:07,120 INFO L175 Difference]: Start difference. First operand has 84 places, 124 transitions, 1008 flow. Second operand 8 states and 308 transitions. [2024-11-10 10:31:07,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 264 transitions, 2172 flow [2024-11-10 10:31:07,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 264 transitions, 2030 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 10:31:07,195 INFO L231 Difference]: Finished difference. Result has 89 places, 143 transitions, 1335 flow [2024-11-10 10:31:07,196 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1335, PETRI_PLACES=89, PETRI_TRANSITIONS=143} [2024-11-10 10:31:07,196 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 25 predicate places. [2024-11-10 10:31:07,196 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 143 transitions, 1335 flow [2024-11-10 10:31:07,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 10:31:07,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:31:07,197 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, 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-10 10:31:07,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:31:07,197 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 2 more)] === [2024-11-10 10:31:07,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:31:07,198 INFO L85 PathProgramCache]: Analyzing trace with hash 647787321, now seen corresponding path program 1 times [2024-11-10 10:31:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:31:07,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793376306] [2024-11-10 10:31:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:31:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:31:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:31:07,521 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-10 10:31:07,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:31:07,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793376306] [2024-11-10 10:31:07,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793376306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:31:07,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:31:07,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:31:07,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313114369] [2024-11-10 10:31:07,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:31:07,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:31:07,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:31:07,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:31:07,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:31:07,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:31:07,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 143 transitions, 1335 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:31:07,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:31:07,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:31:07,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:31:10,414 INFO L124 PetriNetUnfolderBase]: 30196/45657 cut-off events. [2024-11-10 10:31:10,414 INFO L125 PetriNetUnfolderBase]: For 151760/151798 co-relation queries the response was YES. [2024-11-10 10:31:10,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161266 conditions, 45657 events. 30196/45657 cut-off events. For 151760/151798 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 341452 event pairs, 8797 based on Foata normal form. 386/45417 useless extension candidates. Maximal degree in co-relation 117236. Up to 20540 conditions per place. [2024-11-10 10:31:10,646 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 124 selfloop transitions, 71 changer transitions 23/229 dead transitions. [2024-11-10 10:31:10,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 229 transitions, 2288 flow [2024-11-10 10:31:10,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:31:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:31:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2024-11-10 10:31:10,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6677966101694915 [2024-11-10 10:31:10,648 INFO L175 Difference]: Start difference. First operand has 89 places, 143 transitions, 1335 flow. Second operand 5 states and 197 transitions. [2024-11-10 10:31:10,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 229 transitions, 2288 flow [2024-11-10 10:31:10,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 229 transitions, 2152 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:31:10,787 INFO L231 Difference]: Finished difference. Result has 92 places, 147 transitions, 1475 flow [2024-11-10 10:31:10,788 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1475, PETRI_PLACES=92, PETRI_TRANSITIONS=147} [2024-11-10 10:31:10,788 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 28 predicate places. [2024-11-10 10:31:10,788 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 147 transitions, 1475 flow [2024-11-10 10:31:10,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:31:10,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:31:10,789 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, 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-10 10:31:10,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:31:10,789 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 2 more)] === [2024-11-10 10:31:10,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:31:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1191208457, now seen corresponding path program 2 times [2024-11-10 10:31:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:31:10,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884159350] [2024-11-10 10:31:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:31:10,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:31:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:31:10,922 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-10 10:31:10,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:31:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884159350] [2024-11-10 10:31:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884159350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:31:10,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:31:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:31:10,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273996984] [2024-11-10 10:31:10,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:31:10,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:31:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:31:10,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:31:10,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:31:10,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:31:10,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 147 transitions, 1475 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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-10 10:31:10,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:31:10,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:31:10,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:31:13,483 INFO L124 PetriNetUnfolderBase]: 24346/36357 cut-off events. [2024-11-10 10:31:13,483 INFO L125 PetriNetUnfolderBase]: For 102616/102718 co-relation queries the response was YES. [2024-11-10 10:31:13,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128862 conditions, 36357 events. 24346/36357 cut-off events. For 102616/102718 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 258779 event pairs, 6068 based on Foata normal form. 444/36165 useless extension candidates. Maximal degree in co-relation 91938. Up to 14106 conditions per place. [2024-11-10 10:31:13,656 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 130 selfloop transitions, 89 changer transitions 13/243 dead transitions. [2024-11-10 10:31:13,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 243 transitions, 2355 flow [2024-11-10 10:31:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:31:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:31:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 240 transitions. [2024-11-10 10:31:13,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2024-11-10 10:31:13,658 INFO L175 Difference]: Start difference. First operand has 92 places, 147 transitions, 1475 flow. Second operand 6 states and 240 transitions. [2024-11-10 10:31:13,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 243 transitions, 2355 flow [2024-11-10 10:31:13,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 243 transitions, 2219 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-10 10:31:13,742 INFO L231 Difference]: Finished difference. Result has 95 places, 145 transitions, 1522 flow [2024-11-10 10:31:13,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1522, PETRI_PLACES=95, PETRI_TRANSITIONS=145} [2024-11-10 10:31:13,742 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 31 predicate places. [2024-11-10 10:31:13,742 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 145 transitions, 1522 flow [2024-11-10 10:31:13,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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-10 10:31:13,743 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:31:13,743 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, 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-10 10:31:13,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:31:13,743 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 2 more)] === [2024-11-10 10:31:13,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:31:13,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1007739989, now seen corresponding path program 3 times [2024-11-10 10:31:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:31:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821913114] [2024-11-10 10:31:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:31:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:31:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:31:13,826 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-10 10:31:13,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:31:13,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821913114] [2024-11-10 10:31:13,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821913114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:31:13,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:31:13,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:31:13,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621657560] [2024-11-10 10:31:13,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:31:13,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:31:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:31:13,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:31:13,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:31:13,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:31:13,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 145 transitions, 1522 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 10:31:13,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:31:13,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:31:13,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:31:16,694 INFO L124 PetriNetUnfolderBase]: 23683/35747 cut-off events. [2024-11-10 10:31:16,694 INFO L125 PetriNetUnfolderBase]: For 120176/120244 co-relation queries the response was YES. [2024-11-10 10:31:16,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130185 conditions, 35747 events. 23683/35747 cut-off events. For 120176/120244 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 257671 event pairs, 5945 based on Foata normal form. 370/35537 useless extension candidates. Maximal degree in co-relation 93205. Up to 13386 conditions per place. [2024-11-10 10:31:16,845 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 150 selfloop transitions, 102 changer transitions 17/280 dead transitions. [2024-11-10 10:31:16,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 280 transitions, 2776 flow [2024-11-10 10:31:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:31:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:31:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 308 transitions. [2024-11-10 10:31:16,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.652542372881356 [2024-11-10 10:31:16,847 INFO L175 Difference]: Start difference. First operand has 95 places, 145 transitions, 1522 flow. Second operand 8 states and 308 transitions. [2024-11-10 10:31:16,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 280 transitions, 2776 flow [2024-11-10 10:31:16,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 280 transitions, 2611 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 10:31:16,954 INFO L231 Difference]: Finished difference. Result has 100 places, 158 transitions, 1806 flow [2024-11-10 10:31:16,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1806, PETRI_PLACES=100, PETRI_TRANSITIONS=158} [2024-11-10 10:31:16,955 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 36 predicate places. [2024-11-10 10:31:16,955 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 158 transitions, 1806 flow [2024-11-10 10:31:16,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 10:31:16,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:31:16,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, 1, 1, 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-10 10:31:16,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:31:16,955 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 2 more)] === [2024-11-10 10:31:16,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:31:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1980697713, now seen corresponding path program 6 times [2024-11-10 10:31:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:31:16,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960917950] [2024-11-10 10:31:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:31:16,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:31:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:31:17,047 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-10 10:31:17,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:31:17,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960917950] [2024-11-10 10:31:17,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960917950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:31:17,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:31:17,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:31:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894603654] [2024-11-10 10:31:17,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:31:17,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:31:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:31:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:31:17,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:31:17,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:31:17,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 158 transitions, 1806 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 10:31:17,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:31:17,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:31:17,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:31:19,047 INFO L124 PetriNetUnfolderBase]: 17601/27138 cut-off events. [2024-11-10 10:31:19,048 INFO L125 PetriNetUnfolderBase]: For 96634/96702 co-relation queries the response was YES. [2024-11-10 10:31:19,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99786 conditions, 27138 events. 17601/27138 cut-off events. For 96634/96702 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 193223 event pairs, 4575 based on Foata normal form. 276/27104 useless extension candidates. Maximal degree in co-relation 77603. Up to 9910 conditions per place. [2024-11-10 10:31:19,131 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 131 selfloop transitions, 110 changer transitions 26/278 dead transitions. [2024-11-10 10:31:19,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 278 transitions, 3108 flow [2024-11-10 10:31:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:31:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:31:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 293 transitions. [2024-11-10 10:31:19,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6207627118644068 [2024-11-10 10:31:19,133 INFO L175 Difference]: Start difference. First operand has 100 places, 158 transitions, 1806 flow. Second operand 8 states and 293 transitions. [2024-11-10 10:31:19,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 278 transitions, 3108 flow [2024-11-10 10:31:19,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 278 transitions, 3063 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:31:19,212 INFO L231 Difference]: Finished difference. Result has 107 places, 164 transitions, 2128 flow [2024-11-10 10:31:19,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2128, PETRI_PLACES=107, PETRI_TRANSITIONS=164} [2024-11-10 10:31:19,213 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 43 predicate places. [2024-11-10 10:31:19,213 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 164 transitions, 2128 flow [2024-11-10 10:31:19,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 10:31:19,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:31:19,213 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, 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-10 10:31:19,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:31:19,214 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 2 more)] === [2024-11-10 10:31:19,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:31:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1153095419, now seen corresponding path program 7 times [2024-11-10 10:31:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:31:19,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063677183] [2024-11-10 10:31:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:31:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:31:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:31:19,290 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-10 10:31:19,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:31:19,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063677183] [2024-11-10 10:31:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063677183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:31:19,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:31:19,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:31:19,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577311527] [2024-11-10 10:31:19,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:31:19,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:31:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:31:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:31:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:31:19,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-10 10:31:19,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 164 transitions, 2128 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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-10 10:31:19,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:31:19,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-10 10:31:19,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand