./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.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 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:38:33,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:38:33,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:38:33,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:38:33,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:38:33,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:38:33,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:38:33,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:38:33,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:38:33,721 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:38:33,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:38:33,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:38:33,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:38:33,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:38:33,722 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:38:33,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:38:33,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:38:33,722 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:38:33,723 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:38:33,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:38:33,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:38:33,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:38:33,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:38:33,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:38:33,724 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:38:33,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:38:33,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:38:33,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:38:33,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:38:33,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:38:33,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:38:33,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:38:33,725 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2025-03-08 17:38:33,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:38:33,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:38:33,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:38:33,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:38:33,940 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:38:33,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-03-08 17:38:35,068 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8283d15/cdcb8445e37946268e2996f7db866970/FLAG7bd1e7f76 [2025-03-08 17:38:35,286 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:38:35,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-03-08 17:38:35,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8283d15/cdcb8445e37946268e2996f7db866970/FLAG7bd1e7f76 [2025-03-08 17:38:35,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8283d15/cdcb8445e37946268e2996f7db866970 [2025-03-08 17:38:35,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:38:35,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:38:35,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:38:35,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:38:35,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:38:35,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d327a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35, skipping insertion in model container [2025-03-08 17:38:35,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:38:35,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-03-08 17:38:35,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:38:35,466 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:38:35,487 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-03-08 17:38:35,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:38:35,500 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:38:35,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35 WrapperNode [2025-03-08 17:38:35,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:38:35,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:38:35,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:38:35,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:38:35,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,527 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-03-08 17:38:35,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:38:35,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:38:35,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:38:35,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:38:35,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,556 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]. [2025-03-08 17:38:35,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:38:35,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:38:35,574 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:38:35,574 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:38:35,575 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (1/1) ... [2025-03-08 17:38:35,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:38:35,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:38:35,603 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) [2025-03-08 17:38:35,607 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 [2025-03-08 17:38:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:38:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:38:35,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:38:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:38:35,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:38:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:38:35,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:38:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:38:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 17:38:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 17:38:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:38:35,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:38:35,624 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:38:35,687 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:38:35,688 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:38:35,874 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:38:35,874 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:38:35,991 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:38:35,991 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:38:35,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:35 BoogieIcfgContainer [2025-03-08 17:38:35,995 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:38:35,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:38:35,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:38:36,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:38:36,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:38:35" (1/3) ... [2025-03-08 17:38:36,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eec93f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:36, skipping insertion in model container [2025-03-08 17:38:36,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:38:35" (2/3) ... [2025-03-08 17:38:36,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eec93f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:38:36, skipping insertion in model container [2025-03-08 17:38:36,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:38:35" (3/3) ... [2025-03-08 17:38:36,004 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-03-08 17:38:36,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:38:36,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 17:38:36,018 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:38:36,067 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:38:36,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2025-03-08 17:38:36,125 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-03-08 17:38:36,127 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:38:36,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-03-08 17:38:36,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2025-03-08 17:38:36,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2025-03-08 17:38:36,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:38:36,144 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;@31a7fd0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:38:36,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:38:36,152 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:38:36,152 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-03-08 17:38:36,152 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:38:36,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:36,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:36,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:36,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1169081364, now seen corresponding path program 1 times [2025-03-08 17:38:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:36,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77880268] [2025-03-08 17:38:36,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:36,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:38:36,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:38:36,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:36,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:36,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:36,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77880268] [2025-03-08 17:38:36,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77880268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:36,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:36,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:38:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183345577] [2025-03-08 17:38:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:36,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:38:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:36,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:38:36,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:38:36,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-08 17:38:36,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:36,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:36,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-08 17:38:36,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:36,985 INFO L124 PetriNetUnfolderBase]: 644/1018 cut-off events. [2025-03-08 17:38:36,985 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-03-08 17:38:36,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1018 events. 644/1018 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4505 event pairs, 47 based on Foata normal form. 35/1040 useless extension candidates. Maximal degree in co-relation 1805. Up to 727 conditions per place. [2025-03-08 17:38:36,992 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 43 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-03-08 17:38:36,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 236 flow [2025-03-08 17:38:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:38:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:38:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-08 17:38:37,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2025-03-08 17:38:37,002 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 4 states and 89 transitions. [2025-03-08 17:38:37,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 236 flow [2025-03-08 17:38:37,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:38:37,009 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2025-03-08 17:38:37,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-08 17:38:37,015 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-03-08 17:38:37,015 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2025-03-08 17:38:37,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:37,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:37,016 INFO L206 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] [2025-03-08 17:38:37,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:38:37,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:37,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:37,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1231191540, now seen corresponding path program 1 times [2025-03-08 17:38:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:37,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038230844] [2025-03-08 17:38:37,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:37,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:37,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:38:37,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:38:37,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:37,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038230844] [2025-03-08 17:38:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038230844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:37,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:38:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550806319] [2025-03-08 17:38:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:37,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:38:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:37,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:38:37,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:38:37,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-08 17:38:37,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:37,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:37,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-08 17:38:37,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:37,643 INFO L124 PetriNetUnfolderBase]: 1225/1894 cut-off events. [2025-03-08 17:38:37,644 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2025-03-08 17:38:37,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4249 conditions, 1894 events. 1225/1894 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9390 event pairs, 384 based on Foata normal form. 28/1910 useless extension candidates. Maximal degree in co-relation 2782. Up to 1047 conditions per place. [2025-03-08 17:38:37,654 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 67 selfloop transitions, 20 changer transitions 0/93 dead transitions. [2025-03-08 17:38:37,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 93 transitions, 450 flow [2025-03-08 17:38:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:38:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:38:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-03-08 17:38:37,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-03-08 17:38:37,657 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 5 states and 120 transitions. [2025-03-08 17:38:37,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 93 transitions, 450 flow [2025-03-08 17:38:37,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 450 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:38:37,660 INFO L231 Difference]: Finished difference. Result has 44 places, 53 transitions, 256 flow [2025-03-08 17:38:37,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=44, PETRI_TRANSITIONS=53} [2025-03-08 17:38:37,661 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-03-08 17:38:37,661 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 256 flow [2025-03-08 17:38:37,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:37,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:37,662 INFO L206 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] [2025-03-08 17:38:37,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:38:37,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:37,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1960074056, now seen corresponding path program 2 times [2025-03-08 17:38:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:37,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467687531] [2025-03-08 17:38:37,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:38:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:37,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:38:37,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:38:37,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:38:37,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:37,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:37,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467687531] [2025-03-08 17:38:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467687531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:37,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:38:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132714075] [2025-03-08 17:38:37,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:37,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:38:37,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:37,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:38:37,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:38:37,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-08 17:38:37,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 53 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:37,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:37,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-08 17:38:37,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:38,028 INFO L124 PetriNetUnfolderBase]: 1173/1823 cut-off events. [2025-03-08 17:38:38,029 INFO L125 PetriNetUnfolderBase]: For 1638/1638 co-relation queries the response was YES. [2025-03-08 17:38:38,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5363 conditions, 1823 events. 1173/1823 cut-off events. For 1638/1638 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8695 event pairs, 188 based on Foata normal form. 114/1929 useless extension candidates. Maximal degree in co-relation 3932. Up to 891 conditions per place. [2025-03-08 17:38:38,039 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 77 selfloop transitions, 6 changer transitions 2/92 dead transitions. [2025-03-08 17:38:38,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 92 transitions, 584 flow [2025-03-08 17:38:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:38:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:38:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-08 17:38:38,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2025-03-08 17:38:38,041 INFO L175 Difference]: Start difference. First operand has 44 places, 53 transitions, 256 flow. Second operand 5 states and 111 transitions. [2025-03-08 17:38:38,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 92 transitions, 584 flow [2025-03-08 17:38:38,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 92 transitions, 574 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-08 17:38:38,048 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 274 flow [2025-03-08 17:38:38,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2025-03-08 17:38:38,050 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-03-08 17:38:38,050 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 274 flow [2025-03-08 17:38:38,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:38,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:38,050 INFO L206 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] [2025-03-08 17:38:38,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:38:38,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:38,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1718649179, now seen corresponding path program 1 times [2025-03-08 17:38:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540616324] [2025-03-08 17:38:38,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:38,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:38:38,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:38:38,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:38,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:38,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:38,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540616324] [2025-03-08 17:38:38,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540616324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:38,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:38,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:38:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150896063] [2025-03-08 17:38:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:38:38,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:38,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:38:38,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:38:38,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-08 17:38:38,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:38,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:38,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-08 17:38:38,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:38,503 INFO L124 PetriNetUnfolderBase]: 1641/2542 cut-off events. [2025-03-08 17:38:38,503 INFO L125 PetriNetUnfolderBase]: For 3547/3547 co-relation queries the response was YES. [2025-03-08 17:38:38,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8202 conditions, 2542 events. 1641/2542 cut-off events. For 3547/3547 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13074 event pairs, 345 based on Foata normal form. 80/2612 useless extension candidates. Maximal degree in co-relation 5826. Up to 1629 conditions per place. [2025-03-08 17:38:38,534 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 79 selfloop transitions, 10 changer transitions 2/98 dead transitions. [2025-03-08 17:38:38,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 677 flow [2025-03-08 17:38:38,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:38:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:38:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-08 17:38:38,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-08 17:38:38,536 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 274 flow. Second operand 5 states and 110 transitions. [2025-03-08 17:38:38,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 677 flow [2025-03-08 17:38:38,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 98 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:38:38,548 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 313 flow [2025-03-08 17:38:38,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2025-03-08 17:38:38,549 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2025-03-08 17:38:38,550 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 313 flow [2025-03-08 17:38:38,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:38,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:38,550 INFO L206 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] [2025-03-08 17:38:38,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:38:38,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:38,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1939738791, now seen corresponding path program 2 times [2025-03-08 17:38:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200454923] [2025-03-08 17:38:38,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:38:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:38,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-08 17:38:38,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 17:38:38,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:38:38,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:38,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200454923] [2025-03-08 17:38:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200454923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:38,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:38,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:38:38,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395263187] [2025-03-08 17:38:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:38,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:38:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:38,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:38:38,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:38:38,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-08 17:38:38,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:38,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:38,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-08 17:38:38,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:39,059 INFO L124 PetriNetUnfolderBase]: 2653/4064 cut-off events. [2025-03-08 17:38:39,059 INFO L125 PetriNetUnfolderBase]: For 6437/6437 co-relation queries the response was YES. [2025-03-08 17:38:39,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13747 conditions, 4064 events. 2653/4064 cut-off events. For 6437/6437 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 22092 event pairs, 238 based on Foata normal form. 96/4154 useless extension candidates. Maximal degree in co-relation 7092. Up to 2403 conditions per place. [2025-03-08 17:38:39,083 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 104 selfloop transitions, 12 changer transitions 0/123 dead transitions. [2025-03-08 17:38:39,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 123 transitions, 917 flow [2025-03-08 17:38:39,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:38:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:38:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2025-03-08 17:38:39,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-03-08 17:38:39,084 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 313 flow. Second operand 5 states and 120 transitions. [2025-03-08 17:38:39,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 123 transitions, 917 flow [2025-03-08 17:38:39,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 123 transitions, 884 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:38:39,097 INFO L231 Difference]: Finished difference. Result has 59 places, 67 transitions, 447 flow [2025-03-08 17:38:39,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=447, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2025-03-08 17:38:39,098 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2025-03-08 17:38:39,098 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 447 flow [2025-03-08 17:38:39,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:39,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:39,098 INFO L206 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] [2025-03-08 17:38:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:38:39,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash 960186571, now seen corresponding path program 1 times [2025-03-08 17:38:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:39,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679194075] [2025-03-08 17:38:39,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:39,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:38:39,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:38:39,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:39,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:39,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679194075] [2025-03-08 17:38:39,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679194075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:39,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:39,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:38:39,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950999654] [2025-03-08 17:38:39,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:39,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:38:39,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:39,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:38:39,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:38:39,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-08 17:38:39,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 447 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:39,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:39,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-08 17:38:39,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:39,856 INFO L124 PetriNetUnfolderBase]: 3970/5824 cut-off events. [2025-03-08 17:38:39,856 INFO L125 PetriNetUnfolderBase]: For 19797/19797 co-relation queries the response was YES. [2025-03-08 17:38:39,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23074 conditions, 5824 events. 3970/5824 cut-off events. For 19797/19797 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 31957 event pairs, 70 based on Foata normal form. 310/5881 useless extension candidates. Maximal degree in co-relation 12517. Up to 1647 conditions per place. [2025-03-08 17:38:39,919 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 207 selfloop transitions, 41 changer transitions 0/254 dead transitions. [2025-03-08 17:38:39,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 254 transitions, 2424 flow [2025-03-08 17:38:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:38:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:38:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2025-03-08 17:38:39,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5685714285714286 [2025-03-08 17:38:39,920 INFO L175 Difference]: Start difference. First operand has 59 places, 67 transitions, 447 flow. Second operand 10 states and 199 transitions. [2025-03-08 17:38:39,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 254 transitions, 2424 flow [2025-03-08 17:38:39,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 254 transitions, 2380 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-08 17:38:39,937 INFO L231 Difference]: Finished difference. Result has 74 places, 99 transitions, 828 flow [2025-03-08 17:38:39,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=828, PETRI_PLACES=74, PETRI_TRANSITIONS=99} [2025-03-08 17:38:39,938 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2025-03-08 17:38:39,938 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 99 transitions, 828 flow [2025-03-08 17:38:39,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:39,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:39,938 INFO L206 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] [2025-03-08 17:38:39,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:38:39,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:39,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:39,939 INFO L85 PathProgramCache]: Analyzing trace with hash -572474613, now seen corresponding path program 2 times [2025-03-08 17:38:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378180457] [2025-03-08 17:38:39,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:38:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:39,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:38:39,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:38:39,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:38:39,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:41,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:41,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378180457] [2025-03-08 17:38:41,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378180457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:41,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:41,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:38:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770533453] [2025-03-08 17:38:41,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:41,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:38:41,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:41,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:38:41,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:38:41,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-08 17:38:41,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 99 transitions, 828 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:41,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:41,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-08 17:38:41,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:42,903 INFO L124 PetriNetUnfolderBase]: 5250/8024 cut-off events. [2025-03-08 17:38:42,903 INFO L125 PetriNetUnfolderBase]: For 39779/39858 co-relation queries the response was YES. [2025-03-08 17:38:42,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37382 conditions, 8024 events. 5250/8024 cut-off events. For 39779/39858 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 48583 event pairs, 429 based on Foata normal form. 84/8096 useless extension candidates. Maximal degree in co-relation 22641. Up to 4723 conditions per place. [2025-03-08 17:38:42,949 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 166 selfloop transitions, 54 changer transitions 56/285 dead transitions. [2025-03-08 17:38:42,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 285 transitions, 2837 flow [2025-03-08 17:38:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 17:38:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 17:38:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 262 transitions. [2025-03-08 17:38:42,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5758241758241758 [2025-03-08 17:38:42,951 INFO L175 Difference]: Start difference. First operand has 74 places, 99 transitions, 828 flow. Second operand 13 states and 262 transitions. [2025-03-08 17:38:42,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 285 transitions, 2837 flow [2025-03-08 17:38:43,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 285 transitions, 2837 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:38:43,003 INFO L231 Difference]: Finished difference. Result has 95 places, 149 transitions, 1535 flow [2025-03-08 17:38:43,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1535, PETRI_PLACES=95, PETRI_TRANSITIONS=149} [2025-03-08 17:38:43,004 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 57 predicate places. [2025-03-08 17:38:43,004 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 149 transitions, 1535 flow [2025-03-08 17:38:43,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:43,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:43,008 INFO L206 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] [2025-03-08 17:38:43,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:38:43,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:43,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1938561411, now seen corresponding path program 3 times [2025-03-08 17:38:43,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:43,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822789362] [2025-03-08 17:38:43,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:38:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:43,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:38:43,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:38:43,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:38:43,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:44,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:44,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822789362] [2025-03-08 17:38:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822789362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:38:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269637333] [2025-03-08 17:38:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:44,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:38:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:44,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:38:44,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:38:44,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-08 17:38:44,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 149 transitions, 1535 flow. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:44,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:44,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-08 17:38:44,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:46,199 INFO L124 PetriNetUnfolderBase]: 6889/10245 cut-off events. [2025-03-08 17:38:46,200 INFO L125 PetriNetUnfolderBase]: For 67407/67407 co-relation queries the response was YES. [2025-03-08 17:38:46,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53353 conditions, 10245 events. 6889/10245 cut-off events. For 67407/67407 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 62055 event pairs, 1074 based on Foata normal form. 4/10245 useless extension candidates. Maximal degree in co-relation 53304. Up to 7447 conditions per place. [2025-03-08 17:38:46,267 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 201 selfloop transitions, 50 changer transitions 54/311 dead transitions. [2025-03-08 17:38:46,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 311 transitions, 3509 flow [2025-03-08 17:38:46,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 17:38:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-08 17:38:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 270 transitions. [2025-03-08 17:38:46,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-03-08 17:38:46,271 INFO L175 Difference]: Start difference. First operand has 95 places, 149 transitions, 1535 flow. Second operand 15 states and 270 transitions. [2025-03-08 17:38:46,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 311 transitions, 3509 flow [2025-03-08 17:38:46,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 311 transitions, 3437 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-03-08 17:38:46,413 INFO L231 Difference]: Finished difference. Result has 115 places, 182 transitions, 2062 flow [2025-03-08 17:38:46,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2062, PETRI_PLACES=115, PETRI_TRANSITIONS=182} [2025-03-08 17:38:46,415 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 77 predicate places. [2025-03-08 17:38:46,415 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 182 transitions, 2062 flow [2025-03-08 17:38:46,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:46,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:46,417 INFO L206 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] [2025-03-08 17:38:46,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:38:46,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:46,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1033143293, now seen corresponding path program 4 times [2025-03-08 17:38:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:46,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309776635] [2025-03-08 17:38:46,418 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:38:46,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:46,423 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 17:38:46,440 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:38:46,440 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:38:46,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:47,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:47,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309776635] [2025-03-08 17:38:47,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309776635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:47,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:47,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:38:47,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671417774] [2025-03-08 17:38:47,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:47,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:38:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:47,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:38:47,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:38:47,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-08 17:38:47,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 182 transitions, 2062 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:47,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:47,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-08 17:38:47,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:48,771 INFO L124 PetriNetUnfolderBase]: 6235/9518 cut-off events. [2025-03-08 17:38:48,771 INFO L125 PetriNetUnfolderBase]: For 77840/77934 co-relation queries the response was YES. [2025-03-08 17:38:48,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53365 conditions, 9518 events. 6235/9518 cut-off events. For 77840/77934 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 59668 event pairs, 615 based on Foata normal form. 98/9608 useless extension candidates. Maximal degree in co-relation 53307. Up to 6217 conditions per place. [2025-03-08 17:38:48,837 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 205 selfloop transitions, 56 changer transitions 54/324 dead transitions. [2025-03-08 17:38:48,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 324 transitions, 3916 flow [2025-03-08 17:38:48,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 17:38:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 17:38:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 258 transitions. [2025-03-08 17:38:48,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.567032967032967 [2025-03-08 17:38:48,839 INFO L175 Difference]: Start difference. First operand has 115 places, 182 transitions, 2062 flow. Second operand 13 states and 258 transitions. [2025-03-08 17:38:48,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 324 transitions, 3916 flow [2025-03-08 17:38:49,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 324 transitions, 3797 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-03-08 17:38:49,024 INFO L231 Difference]: Finished difference. Result has 128 places, 195 transitions, 2308 flow [2025-03-08 17:38:49,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1953, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2308, PETRI_PLACES=128, PETRI_TRANSITIONS=195} [2025-03-08 17:38:49,024 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2025-03-08 17:38:49,024 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 195 transitions, 2308 flow [2025-03-08 17:38:49,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:49,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:49,025 INFO L206 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] [2025-03-08 17:38:49,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:38:49,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:49,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash 618988665, now seen corresponding path program 1 times [2025-03-08 17:38:49,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:49,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792453827] [2025-03-08 17:38:49,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:38:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:49,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:38:49,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:38:49,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:38:49,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:49,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:49,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792453827] [2025-03-08 17:38:49,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792453827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:49,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:49,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:38:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802219194] [2025-03-08 17:38:49,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:49,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:38:49,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:49,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:38:49,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:38:49,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-08 17:38:49,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 195 transitions, 2308 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:49,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:49,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-08 17:38:49,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:50,771 INFO L124 PetriNetUnfolderBase]: 11483/17466 cut-off events. [2025-03-08 17:38:50,771 INFO L125 PetriNetUnfolderBase]: For 184994/185182 co-relation queries the response was YES. [2025-03-08 17:38:50,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105010 conditions, 17466 events. 11483/17466 cut-off events. For 184994/185182 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 115999 event pairs, 1394 based on Foata normal form. 362/17817 useless extension candidates. Maximal degree in co-relation 104921. Up to 6373 conditions per place. [2025-03-08 17:38:50,914 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 435 selfloop transitions, 88 changer transitions 0/532 dead transitions. [2025-03-08 17:38:50,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 532 transitions, 7186 flow [2025-03-08 17:38:50,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:38:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:38:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2025-03-08 17:38:50,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2025-03-08 17:38:50,915 INFO L175 Difference]: Start difference. First operand has 128 places, 195 transitions, 2308 flow. Second operand 9 states and 204 transitions. [2025-03-08 17:38:50,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 532 transitions, 7186 flow [2025-03-08 17:38:51,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 532 transitions, 7002 flow, removed 46 selfloop flow, removed 6 redundant places. [2025-03-08 17:38:51,537 INFO L231 Difference]: Finished difference. Result has 132 places, 262 transitions, 3339 flow [2025-03-08 17:38:51,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2210, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3339, PETRI_PLACES=132, PETRI_TRANSITIONS=262} [2025-03-08 17:38:51,538 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2025-03-08 17:38:51,538 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 262 transitions, 3339 flow [2025-03-08 17:38:51,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:51,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:51,538 INFO L206 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] [2025-03-08 17:38:51,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:38:51,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:51,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash 40313595, now seen corresponding path program 2 times [2025-03-08 17:38:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:51,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980186502] [2025-03-08 17:38:51,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:38:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:51,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-08 17:38:51,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 17:38:51,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:38:51,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:51,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:51,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980186502] [2025-03-08 17:38:51,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980186502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:38:51,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:38:51,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:38:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659708049] [2025-03-08 17:38:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:38:51,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:38:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:38:51,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:38:51,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:38:51,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-08 17:38:51,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 262 transitions, 3339 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:51,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:38:51,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-08 17:38:51,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:38:54,133 INFO L124 PetriNetUnfolderBase]: 14504/22064 cut-off events. [2025-03-08 17:38:54,133 INFO L125 PetriNetUnfolderBase]: For 302552/302709 co-relation queries the response was YES. [2025-03-08 17:38:54,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143922 conditions, 22064 events. 14504/22064 cut-off events. For 302552/302709 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 153164 event pairs, 1625 based on Foata normal form. 253/22309 useless extension candidates. Maximal degree in co-relation 132192. Up to 12577 conditions per place. [2025-03-08 17:38:54,357 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 361 selfloop transitions, 69 changer transitions 0/439 dead transitions. [2025-03-08 17:38:54,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 439 transitions, 6259 flow [2025-03-08 17:38:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:38:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:38:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2025-03-08 17:38:54,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2025-03-08 17:38:54,359 INFO L175 Difference]: Start difference. First operand has 132 places, 262 transitions, 3339 flow. Second operand 9 states and 196 transitions. [2025-03-08 17:38:54,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 439 transitions, 6259 flow [2025-03-08 17:38:55,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 439 transitions, 6135 flow, removed 28 selfloop flow, removed 3 redundant places. [2025-03-08 17:38:55,271 INFO L231 Difference]: Finished difference. Result has 140 places, 289 transitions, 3916 flow [2025-03-08 17:38:55,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3263, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3916, PETRI_PLACES=140, PETRI_TRANSITIONS=289} [2025-03-08 17:38:55,272 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 102 predicate places. [2025-03-08 17:38:55,272 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 289 transitions, 3916 flow [2025-03-08 17:38:55,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:38:55,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:38:55,273 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:38:55,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:38:55,273 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-08 17:38:55,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:38:55,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1494859979, now seen corresponding path program 5 times [2025-03-08 17:38:55,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:38:55,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574981214] [2025-03-08 17:38:55,273 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:38:55,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:38:55,279 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:38:55,295 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:38:55,295 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:38:55,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:38:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:38:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574981214] [2025-03-08 17:38:56,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574981214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:38:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835074881] [2025-03-08 17:38:56,528 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:38:56,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:38:56,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:38:56,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:38:56,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:38:56,569 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:38:56,619 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:38:56,619 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:38:56,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:38:56,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 17:38:56,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:39:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:39:13,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:39:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:39:15,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835074881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:39:15,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:39:15,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-08 17:39:15,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093842454] [2025-03-08 17:39:15,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:39:15,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 17:39:15,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:39:15,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 17:39:15,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=500, Unknown=4, NotChecked=0, Total=650 [2025-03-08 17:39:15,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-03-08 17:39:15,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 289 transitions, 3916 flow. Second operand has 26 states, 26 states have (on average 12.0) internal successors, (312), 26 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:39:15,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:39:15,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-03-08 17:39:15,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand