./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:40:08,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:40:08,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:40:08,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:40:08,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:40:08,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:40:08,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:40:08,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:40:08,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:40:08,891 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:40:08,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:40:08,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:40:08,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:40:08,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:40:08,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:08,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:08,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:40:08,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:40:08,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:40:08,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:40:08,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:40:08,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:40:08,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:40:08,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:40:08,894 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-jdk21/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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-01-09 16:40:09,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:40:09,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:40:09,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:40:09,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:40:09,113 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:40:09,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-01-09 16:40:10,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e9dacb77/99730ab1303b45198becb466d799ceb4/FLAG270fac418 [2025-01-09 16:40:10,468 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:40:10,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-01-09 16:40:10,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e9dacb77/99730ab1303b45198becb466d799ceb4/FLAG270fac418 [2025-01-09 16:40:10,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e9dacb77/99730ab1303b45198becb466d799ceb4 [2025-01-09 16:40:10,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:40:10,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:40:10,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:40:10,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:40:10,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:40:10,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:40:10" (1/1) ... [2025-01-09 16:40:10,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d37a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:10, skipping insertion in model container [2025-01-09 16:40:10,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:40:10" (1/1) ... [2025-01-09 16:40:10,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:40:10,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3331,3344] [2025-01-09 16:40:10,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:40:10,968 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:40:10,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c[3331,3344] [2025-01-09 16:40:10,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:40:11,012 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:40:11,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11 WrapperNode [2025-01-09 16:40:11,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:40:11,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:40:11,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:40:11,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:40:11,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,043 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 156 [2025-01-09 16:40:11,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:40:11,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:40:11,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:40:11,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:40:11,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,069 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:40:11,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:40:11,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:40:11,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:40:11,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:40:11,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (1/1) ... [2025-01-09 16:40:11,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:40:11,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:40:11,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:40:11,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:40:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:40:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:40:11,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:40:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:40:11,131 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:40:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:40:11,131 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:40:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:40:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:40:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:40:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:40:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:40:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:40:11,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:40:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:40:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:40:11,133 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:40:11,215 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:40:11,216 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:40:11,496 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:40:11,496 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:40:11,716 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:40:11,716 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:40:11,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:11 BoogieIcfgContainer [2025-01-09 16:40:11,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:40:11,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:40:11,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:40:11,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:40:11,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:40:10" (1/3) ... [2025-01-09 16:40:11,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f5e314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:40:11, skipping insertion in model container [2025-01-09 16:40:11,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:11" (2/3) ... [2025-01-09 16:40:11,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f5e314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:40:11, skipping insertion in model container [2025-01-09 16:40:11,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:11" (3/3) ... [2025-01-09 16:40:11,723 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-01-09 16:40:11,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:40:11,735 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:40:11,735 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:40:11,778 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:40:11,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2025-01-09 16:40:11,830 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-01-09 16:40:11,832 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:40:11,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 12/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 81 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-01-09 16:40:11,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2025-01-09 16:40:11,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2025-01-09 16:40:11,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:40:11,856 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;@7c9e085c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:40:11,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:40:11,869 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:40:11,869 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-01-09 16:40:11,869 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:40:11,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:11,870 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-01-09 16:40:11,870 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-01-09 16:40:11,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash -659630210, now seen corresponding path program 1 times [2025-01-09 16:40:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:11,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952695041] [2025-01-09 16:40:11,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:11,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:40:11,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:40:11,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:11,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952695041] [2025-01-09 16:40:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952695041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:12,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:12,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734533583] [2025-01-09 16:40:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:12,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:12,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:12,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:12,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:12,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:12,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:12,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:12,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:12,990 INFO L124 PetriNetUnfolderBase]: 3667/5069 cut-off events. [2025-01-09 16:40:12,991 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2025-01-09 16:40:12,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10193 conditions, 5069 events. 3667/5069 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 22241 event pairs, 1182 based on Foata normal form. 1/4166 useless extension candidates. Maximal degree in co-relation 9455. Up to 2533 conditions per place. [2025-01-09 16:40:13,018 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 84 selfloop transitions, 13 changer transitions 1/102 dead transitions. [2025-01-09 16:40:13,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 102 transitions, 445 flow [2025-01-09 16:40:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-01-09 16:40:13,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-01-09 16:40:13,028 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 5 states and 134 transitions. [2025-01-09 16:40:13,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 102 transitions, 445 flow [2025-01-09 16:40:13,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 102 transitions, 415 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:40:13,043 INFO L231 Difference]: Finished difference. Result has 44 places, 55 transitions, 174 flow [2025-01-09 16:40:13,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=44, PETRI_TRANSITIONS=55} [2025-01-09 16:40:13,047 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-01-09 16:40:13,047 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 55 transitions, 174 flow [2025-01-09 16:40:13,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:13,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:13,048 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-01-09 16:40:13,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:40:13,049 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-01-09 16:40:13,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2082781904, now seen corresponding path program 2 times [2025-01-09 16:40:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:13,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746647725] [2025-01-09 16:40:13,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:13,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:40:13,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:40:13,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:13,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:13,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746647725] [2025-01-09 16:40:13,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746647725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:13,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:13,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005485821] [2025-01-09 16:40:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:13,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:13,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:13,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:13,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:13,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 55 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:13,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:13,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:13,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:13,837 INFO L124 PetriNetUnfolderBase]: 4726/6637 cut-off events. [2025-01-09 16:40:13,837 INFO L125 PetriNetUnfolderBase]: For 1692/1692 co-relation queries the response was YES. [2025-01-09 16:40:13,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15681 conditions, 6637 events. 4726/6637 cut-off events. For 1692/1692 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 32844 event pairs, 2307 based on Foata normal form. 1/6099 useless extension candidates. Maximal degree in co-relation 9470. Up to 4654 conditions per place. [2025-01-09 16:40:13,895 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 100 selfloop transitions, 7 changer transitions 3/114 dead transitions. [2025-01-09 16:40:13,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 114 transitions, 574 flow [2025-01-09 16:40:13,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-01-09 16:40:13,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-01-09 16:40:13,896 INFO L175 Difference]: Start difference. First operand has 44 places, 55 transitions, 174 flow. Second operand 5 states and 131 transitions. [2025-01-09 16:40:13,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 114 transitions, 574 flow [2025-01-09 16:40:13,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 114 transitions, 574 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:40:13,905 INFO L231 Difference]: Finished difference. Result has 51 places, 60 transitions, 239 flow [2025-01-09 16:40:13,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=51, PETRI_TRANSITIONS=60} [2025-01-09 16:40:13,906 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2025-01-09 16:40:13,906 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 239 flow [2025-01-09 16:40:13,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:13,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:13,906 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-01-09 16:40:13,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:40:13,907 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-01-09 16:40:13,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash 314861826, now seen corresponding path program 3 times [2025-01-09 16:40:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:13,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960265648] [2025-01-09 16:40:13,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:40:13,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:13,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:40:13,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:40:13,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:40:13,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:14,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:14,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960265648] [2025-01-09 16:40:14,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960265648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:14,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197298807] [2025-01-09 16:40:14,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:14,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:14,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:14,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:14,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:14,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 60 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:14,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:14,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:14,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:14,716 INFO L124 PetriNetUnfolderBase]: 5714/8169 cut-off events. [2025-01-09 16:40:14,716 INFO L125 PetriNetUnfolderBase]: For 5016/5016 co-relation queries the response was YES. [2025-01-09 16:40:14,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20575 conditions, 8169 events. 5714/8169 cut-off events. For 5016/5016 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 43359 event pairs, 2897 based on Foata normal form. 1/7748 useless extension candidates. Maximal degree in co-relation 14685. Up to 5199 conditions per place. [2025-01-09 16:40:14,759 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 95 selfloop transitions, 17 changer transitions 1/117 dead transitions. [2025-01-09 16:40:14,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 117 transitions, 655 flow [2025-01-09 16:40:14,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-01-09 16:40:14,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2025-01-09 16:40:14,763 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 239 flow. Second operand 5 states and 135 transitions. [2025-01-09 16:40:14,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 117 transitions, 655 flow [2025-01-09 16:40:14,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 117 transitions, 645 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:14,784 INFO L231 Difference]: Finished difference. Result has 57 places, 70 transitions, 377 flow [2025-01-09 16:40:14,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=57, PETRI_TRANSITIONS=70} [2025-01-09 16:40:14,785 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2025-01-09 16:40:14,785 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 70 transitions, 377 flow [2025-01-09 16:40:14,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:14,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:14,786 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-01-09 16:40:14,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:40:14,786 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-01-09 16:40:14,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1220976112, now seen corresponding path program 4 times [2025-01-09 16:40:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:14,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536305355] [2025-01-09 16:40:14,787 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:40:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:14,795 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-01-09 16:40:14,800 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-01-09 16:40:14,800 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:40:14,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:14,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:14,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536305355] [2025-01-09 16:40:14,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536305355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:14,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:14,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:14,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059065357] [2025-01-09 16:40:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:14,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:14,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:14,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:14,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:14,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:14,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 70 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:14,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:14,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:14,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:15,457 INFO L124 PetriNetUnfolderBase]: 6294/9028 cut-off events. [2025-01-09 16:40:15,458 INFO L125 PetriNetUnfolderBase]: For 11341/11341 co-relation queries the response was YES. [2025-01-09 16:40:15,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25055 conditions, 9028 events. 6294/9028 cut-off events. For 11341/11341 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 49746 event pairs, 2995 based on Foata normal form. 1/8574 useless extension candidates. Maximal degree in co-relation 16767. Up to 5754 conditions per place. [2025-01-09 16:40:15,496 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 115 selfloop transitions, 22 changer transitions 1/142 dead transitions. [2025-01-09 16:40:15,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 142 transitions, 957 flow [2025-01-09 16:40:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-01-09 16:40:15,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-01-09 16:40:15,497 INFO L175 Difference]: Start difference. First operand has 57 places, 70 transitions, 377 flow. Second operand 5 states and 137 transitions. [2025-01-09 16:40:15,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 142 transitions, 957 flow [2025-01-09 16:40:15,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 142 transitions, 917 flow, removed 20 selfloop flow, removed 0 redundant places. [2025-01-09 16:40:15,528 INFO L231 Difference]: Finished difference. Result has 64 places, 86 transitions, 591 flow [2025-01-09 16:40:15,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=64, PETRI_TRANSITIONS=86} [2025-01-09 16:40:15,529 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-01-09 16:40:15,529 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 86 transitions, 591 flow [2025-01-09 16:40:15,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:15,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:15,529 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-01-09 16:40:15,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:40:15,530 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-01-09 16:40:15,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash -989193150, now seen corresponding path program 5 times [2025-01-09 16:40:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:15,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478332668] [2025-01-09 16:40:15,530 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:15,537 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:40:15,543 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:40:15,544 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:15,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:15,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:15,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478332668] [2025-01-09 16:40:15,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478332668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:15,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:15,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50073652] [2025-01-09 16:40:15,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:15,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:15,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:15,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:15,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:15,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 86 transitions, 591 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:15,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:15,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:15,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:16,261 INFO L124 PetriNetUnfolderBase]: 6279/8990 cut-off events. [2025-01-09 16:40:16,261 INFO L125 PetriNetUnfolderBase]: For 16418/16448 co-relation queries the response was YES. [2025-01-09 16:40:16,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26954 conditions, 8990 events. 6279/8990 cut-off events. For 16418/16448 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 48969 event pairs, 3188 based on Foata normal form. 1/8761 useless extension candidates. Maximal degree in co-relation 25806. Up to 5855 conditions per place. [2025-01-09 16:40:16,302 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 116 selfloop transitions, 11 changer transitions 3/134 dead transitions. [2025-01-09 16:40:16,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 134 transitions, 1015 flow [2025-01-09 16:40:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-01-09 16:40:16,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2025-01-09 16:40:16,304 INFO L175 Difference]: Start difference. First operand has 64 places, 86 transitions, 591 flow. Second operand 5 states and 129 transitions. [2025-01-09 16:40:16,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 134 transitions, 1015 flow [2025-01-09 16:40:16,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 134 transitions, 1007 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:16,341 INFO L231 Difference]: Finished difference. Result has 69 places, 86 transitions, 616 flow [2025-01-09 16:40:16,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=616, PETRI_PLACES=69, PETRI_TRANSITIONS=86} [2025-01-09 16:40:16,342 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2025-01-09 16:40:16,342 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 86 transitions, 616 flow [2025-01-09 16:40:16,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:16,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:16,342 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-01-09 16:40:16,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:40:16,342 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-01-09 16:40:16,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1667300026, now seen corresponding path program 6 times [2025-01-09 16:40:16,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368421033] [2025-01-09 16:40:16,343 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:40:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:16,349 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:40:16,356 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:40:16,357 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:40:16,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368421033] [2025-01-09 16:40:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368421033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:16,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:16,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:16,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583815190] [2025-01-09 16:40:16,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:16,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:16,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:16,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:16,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:16,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 86 transitions, 616 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:16,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:16,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:16,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:17,109 INFO L124 PetriNetUnfolderBase]: 6377/9169 cut-off events. [2025-01-09 16:40:17,110 INFO L125 PetriNetUnfolderBase]: For 19053/19053 co-relation queries the response was YES. [2025-01-09 16:40:17,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27792 conditions, 9169 events. 6377/9169 cut-off events. For 19053/19053 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 50387 event pairs, 2145 based on Foata normal form. 1/8975 useless extension candidates. Maximal degree in co-relation 27243. Up to 4262 conditions per place. [2025-01-09 16:40:17,158 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 96 selfloop transitions, 45 changer transitions 1/146 dead transitions. [2025-01-09 16:40:17,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 146 transitions, 1149 flow [2025-01-09 16:40:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-01-09 16:40:17,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-01-09 16:40:17,160 INFO L175 Difference]: Start difference. First operand has 69 places, 86 transitions, 616 flow. Second operand 5 states and 134 transitions. [2025-01-09 16:40:17,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 146 transitions, 1149 flow [2025-01-09 16:40:17,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 146 transitions, 1126 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-09 16:40:17,205 INFO L231 Difference]: Finished difference. Result has 73 places, 100 transitions, 859 flow [2025-01-09 16:40:17,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=859, PETRI_PLACES=73, PETRI_TRANSITIONS=100} [2025-01-09 16:40:17,206 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2025-01-09 16:40:17,206 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 100 transitions, 859 flow [2025-01-09 16:40:17,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 16:40:17,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:17,206 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] [2025-01-09 16:40:17,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:40:17,207 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-01-09 16:40:17,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:17,207 INFO L85 PathProgramCache]: Analyzing trace with hash 834416915, now seen corresponding path program 1 times [2025-01-09 16:40:17,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:17,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986275766] [2025-01-09 16:40:17,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:17,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:17,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:17,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:17,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:17,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:17,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986275766] [2025-01-09 16:40:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986275766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:40:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249368256] [2025-01-09 16:40:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:17,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:17,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:17,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:17,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 100 transitions, 859 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:17,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:17,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:17,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:18,138 INFO L124 PetriNetUnfolderBase]: 10299/14480 cut-off events. [2025-01-09 16:40:18,138 INFO L125 PetriNetUnfolderBase]: For 40670/40704 co-relation queries the response was YES. [2025-01-09 16:40:18,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48828 conditions, 14480 events. 10299/14480 cut-off events. For 40670/40704 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 81884 event pairs, 3359 based on Foata normal form. 5/14161 useless extension candidates. Maximal degree in co-relation 41576. Up to 6298 conditions per place. [2025-01-09 16:40:18,191 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 158 selfloop transitions, 22 changer transitions 7/191 dead transitions. [2025-01-09 16:40:18,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 191 transitions, 1854 flow [2025-01-09 16:40:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-01-09 16:40:18,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2025-01-09 16:40:18,192 INFO L175 Difference]: Start difference. First operand has 73 places, 100 transitions, 859 flow. Second operand 5 states and 138 transitions. [2025-01-09 16:40:18,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 191 transitions, 1854 flow [2025-01-09 16:40:18,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 191 transitions, 1768 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:18,276 INFO L231 Difference]: Finished difference. Result has 79 places, 111 transitions, 980 flow [2025-01-09 16:40:18,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=980, PETRI_PLACES=79, PETRI_TRANSITIONS=111} [2025-01-09 16:40:18,277 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2025-01-09 16:40:18,277 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 111 transitions, 980 flow [2025-01-09 16:40:18,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:18,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:18,277 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] [2025-01-09 16:40:18,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:40:18,277 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-01-09 16:40:18,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2093700784, now seen corresponding path program 1 times [2025-01-09 16:40:18,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:18,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761697874] [2025-01-09 16:40:18,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:18,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:18,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:18,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:18,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:18,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:18,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:18,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761697874] [2025-01-09 16:40:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761697874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:18,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:18,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:40:18,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344990047] [2025-01-09 16:40:18,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:18,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:40:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:18,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:40:18,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:40:18,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:18,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 111 transitions, 980 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:18,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:18,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:18,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:19,638 INFO L124 PetriNetUnfolderBase]: 14843/20647 cut-off events. [2025-01-09 16:40:19,638 INFO L125 PetriNetUnfolderBase]: For 65251/65295 co-relation queries the response was YES. [2025-01-09 16:40:19,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72411 conditions, 20647 events. 14843/20647 cut-off events. For 65251/65295 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 117066 event pairs, 4931 based on Foata normal form. 5/20199 useless extension candidates. Maximal degree in co-relation 65203. Up to 8351 conditions per place. [2025-01-09 16:40:19,769 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 172 selfloop transitions, 27 changer transitions 38/241 dead transitions. [2025-01-09 16:40:19,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 241 transitions, 2468 flow [2025-01-09 16:40:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:40:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:40:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2025-01-09 16:40:19,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45408163265306123 [2025-01-09 16:40:19,771 INFO L175 Difference]: Start difference. First operand has 79 places, 111 transitions, 980 flow. Second operand 8 states and 178 transitions. [2025-01-09 16:40:19,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 241 transitions, 2468 flow [2025-01-09 16:40:19,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 241 transitions, 2423 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:19,964 INFO L231 Difference]: Finished difference. Result has 90 places, 125 transitions, 1165 flow [2025-01-09 16:40:19,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1165, PETRI_PLACES=90, PETRI_TRANSITIONS=125} [2025-01-09 16:40:19,965 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2025-01-09 16:40:19,965 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 125 transitions, 1165 flow [2025-01-09 16:40:19,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:19,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:19,965 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] [2025-01-09 16:40:19,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:40:19,966 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-01-09 16:40:19,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:19,966 INFO L85 PathProgramCache]: Analyzing trace with hash 404174536, now seen corresponding path program 1 times [2025-01-09 16:40:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283486067] [2025-01-09 16:40:19,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:19,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:19,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:19,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:19,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:20,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:20,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283486067] [2025-01-09 16:40:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283486067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:20,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:20,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360131221] [2025-01-09 16:40:20,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:20,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:20,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:20,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:20,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:20,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 125 transitions, 1165 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:20,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:20,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:20,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:21,329 INFO L124 PetriNetUnfolderBase]: 13722/19343 cut-off events. [2025-01-09 16:40:21,329 INFO L125 PetriNetUnfolderBase]: For 66012/66012 co-relation queries the response was YES. [2025-01-09 16:40:21,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69293 conditions, 19343 events. 13722/19343 cut-off events. For 66012/66012 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 110927 event pairs, 4192 based on Foata normal form. 1/18957 useless extension candidates. Maximal degree in co-relation 69169. Up to 8756 conditions per place. [2025-01-09 16:40:21,442 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 177 selfloop transitions, 23 changer transitions 17/221 dead transitions. [2025-01-09 16:40:21,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 221 transitions, 2377 flow [2025-01-09 16:40:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-01-09 16:40:21,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-01-09 16:40:21,444 INFO L175 Difference]: Start difference. First operand has 90 places, 125 transitions, 1165 flow. Second operand 5 states and 133 transitions. [2025-01-09 16:40:21,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 221 transitions, 2377 flow [2025-01-09 16:40:21,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 221 transitions, 2320 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-09 16:40:21,617 INFO L231 Difference]: Finished difference. Result has 94 places, 135 transitions, 1362 flow [2025-01-09 16:40:21,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1362, PETRI_PLACES=94, PETRI_TRANSITIONS=135} [2025-01-09 16:40:21,618 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2025-01-09 16:40:21,618 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 135 transitions, 1362 flow [2025-01-09 16:40:21,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:21,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:21,618 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] [2025-01-09 16:40:21,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:40:21,618 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-01-09 16:40:21,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1510062260, now seen corresponding path program 2 times [2025-01-09 16:40:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:21,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604033185] [2025-01-09 16:40:21,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:21,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:21,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:21,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:21,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:21,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:21,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604033185] [2025-01-09 16:40:21,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604033185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:21,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:21,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970173277] [2025-01-09 16:40:21,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:21,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:21,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:21,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:21,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:21,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:21,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 135 transitions, 1362 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:21,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:21,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:21,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:22,981 INFO L124 PetriNetUnfolderBase]: 13503/18965 cut-off events. [2025-01-09 16:40:22,981 INFO L125 PetriNetUnfolderBase]: For 85243/85287 co-relation queries the response was YES. [2025-01-09 16:40:23,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68975 conditions, 18965 events. 13503/18965 cut-off events. For 85243/85287 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 108266 event pairs, 6819 based on Foata normal form. 1/18920 useless extension candidates. Maximal degree in co-relation 62460. Up to 13045 conditions per place. [2025-01-09 16:40:23,075 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 143 selfloop transitions, 20 changer transitions 16/183 dead transitions. [2025-01-09 16:40:23,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 183 transitions, 1892 flow [2025-01-09 16:40:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-01-09 16:40:23,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-01-09 16:40:23,076 INFO L175 Difference]: Start difference. First operand has 94 places, 135 transitions, 1362 flow. Second operand 5 states and 130 transitions. [2025-01-09 16:40:23,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 183 transitions, 1892 flow [2025-01-09 16:40:23,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 183 transitions, 1851 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:23,261 INFO L231 Difference]: Finished difference. Result has 98 places, 132 transitions, 1323 flow [2025-01-09 16:40:23,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1323, PETRI_PLACES=98, PETRI_TRANSITIONS=132} [2025-01-09 16:40:23,261 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2025-01-09 16:40:23,261 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 132 transitions, 1323 flow [2025-01-09 16:40:23,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:23,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:23,262 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] [2025-01-09 16:40:23,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:40:23,262 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-01-09 16:40:23,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash 487785712, now seen corresponding path program 3 times [2025-01-09 16:40:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238778346] [2025-01-09 16:40:23,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:40:23,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:23,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:23,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:23,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:40:23,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:23,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:23,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238778346] [2025-01-09 16:40:23,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238778346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:23,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:23,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:23,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105831618] [2025-01-09 16:40:23,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:23,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:23,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:23,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:23,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:23,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:23,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 132 transitions, 1323 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:23,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:23,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:23,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:24,762 INFO L124 PetriNetUnfolderBase]: 13546/19012 cut-off events. [2025-01-09 16:40:24,762 INFO L125 PetriNetUnfolderBase]: For 86838/86882 co-relation queries the response was YES. [2025-01-09 16:40:24,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69456 conditions, 19012 events. 13546/19012 cut-off events. For 86838/86882 co-relation queries the response was YES. Maximal size of possible extension queue 937. Compared 108121 event pairs, 6657 based on Foata normal form. 1/18967 useless extension candidates. Maximal degree in co-relation 69370. Up to 13045 conditions per place. [2025-01-09 16:40:24,901 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 155 selfloop transitions, 26 changer transitions 13/198 dead transitions. [2025-01-09 16:40:24,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 198 transitions, 2066 flow [2025-01-09 16:40:24,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-01-09 16:40:24,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-01-09 16:40:24,902 INFO L175 Difference]: Start difference. First operand has 98 places, 132 transitions, 1323 flow. Second operand 5 states and 137 transitions. [2025-01-09 16:40:24,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 198 transitions, 2066 flow [2025-01-09 16:40:25,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 198 transitions, 2020 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-09 16:40:25,123 INFO L231 Difference]: Finished difference. Result has 99 places, 134 transitions, 1339 flow [2025-01-09 16:40:25,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1339, PETRI_PLACES=99, PETRI_TRANSITIONS=134} [2025-01-09 16:40:25,123 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places. [2025-01-09 16:40:25,124 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 134 transitions, 1339 flow [2025-01-09 16:40:25,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:25,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:25,124 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] [2025-01-09 16:40:25,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:40:25,124 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-01-09 16:40:25,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1914675012, now seen corresponding path program 4 times [2025-01-09 16:40:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541862262] [2025-01-09 16:40:25,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:40:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:25,132 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:40:25,139 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-01-09 16:40:25,139 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:40:25,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:25,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541862262] [2025-01-09 16:40:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541862262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:25,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431915770] [2025-01-09 16:40:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:25,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:25,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:25,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:25,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:25,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 134 transitions, 1339 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:25,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:25,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:25,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:26,332 INFO L124 PetriNetUnfolderBase]: 13307/18648 cut-off events. [2025-01-09 16:40:26,332 INFO L125 PetriNetUnfolderBase]: For 90736/90780 co-relation queries the response was YES. [2025-01-09 16:40:26,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69545 conditions, 18648 events. 13307/18648 cut-off events. For 90736/90780 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 105452 event pairs, 7164 based on Foata normal form. 1/18597 useless extension candidates. Maximal degree in co-relation 65221. Up to 14470 conditions per place. [2025-01-09 16:40:26,442 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 148 selfloop transitions, 10 changer transitions 18/180 dead transitions. [2025-01-09 16:40:26,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 180 transitions, 1838 flow [2025-01-09 16:40:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-01-09 16:40:26,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2025-01-09 16:40:26,443 INFO L175 Difference]: Start difference. First operand has 99 places, 134 transitions, 1339 flow. Second operand 5 states and 128 transitions. [2025-01-09 16:40:26,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 180 transitions, 1838 flow [2025-01-09 16:40:26,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 180 transitions, 1786 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-01-09 16:40:26,666 INFO L231 Difference]: Finished difference. Result has 100 places, 129 transitions, 1225 flow [2025-01-09 16:40:26,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1225, PETRI_PLACES=100, PETRI_TRANSITIONS=129} [2025-01-09 16:40:26,667 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2025-01-09 16:40:26,667 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 129 transitions, 1225 flow [2025-01-09 16:40:26,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:26,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:26,667 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] [2025-01-09 16:40:26,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:40:26,667 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:26,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1748854046, now seen corresponding path program 5 times [2025-01-09 16:40:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:26,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392038645] [2025-01-09 16:40:26,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:26,673 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:26,678 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:26,678 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:26,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:26,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:26,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392038645] [2025-01-09 16:40:26,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392038645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:26,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:26,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:26,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062225513] [2025-01-09 16:40:26,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:26,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:26,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:26,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:26,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:26,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:26,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 129 transitions, 1225 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:26,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:26,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:26,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:28,083 INFO L124 PetriNetUnfolderBase]: 13582/19130 cut-off events. [2025-01-09 16:40:28,083 INFO L125 PetriNetUnfolderBase]: For 87659/87659 co-relation queries the response was YES. [2025-01-09 16:40:28,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70806 conditions, 19130 events. 13582/19130 cut-off events. For 87659/87659 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 109022 event pairs, 4195 based on Foata normal form. 1/19101 useless extension candidates. Maximal degree in co-relation 70730. Up to 9493 conditions per place. [2025-01-09 16:40:28,170 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 172 selfloop transitions, 15 changer transitions 10/201 dead transitions. [2025-01-09 16:40:28,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 201 transitions, 2044 flow [2025-01-09 16:40:28,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-01-09 16:40:28,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-01-09 16:40:28,171 INFO L175 Difference]: Start difference. First operand has 100 places, 129 transitions, 1225 flow. Second operand 5 states and 133 transitions. [2025-01-09 16:40:28,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 201 transitions, 2044 flow [2025-01-09 16:40:28,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 201 transitions, 2002 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-01-09 16:40:28,365 INFO L231 Difference]: Finished difference. Result has 102 places, 137 transitions, 1336 flow [2025-01-09 16:40:28,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1336, PETRI_PLACES=102, PETRI_TRANSITIONS=137} [2025-01-09 16:40:28,365 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2025-01-09 16:40:28,365 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 137 transitions, 1336 flow [2025-01-09 16:40:28,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:28,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:28,365 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] [2025-01-09 16:40:28,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:40:28,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:28,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1466103666, now seen corresponding path program 6 times [2025-01-09 16:40:28,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:28,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286020338] [2025-01-09 16:40:28,366 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:40:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:28,371 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:40:28,379 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:40:28,379 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:40:28,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:40:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:28,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286020338] [2025-01-09 16:40:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286020338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:28,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366701223] [2025-01-09 16:40:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:28,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:28,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:28,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:28,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:28,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:28,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 137 transitions, 1336 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:28,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:28,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:28,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:29,529 INFO L124 PetriNetUnfolderBase]: 13567/19044 cut-off events. [2025-01-09 16:40:29,529 INFO L125 PetriNetUnfolderBase]: For 97147/97191 co-relation queries the response was YES. [2025-01-09 16:40:29,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72231 conditions, 19044 events. 13567/19044 cut-off events. For 97147/97191 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 108092 event pairs, 7209 based on Foata normal form. 1/18993 useless extension candidates. Maximal degree in co-relation 52110. Up to 14470 conditions per place. [2025-01-09 16:40:29,668 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 166 selfloop transitions, 17 changer transitions 10/197 dead transitions. [2025-01-09 16:40:29,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 197 transitions, 1984 flow [2025-01-09 16:40:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-01-09 16:40:29,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-01-09 16:40:29,672 INFO L175 Difference]: Start difference. First operand has 102 places, 137 transitions, 1336 flow. Second operand 5 states and 134 transitions. [2025-01-09 16:40:29,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 197 transitions, 1984 flow [2025-01-09 16:40:29,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 197 transitions, 1967 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:29,889 INFO L231 Difference]: Finished difference. Result has 107 places, 139 transitions, 1342 flow [2025-01-09 16:40:29,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1342, PETRI_PLACES=107, PETRI_TRANSITIONS=139} [2025-01-09 16:40:29,889 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2025-01-09 16:40:29,889 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 139 transitions, 1342 flow [2025-01-09 16:40:29,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:40:29,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:29,889 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] [2025-01-09 16:40:29,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:40:29,890 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:29,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:29,890 INFO L85 PathProgramCache]: Analyzing trace with hash 997294275, now seen corresponding path program 1 times [2025-01-09 16:40:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:29,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486450191] [2025-01-09 16:40:29,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:29,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:29,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:40:29,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:40:29,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:29,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:29,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:29,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486450191] [2025-01-09 16:40:29,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486450191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:29,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:29,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:29,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920415442] [2025-01-09 16:40:29,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:29,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:29,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:29,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:29,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:29,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:29,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 139 transitions, 1342 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:29,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:29,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:29,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:31,107 INFO L124 PetriNetUnfolderBase]: 14297/20480 cut-off events. [2025-01-09 16:40:31,107 INFO L125 PetriNetUnfolderBase]: For 109929/109949 co-relation queries the response was YES. [2025-01-09 16:40:31,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77916 conditions, 20480 events. 14297/20480 cut-off events. For 109929/109949 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 125311 event pairs, 4069 based on Foata normal form. 1/20459 useless extension candidates. Maximal degree in co-relation 57755. Up to 9305 conditions per place. [2025-01-09 16:40:31,246 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 197 selfloop transitions, 18 changer transitions 3/222 dead transitions. [2025-01-09 16:40:31,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 222 transitions, 2380 flow [2025-01-09 16:40:31,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-01-09 16:40:31,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5673469387755102 [2025-01-09 16:40:31,247 INFO L175 Difference]: Start difference. First operand has 107 places, 139 transitions, 1342 flow. Second operand 5 states and 139 transitions. [2025-01-09 16:40:31,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 222 transitions, 2380 flow [2025-01-09 16:40:31,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 222 transitions, 2322 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:31,476 INFO L231 Difference]: Finished difference. Result has 111 places, 150 transitions, 1579 flow [2025-01-09 16:40:31,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1579, PETRI_PLACES=111, PETRI_TRANSITIONS=150} [2025-01-09 16:40:31,476 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places. [2025-01-09 16:40:31,476 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 150 transitions, 1579 flow [2025-01-09 16:40:31,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:31,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:31,476 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] [2025-01-09 16:40:31,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:40:31,477 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:31,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:31,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1975501359, now seen corresponding path program 2 times [2025-01-09 16:40:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:31,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084572771] [2025-01-09 16:40:31,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:31,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:31,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:40:31,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-01-09 16:40:31,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:31,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:31,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:31,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084572771] [2025-01-09 16:40:31,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084572771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:31,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:31,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:31,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926252202] [2025-01-09 16:40:31,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:31,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:31,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:31,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:31,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:31,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:31,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 150 transitions, 1579 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:31,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:31,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:31,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:32,793 INFO L124 PetriNetUnfolderBase]: 14272/20175 cut-off events. [2025-01-09 16:40:32,794 INFO L125 PetriNetUnfolderBase]: For 116055/116099 co-relation queries the response was YES. [2025-01-09 16:40:32,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78769 conditions, 20175 events. 14272/20175 cut-off events. For 116055/116099 co-relation queries the response was YES. Maximal size of possible extension queue 1010. Compared 117380 event pairs, 7217 based on Foata normal form. 1/20124 useless extension candidates. Maximal degree in co-relation 74111. Up to 14470 conditions per place. [2025-01-09 16:40:32,901 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 182 selfloop transitions, 26 changer transitions 3/215 dead transitions. [2025-01-09 16:40:32,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 215 transitions, 2358 flow [2025-01-09 16:40:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-01-09 16:40:32,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5551020408163265 [2025-01-09 16:40:32,902 INFO L175 Difference]: Start difference. First operand has 111 places, 150 transitions, 1579 flow. Second operand 5 states and 136 transitions. [2025-01-09 16:40:32,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 215 transitions, 2358 flow [2025-01-09 16:40:33,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 215 transitions, 2328 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:33,108 INFO L231 Difference]: Finished difference. Result has 117 places, 154 transitions, 1712 flow [2025-01-09 16:40:33,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1554, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1712, PETRI_PLACES=117, PETRI_TRANSITIONS=154} [2025-01-09 16:40:33,108 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places. [2025-01-09 16:40:33,108 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 154 transitions, 1712 flow [2025-01-09 16:40:33,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:33,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:33,109 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] [2025-01-09 16:40:33,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:40:33,109 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:33,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1874980061, now seen corresponding path program 3 times [2025-01-09 16:40:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450653934] [2025-01-09 16:40:33,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:40:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:33,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:40:33,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-01-09 16:40:33,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:40:33,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:33,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:33,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450653934] [2025-01-09 16:40:33,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450653934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:33,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:33,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:33,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054723472] [2025-01-09 16:40:33,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:33,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:33,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:33,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:33,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:33,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:33,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 154 transitions, 1712 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:33,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:33,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:33,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:34,987 INFO L124 PetriNetUnfolderBase]: 18182/26245 cut-off events. [2025-01-09 16:40:34,987 INFO L125 PetriNetUnfolderBase]: For 155384/155424 co-relation queries the response was YES. [2025-01-09 16:40:35,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101617 conditions, 26245 events. 18182/26245 cut-off events. For 155384/155424 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 168198 event pairs, 2716 based on Foata normal form. 1/26244 useless extension candidates. Maximal degree in co-relation 98017. Up to 8197 conditions per place. [2025-01-09 16:40:35,179 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 232 selfloop transitions, 45 changer transitions 4/285 dead transitions. [2025-01-09 16:40:35,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 285 transitions, 3305 flow [2025-01-09 16:40:35,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:40:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:40:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-01-09 16:40:35,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-01-09 16:40:35,180 INFO L175 Difference]: Start difference. First operand has 117 places, 154 transitions, 1712 flow. Second operand 6 states and 177 transitions. [2025-01-09 16:40:35,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 285 transitions, 3305 flow [2025-01-09 16:40:35,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 285 transitions, 3271 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:35,466 INFO L231 Difference]: Finished difference. Result has 125 places, 175 transitions, 2128 flow [2025-01-09 16:40:35,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1688, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2128, PETRI_PLACES=125, PETRI_TRANSITIONS=175} [2025-01-09 16:40:35,466 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2025-01-09 16:40:35,466 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 175 transitions, 2128 flow [2025-01-09 16:40:35,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:35,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:35,467 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] [2025-01-09 16:40:35,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:40:35,467 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:35,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1176248759, now seen corresponding path program 4 times [2025-01-09 16:40:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:35,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593894660] [2025-01-09 16:40:35,467 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:40:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:35,473 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:40:35,475 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-01-09 16:40:35,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:40:35,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:35,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:35,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593894660] [2025-01-09 16:40:35,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593894660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:35,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:35,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:35,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418364292] [2025-01-09 16:40:35,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:35,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:35,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:35,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:35,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:35,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:35,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 175 transitions, 2128 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:35,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:35,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:35,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:37,750 INFO L124 PetriNetUnfolderBase]: 18547/26614 cut-off events. [2025-01-09 16:40:37,750 INFO L125 PetriNetUnfolderBase]: For 184211/184291 co-relation queries the response was YES. [2025-01-09 16:40:37,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110032 conditions, 26614 events. 18547/26614 cut-off events. For 184211/184291 co-relation queries the response was YES. Maximal size of possible extension queue 1373. Compared 167883 event pairs, 4615 based on Foata normal form. 33/26627 useless extension candidates. Maximal degree in co-relation 106434. Up to 11912 conditions per place. [2025-01-09 16:40:37,984 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 228 selfloop transitions, 35 changer transitions 15/282 dead transitions. [2025-01-09 16:40:37,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 282 transitions, 3521 flow [2025-01-09 16:40:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:40:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:40:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2025-01-09 16:40:37,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5680272108843537 [2025-01-09 16:40:37,985 INFO L175 Difference]: Start difference. First operand has 125 places, 175 transitions, 2128 flow. Second operand 6 states and 167 transitions. [2025-01-09 16:40:37,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 282 transitions, 3521 flow [2025-01-09 16:40:38,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 282 transitions, 3457 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-01-09 16:40:38,906 INFO L231 Difference]: Finished difference. Result has 134 places, 180 transitions, 2276 flow [2025-01-09 16:40:38,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2276, PETRI_PLACES=134, PETRI_TRANSITIONS=180} [2025-01-09 16:40:38,907 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places. [2025-01-09 16:40:38,907 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 180 transitions, 2276 flow [2025-01-09 16:40:38,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:38,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:38,907 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] [2025-01-09 16:40:38,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:40:38,907 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:38,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash 526319599, now seen corresponding path program 5 times [2025-01-09 16:40:38,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:38,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677976864] [2025-01-09 16:40:38,908 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:38,912 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:40:38,919 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:40:38,921 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:40:38,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677976864] [2025-01-09 16:40:38,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677976864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:38,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:38,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549283770] [2025-01-09 16:40:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:38,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:38,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:38,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:38,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:38,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 180 transitions, 2276 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:38,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:38,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:38,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:40,750 INFO L124 PetriNetUnfolderBase]: 18382/26303 cut-off events. [2025-01-09 16:40:40,750 INFO L125 PetriNetUnfolderBase]: For 188470/188514 co-relation queries the response was YES. [2025-01-09 16:40:40,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110173 conditions, 26303 events. 18382/26303 cut-off events. For 188470/188514 co-relation queries the response was YES. Maximal size of possible extension queue 1343. Compared 164355 event pairs, 9149 based on Foata normal form. 1/26250 useless extension candidates. Maximal degree in co-relation 110051. Up to 20279 conditions per place. [2025-01-09 16:40:40,998 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 188 selfloop transitions, 30 changer transitions 8/230 dead transitions. [2025-01-09 16:40:40,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 230 transitions, 2955 flow [2025-01-09 16:40:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-01-09 16:40:40,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-01-09 16:40:40,999 INFO L175 Difference]: Start difference. First operand has 134 places, 180 transitions, 2276 flow. Second operand 5 states and 131 transitions. [2025-01-09 16:40:40,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 230 transitions, 2955 flow [2025-01-09 16:40:41,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 230 transitions, 2931 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:41,627 INFO L231 Difference]: Finished difference. Result has 137 places, 177 transitions, 2284 flow [2025-01-09 16:40:41,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2284, PETRI_PLACES=137, PETRI_TRANSITIONS=177} [2025-01-09 16:40:41,627 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 94 predicate places. [2025-01-09 16:40:41,627 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 177 transitions, 2284 flow [2025-01-09 16:40:41,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:41,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:41,628 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] [2025-01-09 16:40:41,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:40:41,628 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:41,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:41,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2086112265, now seen corresponding path program 6 times [2025-01-09 16:40:41,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:41,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224669703] [2025-01-09 16:40:41,628 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:40:41,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:41,633 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:40:41,638 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-01-09 16:40:41,638 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:40:41,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:41,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224669703] [2025-01-09 16:40:41,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224669703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:41,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:41,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:41,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445075886] [2025-01-09 16:40:41,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:41,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:41,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:41,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:41,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:41,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:41,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 177 transitions, 2284 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:41,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:41,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:41,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:43,550 INFO L124 PetriNetUnfolderBase]: 18213/26113 cut-off events. [2025-01-09 16:40:43,550 INFO L125 PetriNetUnfolderBase]: For 192190/192190 co-relation queries the response was YES. [2025-01-09 16:40:43,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109642 conditions, 26113 events. 18213/26113 cut-off events. For 192190/192190 co-relation queries the response was YES. Maximal size of possible extension queue 1331. Compared 162955 event pairs, 6148 based on Foata normal form. 1/26098 useless extension candidates. Maximal degree in co-relation 107645. Up to 13773 conditions per place. [2025-01-09 16:40:43,785 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 162 selfloop transitions, 57 changer transitions 9/232 dead transitions. [2025-01-09 16:40:43,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 232 transitions, 3048 flow [2025-01-09 16:40:43,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-01-09 16:40:43,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-01-09 16:40:43,786 INFO L175 Difference]: Start difference. First operand has 137 places, 177 transitions, 2284 flow. Second operand 5 states and 131 transitions. [2025-01-09 16:40:43,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 232 transitions, 3048 flow [2025-01-09 16:40:44,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 232 transitions, 2957 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-09 16:40:44,413 INFO L231 Difference]: Finished difference. Result has 138 places, 173 transitions, 2244 flow [2025-01-09 16:40:44,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2244, PETRI_PLACES=138, PETRI_TRANSITIONS=173} [2025-01-09 16:40:44,414 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2025-01-09 16:40:44,414 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 173 transitions, 2244 flow [2025-01-09 16:40:44,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:44,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:44,414 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] [2025-01-09 16:40:44,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:40:44,415 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:44,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:44,415 INFO L85 PathProgramCache]: Analyzing trace with hash -317066187, now seen corresponding path program 1 times [2025-01-09 16:40:44,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:44,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597180680] [2025-01-09 16:40:44,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:40:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:44,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:40:44,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:40:44,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:40:44,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:44,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:44,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597180680] [2025-01-09 16:40:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597180680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:44,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:44,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:44,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196954094] [2025-01-09 16:40:44,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:44,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:44,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:44,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:44,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:44,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:44,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 173 transitions, 2244 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:44,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:44,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:44,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:46,444 INFO L124 PetriNetUnfolderBase]: 19171/27493 cut-off events. [2025-01-09 16:40:46,444 INFO L125 PetriNetUnfolderBase]: For 208716/208760 co-relation queries the response was YES. [2025-01-09 16:40:46,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116081 conditions, 27493 events. 19171/27493 cut-off events. For 208716/208760 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 173714 event pairs, 8557 based on Foata normal form. 1/27444 useless extension candidates. Maximal degree in co-relation 114387. Up to 18928 conditions per place. [2025-01-09 16:40:46,776 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 217 selfloop transitions, 18 changer transitions 3/242 dead transitions. [2025-01-09 16:40:46,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 242 transitions, 3173 flow [2025-01-09 16:40:46,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-01-09 16:40:46,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2025-01-09 16:40:46,777 INFO L175 Difference]: Start difference. First operand has 138 places, 173 transitions, 2244 flow. Second operand 5 states and 138 transitions. [2025-01-09 16:40:46,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 242 transitions, 3173 flow [2025-01-09 16:40:47,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 242 transitions, 3042 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-09 16:40:47,310 INFO L231 Difference]: Finished difference. Result has 142 places, 177 transitions, 2280 flow [2025-01-09 16:40:47,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2280, PETRI_PLACES=142, PETRI_TRANSITIONS=177} [2025-01-09 16:40:47,311 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 99 predicate places. [2025-01-09 16:40:47,311 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 177 transitions, 2280 flow [2025-01-09 16:40:47,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:47,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:47,311 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] [2025-01-09 16:40:47,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:40:47,311 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:47,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2122879917, now seen corresponding path program 2 times [2025-01-09 16:40:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:47,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017555710] [2025-01-09 16:40:47,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:40:47,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:47,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:40:47,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-01-09 16:40:47,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:40:47,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:47,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:47,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017555710] [2025-01-09 16:40:47,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017555710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:47,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:47,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158871966] [2025-01-09 16:40:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:47,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:47,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:47,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:47,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:47,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 177 transitions, 2280 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:47,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:47,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:47,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:50,225 INFO L124 PetriNetUnfolderBase]: 19009/27257 cut-off events. [2025-01-09 16:40:50,225 INFO L125 PetriNetUnfolderBase]: For 203860/203940 co-relation queries the response was YES. [2025-01-09 16:40:50,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114142 conditions, 27257 events. 19009/27257 cut-off events. For 203860/203940 co-relation queries the response was YES. Maximal size of possible extension queue 1379. Compared 172126 event pairs, 5311 based on Foata normal form. 33/27270 useless extension candidates. Maximal degree in co-relation 110870. Up to 13877 conditions per place. [2025-01-09 16:40:50,447 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 219 selfloop transitions, 24 changer transitions 3/250 dead transitions. [2025-01-09 16:40:50,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 250 transitions, 3370 flow [2025-01-09 16:40:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-01-09 16:40:50,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-01-09 16:40:50,448 INFO L175 Difference]: Start difference. First operand has 142 places, 177 transitions, 2280 flow. Second operand 5 states and 137 transitions. [2025-01-09 16:40:50,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 250 transitions, 3370 flow [2025-01-09 16:40:50,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 250 transitions, 3348 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:50,929 INFO L231 Difference]: Finished difference. Result has 148 places, 187 transitions, 2601 flow [2025-01-09 16:40:50,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2601, PETRI_PLACES=148, PETRI_TRANSITIONS=187} [2025-01-09 16:40:50,929 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 105 predicate places. [2025-01-09 16:40:50,929 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 187 transitions, 2601 flow [2025-01-09 16:40:50,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:50,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:50,929 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] [2025-01-09 16:40:50,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:40:50,929 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1606246415, now seen corresponding path program 3 times [2025-01-09 16:40:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56416943] [2025-01-09 16:40:50,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:40:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:50,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:40:50,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-01-09 16:40:50,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:40:50,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:50,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:50,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56416943] [2025-01-09 16:40:50,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56416943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:50,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:50,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:50,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501801787] [2025-01-09 16:40:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:50,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:50,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:50,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:50,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:50,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:50,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 187 transitions, 2601 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:50,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:50,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:50,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:53,408 INFO L124 PetriNetUnfolderBase]: 18847/27027 cut-off events. [2025-01-09 16:40:53,409 INFO L125 PetriNetUnfolderBase]: For 221611/221655 co-relation queries the response was YES. [2025-01-09 16:40:53,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115186 conditions, 27027 events. 18847/27027 cut-off events. For 221611/221655 co-relation queries the response was YES. Maximal size of possible extension queue 1357. Compared 170243 event pairs, 8867 based on Foata normal form. 1/26978 useless extension candidates. Maximal degree in co-relation 111913. Up to 18928 conditions per place. [2025-01-09 16:40:53,677 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 196 selfloop transitions, 30 changer transitions 8/238 dead transitions. [2025-01-09 16:40:53,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 238 transitions, 3282 flow [2025-01-09 16:40:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:40:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:40:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-01-09 16:40:53,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-01-09 16:40:53,679 INFO L175 Difference]: Start difference. First operand has 148 places, 187 transitions, 2601 flow. Second operand 5 states and 133 transitions. [2025-01-09 16:40:53,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 238 transitions, 3282 flow [2025-01-09 16:40:54,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 238 transitions, 3243 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-01-09 16:40:54,454 INFO L231 Difference]: Finished difference. Result has 152 places, 182 transitions, 2566 flow [2025-01-09 16:40:54,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2564, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2566, PETRI_PLACES=152, PETRI_TRANSITIONS=182} [2025-01-09 16:40:54,454 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2025-01-09 16:40:54,454 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 182 transitions, 2566 flow [2025-01-09 16:40:54,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:54,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:54,455 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] [2025-01-09 16:40:54,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:40:54,455 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:54,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:54,455 INFO L85 PathProgramCache]: Analyzing trace with hash -470322553, now seen corresponding path program 4 times [2025-01-09 16:40:54,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:54,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320996107] [2025-01-09 16:40:54,455 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:40:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:54,460 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:40:54,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-01-09 16:40:54,462 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:40:54,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:54,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:54,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320996107] [2025-01-09 16:40:54,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320996107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:54,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:54,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:54,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679862005] [2025-01-09 16:40:54,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:54,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:54,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:54,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:54,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:54,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:54,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 182 transitions, 2566 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:54,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:54,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:54,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:57,621 INFO L124 PetriNetUnfolderBase]: 22622/32596 cut-off events. [2025-01-09 16:40:57,622 INFO L125 PetriNetUnfolderBase]: For 248186/248266 co-relation queries the response was YES. [2025-01-09 16:40:57,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137240 conditions, 32596 events. 22622/32596 cut-off events. For 248186/248266 co-relation queries the response was YES. Maximal size of possible extension queue 1639. Compared 212931 event pairs, 3595 based on Foata normal form. 41/32635 useless extension candidates. Maximal degree in co-relation 134499. Up to 11200 conditions per place. [2025-01-09 16:40:58,023 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 225 selfloop transitions, 62 changer transitions 4/295 dead transitions. [2025-01-09 16:40:58,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 295 transitions, 3991 flow [2025-01-09 16:40:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:40:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:40:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-01-09 16:40:58,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-01-09 16:40:58,024 INFO L175 Difference]: Start difference. First operand has 152 places, 182 transitions, 2566 flow. Second operand 6 states and 177 transitions. [2025-01-09 16:40:58,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 295 transitions, 3991 flow [2025-01-09 16:40:58,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 295 transitions, 3876 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-01-09 16:40:58,808 INFO L231 Difference]: Finished difference. Result has 156 places, 200 transitions, 3033 flow [2025-01-09 16:40:58,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2469, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3033, PETRI_PLACES=156, PETRI_TRANSITIONS=200} [2025-01-09 16:40:58,808 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 113 predicate places. [2025-01-09 16:40:58,808 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 200 transitions, 3033 flow [2025-01-09 16:40:58,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:58,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:58,808 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] [2025-01-09 16:40:58,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 16:40:58,808 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:40:58,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash -916683773, now seen corresponding path program 5 times [2025-01-09 16:40:58,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:58,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815694111] [2025-01-09 16:40:58,809 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:58,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:58,814 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:40:58,818 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:40:58,818 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:40:58,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:40:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815694111] [2025-01-09 16:40:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815694111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:40:58,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:40:58,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:40:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409234225] [2025-01-09 16:40:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:40:58,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:40:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:40:58,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:40:58,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:40:58,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:40:58,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 200 transitions, 3033 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:40:58,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:40:58,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:40:58,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:01,878 INFO L124 PetriNetUnfolderBase]: 22440/32237 cut-off events. [2025-01-09 16:41:01,878 INFO L125 PetriNetUnfolderBase]: For 288961/288961 co-relation queries the response was YES. [2025-01-09 16:41:02,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142285 conditions, 32237 events. 22440/32237 cut-off events. For 288961/288961 co-relation queries the response was YES. Maximal size of possible extension queue 1621. Compared 208235 event pairs, 8510 based on Foata normal form. 1/32226 useless extension candidates. Maximal degree in co-relation 137832. Up to 18752 conditions per place. [2025-01-09 16:41:02,274 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 171 selfloop transitions, 74 changer transitions 8/257 dead transitions. [2025-01-09 16:41:02,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 257 transitions, 3894 flow [2025-01-09 16:41:02,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:41:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:41:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-01-09 16:41:02,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-01-09 16:41:02,275 INFO L175 Difference]: Start difference. First operand has 156 places, 200 transitions, 3033 flow. Second operand 5 states and 133 transitions. [2025-01-09 16:41:02,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 257 transitions, 3894 flow [2025-01-09 16:41:04,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 257 transitions, 3806 flow, removed 25 selfloop flow, removed 1 redundant places. [2025-01-09 16:41:04,126 INFO L231 Difference]: Finished difference. Result has 160 places, 196 transitions, 3044 flow [2025-01-09 16:41:04,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2955, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3044, PETRI_PLACES=160, PETRI_TRANSITIONS=196} [2025-01-09 16:41:04,127 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2025-01-09 16:41:04,127 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 196 transitions, 3044 flow [2025-01-09 16:41:04,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:41:04,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:04,127 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] [2025-01-09 16:41:04,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 16:41:04,127 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:41:04,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1969076129, now seen corresponding path program 6 times [2025-01-09 16:41:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409176807] [2025-01-09 16:41:04,127 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:41:04,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:04,132 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:41:04,135 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-01-09 16:41:04,135 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:41:04,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:41:04,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:04,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409176807] [2025-01-09 16:41:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409176807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:04,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:41:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156910509] [2025-01-09 16:41:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:04,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:41:04,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:04,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:41:04,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:41:04,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-01-09 16:41:04,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 196 transitions, 3044 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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-01-09 16:41:04,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:04,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-01-09 16:41:04,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:07,642 INFO L124 PetriNetUnfolderBase]: 22222/31968 cut-off events. [2025-01-09 16:41:07,642 INFO L125 PetriNetUnfolderBase]: For 292561/292561 co-relation queries the response was YES. [2025-01-09 16:41:07,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140693 conditions, 31968 events. 22222/31968 cut-off events. For 292561/292561 co-relation queries the response was YES. Maximal size of possible extension queue 1603. Compared 206833 event pairs, 4941 based on Foata normal form. 1/31959 useless extension candidates. Maximal degree in co-relation 137732. Up to 12541 conditions per place. [2025-01-09 16:41:08,070 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 200 selfloop transitions, 88 changer transitions 4/296 dead transitions. [2025-01-09 16:41:08,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 296 transitions, 4289 flow [2025-01-09 16:41:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:41:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:41:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-01-09 16:41:08,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-01-09 16:41:08,071 INFO L175 Difference]: Start difference. First operand has 160 places, 196 transitions, 3044 flow. Second operand 6 states and 175 transitions. [2025-01-09 16:41:08,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 296 transitions, 4289 flow