./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-min-max-1.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/parallel-min-max-1.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 bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:41:25,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:41:26,035 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:41:26,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:41:26,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:41:26,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:41:26,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:41:26,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:41:26,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:41:26,063 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:41:26,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:41:26,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:41:26,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:41:26,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:41:26,064 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:41:26,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:41:26,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:41:26,065 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:41:26,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:41:26,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:41:26,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:41:26,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:41:26,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:41:26,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:41:26,066 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:41:26,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:41:26,066 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:41:26,066 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:41:26,066 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:41:26,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:41:26,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:41:26,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:41:26,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:41:26,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:41:26,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:41:26,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:41:26,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:41:26,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:41:26,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:41:26,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:41:26,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:41:26,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:41:26,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:41:26,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:41:26,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:41:26,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:41:26,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:41:26,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:41:26,069 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 -> bf26be9bd61f36f1b6136fc4e500a91a95d08528025fd00027577283116c4a35 [2025-01-09 16:41:26,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:41:26,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:41:26,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:41:26,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:41:26,415 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:41:26,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-01-09 16:41:27,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d1b03faf/156be257b1f74410ae3ed94424c742f1/FLAGc18780568 [2025-01-09 16:41:27,897 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:41:27,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2025-01-09 16:41:27,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d1b03faf/156be257b1f74410ae3ed94424c742f1/FLAGc18780568 [2025-01-09 16:41:27,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d1b03faf/156be257b1f74410ae3ed94424c742f1 [2025-01-09 16:41:27,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:41:27,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:41:27,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:41:27,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:41:27,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:41:27,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:41:27" (1/1) ... [2025-01-09 16:41:27,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9fcaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:27, skipping insertion in model container [2025-01-09 16:41:27,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:41:27" (1/1) ... [2025-01-09 16:41:27,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:41:28,117 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/parallel-min-max-1.wvr.c[2642,2655] [2025-01-09 16:41:28,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:41:28,139 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:41:28,168 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/parallel-min-max-1.wvr.c[2642,2655] [2025-01-09 16:41:28,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:41:28,187 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:41:28,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28 WrapperNode [2025-01-09 16:41:28,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:41:28,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:41:28,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:41:28,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:41:28,196 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:41:28" (1/1) ... [2025-01-09 16:41:28,202 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:41:28" (1/1) ... [2025-01-09 16:41:28,225 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-01-09 16:41:28,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:41:28,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:41:28,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:41:28,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:41:28,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,265 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:41:28,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:41:28,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:41:28,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:41:28,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:41:28,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (1/1) ... [2025-01-09 16:41:28,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:41:28,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:41:28,327 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:41:28,331 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:41:28,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:41:28,356 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:41:28,356 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:41:28,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:41:28,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:41:28,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:41:28,358 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:41:28,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:41:28,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:41:28,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:41:28,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:41:28,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:41:28,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:41:28,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:41:28,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:41:28,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:41:28,359 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:41:28,469 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:41:28,471 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:41:28,769 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:41:28,770 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:41:28,970 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:41:28,971 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:41:28,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:41:28 BoogieIcfgContainer [2025-01-09 16:41:28,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:41:28,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:41:28,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:41:28,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:41:28,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:41:27" (1/3) ... [2025-01-09 16:41:28,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9a829a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:41:28, skipping insertion in model container [2025-01-09 16:41:28,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:41:28" (2/3) ... [2025-01-09 16:41:28,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9a829a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:41:28, skipping insertion in model container [2025-01-09 16:41:28,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:41:28" (3/3) ... [2025-01-09 16:41:28,982 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2025-01-09 16:41:28,994 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:41:28,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-min-max-1.wvr.c that has 4 procedures, 51 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:41:28,996 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:41:29,068 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:41:29,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 131 flow [2025-01-09 16:41:29,150 INFO L124 PetriNetUnfolderBase]: 5/52 cut-off events. [2025-01-09 16:41:29,152 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:41:29,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 5/52 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-01-09 16:41:29,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 55 transitions, 131 flow [2025-01-09 16:41:29,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 51 transitions, 120 flow [2025-01-09 16:41:29,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:41:29,188 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;@123a5ccb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:41:29,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:41:29,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:41:29,215 INFO L124 PetriNetUnfolderBase]: 5/50 cut-off events. [2025-01-09 16:41:29,216 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:41:29,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:29,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:29,217 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:41:29,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2018428145, now seen corresponding path program 1 times [2025-01-09 16:41:29,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:29,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436145187] [2025-01-09 16:41:29,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:29,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:41:29,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:41:29,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:29,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:29,742 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:41:29,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436145187] [2025-01-09 16:41:29,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436145187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:29,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:29,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:41:29,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801931812] [2025-01-09 16:41:29,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:29,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:41:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:29,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:41:29,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:41:29,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-09 16:41:29,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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:29,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:29,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-09 16:41:29,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:30,191 INFO L124 PetriNetUnfolderBase]: 1146/1717 cut-off events. [2025-01-09 16:41:30,191 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-01-09 16:41:30,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3462 conditions, 1717 events. 1146/1717 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8095 event pairs, 535 based on Foata normal form. 0/1329 useless extension candidates. Maximal degree in co-relation 3278. Up to 995 conditions per place. [2025-01-09 16:41:30,213 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 46 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2025-01-09 16:41:30,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 254 flow [2025-01-09 16:41:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:41:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:41:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-01-09 16:41:30,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-01-09 16:41:30,227 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 120 flow. Second operand 4 states and 130 transitions. [2025-01-09 16:41:30,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 254 flow [2025-01-09 16:41:30,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:41:30,240 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 122 flow [2025-01-09 16:41:30,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2025-01-09 16:41:30,247 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-01-09 16:41:30,247 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 122 flow [2025-01-09 16:41:30,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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:30,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:30,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:30,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:41:30,248 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:41:30,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:30,248 INFO L85 PathProgramCache]: Analyzing trace with hash 189832812, now seen corresponding path program 1 times [2025-01-09 16:41:30,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:30,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108349759] [2025-01-09 16:41:30,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:30,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:30,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 16:41:30,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 16:41:30,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:30,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:30,453 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:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108349759] [2025-01-09 16:41:30,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108349759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:30,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:30,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:41:30,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182367783] [2025-01-09 16:41:30,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:30,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:41:30,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:30,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:41:30,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:41:30,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-09 16:41:30,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:30,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:30,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-09 16:41:30,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:30,759 INFO L124 PetriNetUnfolderBase]: 1541/2310 cut-off events. [2025-01-09 16:41:30,759 INFO L125 PetriNetUnfolderBase]: For 142/176 co-relation queries the response was YES. [2025-01-09 16:41:30,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4805 conditions, 2310 events. 1541/2310 cut-off events. For 142/176 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11135 event pairs, 780 based on Foata normal form. 34/1969 useless extension candidates. Maximal degree in co-relation 890. Up to 1350 conditions per place. [2025-01-09 16:41:30,775 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 49 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2025-01-09 16:41:30,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 269 flow [2025-01-09 16:41:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:41:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:41:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-01-09 16:41:30,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5954545454545455 [2025-01-09 16:41:30,778 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 122 flow. Second operand 4 states and 131 transitions. [2025-01-09 16:41:30,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 269 flow [2025-01-09 16:41:30,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:41:30,783 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 132 flow [2025-01-09 16:41:30,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2025-01-09 16:41:30,785 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2025-01-09 16:41:30,785 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 132 flow [2025-01-09 16:41:30,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:41:30,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:30,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, 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:30,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:41:30,786 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:41:30,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:30,787 INFO L85 PathProgramCache]: Analyzing trace with hash 65793023, now seen corresponding path program 1 times [2025-01-09 16:41:30,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:30,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294624088] [2025-01-09 16:41:30,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:30,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:30,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 16:41:30,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 16:41:30,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:30,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:30,986 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:30,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:30,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294624088] [2025-01-09 16:41:30,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294624088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:30,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:30,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:41:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980135884] [2025-01-09 16:41:30,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:30,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:41:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:30,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:41:30,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:41:30,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2025-01-09 16:41:30,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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:30,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:30,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2025-01-09 16:41:30,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:31,244 INFO L124 PetriNetUnfolderBase]: 1407/2117 cut-off events. [2025-01-09 16:41:31,245 INFO L125 PetriNetUnfolderBase]: For 150/232 co-relation queries the response was YES. [2025-01-09 16:41:31,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4583 conditions, 2117 events. 1407/2117 cut-off events. For 150/232 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9978 event pairs, 1128 based on Foata normal form. 82/1895 useless extension candidates. Maximal degree in co-relation 1549. Up to 1902 conditions per place. [2025-01-09 16:41:31,258 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 33 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2025-01-09 16:41:31,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 206 flow [2025-01-09 16:41:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:41:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:41:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-01-09 16:41:31,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5409090909090909 [2025-01-09 16:41:31,260 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 132 flow. Second operand 4 states and 119 transitions. [2025-01-09 16:41:31,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 206 flow [2025-01-09 16:41:31,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:41:31,262 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 142 flow [2025-01-09 16:41:31,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2025-01-09 16:41:31,263 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2025-01-09 16:41:31,263 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 142 flow [2025-01-09 16:41:31,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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:31,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:31,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:41:31,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:41:31,263 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:41:31,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash 426004368, now seen corresponding path program 1 times [2025-01-09 16:41:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:31,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492101718] [2025-01-09 16:41:31,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:31,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:31,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 16:41:31,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 16:41:31,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:31,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:31,633 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:31,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:31,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492101718] [2025-01-09 16:41:31,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492101718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:31,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:31,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:41:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565748333] [2025-01-09 16:41:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:31,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:41:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:31,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:41:31,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:41:31,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 55 [2025-01-09 16:41:31,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 142 flow. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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:31,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:31,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 55 [2025-01-09 16:41:31,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:33,160 INFO L124 PetriNetUnfolderBase]: 8081/11550 cut-off events. [2025-01-09 16:41:33,160 INFO L125 PetriNetUnfolderBase]: For 1282/1603 co-relation queries the response was YES. [2025-01-09 16:41:33,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25493 conditions, 11550 events. 8081/11550 cut-off events. For 1282/1603 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 60167 event pairs, 1170 based on Foata normal form. 324/10826 useless extension candidates. Maximal degree in co-relation 25456. Up to 2511 conditions per place. [2025-01-09 16:41:33,220 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 128 selfloop transitions, 18 changer transitions 116/267 dead transitions. [2025-01-09 16:41:33,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 267 transitions, 1212 flow [2025-01-09 16:41:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 16:41:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-09 16:41:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 374 transitions. [2025-01-09 16:41:33,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-01-09 16:41:33,226 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 142 flow. Second operand 16 states and 374 transitions. [2025-01-09 16:41:33,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 267 transitions, 1212 flow [2025-01-09 16:41:33,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 267 transitions, 1206 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:41:33,235 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 247 flow [2025-01-09 16:41:33,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=247, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2025-01-09 16:41:33,236 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2025-01-09 16:41:33,237 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 247 flow [2025-01-09 16:41:33,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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:33,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:33,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:41:33,238 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:41:33,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:33,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1114432173, now seen corresponding path program 1 times [2025-01-09 16:41:33,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:33,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454711755] [2025-01-09 16:41:33,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:33,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:33,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 16:41:33,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:41:33,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:33,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:33,654 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:33,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:33,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454711755] [2025-01-09 16:41:33,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454711755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:33,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:33,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:41:33,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400860130] [2025-01-09 16:41:33,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:33,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:41:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:33,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:41:33,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:41:33,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-01-09 16:41:33,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 247 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:33,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:33,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-01-09 16:41:33,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:35,885 INFO L124 PetriNetUnfolderBase]: 9391/13551 cut-off events. [2025-01-09 16:41:35,885 INFO L125 PetriNetUnfolderBase]: For 13235/13409 co-relation queries the response was YES. [2025-01-09 16:41:35,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37049 conditions, 13551 events. 9391/13551 cut-off events. For 13235/13409 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 72493 event pairs, 1315 based on Foata normal form. 174/12409 useless extension candidates. Maximal degree in co-relation 37011. Up to 3770 conditions per place. [2025-01-09 16:41:35,963 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 219 selfloop transitions, 44 changer transitions 122/389 dead transitions. [2025-01-09 16:41:35,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 389 transitions, 2061 flow [2025-01-09 16:41:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 16:41:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-09 16:41:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 545 transitions. [2025-01-09 16:41:35,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3811188811188811 [2025-01-09 16:41:35,967 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 247 flow. Second operand 26 states and 545 transitions. [2025-01-09 16:41:35,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 389 transitions, 2061 flow [2025-01-09 16:41:36,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 389 transitions, 2001 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-01-09 16:41:36,073 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 524 flow [2025-01-09 16:41:36,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=524, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2025-01-09 16:41:36,074 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places. [2025-01-09 16:41:36,074 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 524 flow [2025-01-09 16:41:36,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:36,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:36,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:41:36,076 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:41:36,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1782306773, now seen corresponding path program 1 times [2025-01-09 16:41:36,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:36,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35265182] [2025-01-09 16:41:36,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:36,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 16:41:36,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:41:36,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:36,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:41:36,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:36,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35265182] [2025-01-09 16:41:36,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35265182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:36,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:36,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:41:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230631516] [2025-01-09 16:41:36,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:36,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:41:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:36,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:41:36,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:41:36,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-01-09 16:41:36,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 524 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:36,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:36,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-01-09 16:41:36,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:38,468 INFO L124 PetriNetUnfolderBase]: 10811/15577 cut-off events. [2025-01-09 16:41:38,468 INFO L125 PetriNetUnfolderBase]: For 39752/39942 co-relation queries the response was YES. [2025-01-09 16:41:38,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50912 conditions, 15577 events. 10811/15577 cut-off events. For 39752/39942 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 84859 event pairs, 1776 based on Foata normal form. 188/14977 useless extension candidates. Maximal degree in co-relation 50852. Up to 6069 conditions per place. [2025-01-09 16:41:38,546 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 228 selfloop transitions, 50 changer transitions 121/403 dead transitions. [2025-01-09 16:41:38,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 403 transitions, 2526 flow [2025-01-09 16:41:38,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 16:41:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-09 16:41:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 537 transitions. [2025-01-09 16:41:38,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37552447552447554 [2025-01-09 16:41:38,549 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 524 flow. Second operand 26 states and 537 transitions. [2025-01-09 16:41:38,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 403 transitions, 2526 flow [2025-01-09 16:41:38,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 403 transitions, 2419 flow, removed 32 selfloop flow, removed 11 redundant places. [2025-01-09 16:41:38,697 INFO L231 Difference]: Finished difference. Result has 126 places, 124 transitions, 764 flow [2025-01-09 16:41:38,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=764, PETRI_PLACES=126, PETRI_TRANSITIONS=124} [2025-01-09 16:41:38,698 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 70 predicate places. [2025-01-09 16:41:38,698 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 124 transitions, 764 flow [2025-01-09 16:41:38,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 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:38,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:38,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:41:38,699 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:41:38,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2031438571, now seen corresponding path program 2 times [2025-01-09 16:41:38,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:38,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508009837] [2025-01-09 16:41:38,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:41:38,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:38,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-09 16:41:38,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 48 statements. [2025-01-09 16:41:38,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:41:38,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:38,947 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:38,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508009837] [2025-01-09 16:41:38,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508009837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:38,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:38,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:41:38,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510219224] [2025-01-09 16:41:38,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:38,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:41:38,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:38,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:41:38,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:41:38,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-01-09 16:41:38,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 124 transitions, 764 flow. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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:38,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:38,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-01-09 16:41:38,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:40,619 INFO L124 PetriNetUnfolderBase]: 10135/14658 cut-off events. [2025-01-09 16:41:40,619 INFO L125 PetriNetUnfolderBase]: For 73412/73672 co-relation queries the response was YES. [2025-01-09 16:41:40,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56381 conditions, 14658 events. 10135/14658 cut-off events. For 73412/73672 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 80731 event pairs, 1867 based on Foata normal form. 192/14780 useless extension candidates. Maximal degree in co-relation 56312. Up to 4816 conditions per place. [2025-01-09 16:41:40,716 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 195 selfloop transitions, 55 changer transitions 53/315 dead transitions. [2025-01-09 16:41:40,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 315 transitions, 2236 flow [2025-01-09 16:41:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:41:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 16:41:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 446 transitions. [2025-01-09 16:41:40,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4505050505050505 [2025-01-09 16:41:40,719 INFO L175 Difference]: Start difference. First operand has 126 places, 124 transitions, 764 flow. Second operand 18 states and 446 transitions. [2025-01-09 16:41:40,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 315 transitions, 2236 flow [2025-01-09 16:41:40,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 315 transitions, 2146 flow, removed 23 selfloop flow, removed 12 redundant places. [2025-01-09 16:41:40,973 INFO L231 Difference]: Finished difference. Result has 128 places, 134 transitions, 913 flow [2025-01-09 16:41:40,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=913, PETRI_PLACES=128, PETRI_TRANSITIONS=134} [2025-01-09 16:41:40,974 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 72 predicate places. [2025-01-09 16:41:40,974 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 134 transitions, 913 flow [2025-01-09 16:41:40,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 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:40,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:40,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:41:40,975 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:41:40,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash -190182513, now seen corresponding path program 3 times [2025-01-09 16:41:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:40,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399244609] [2025-01-09 16:41:40,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:41:40,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:40,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 2 equivalence classes. [2025-01-09 16:41:41,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 48 statements. [2025-01-09 16:41:41,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:41:41,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:41:41,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:41,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399244609] [2025-01-09 16:41:41,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399244609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:41,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:41,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:41:41,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11023614] [2025-01-09 16:41:41,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:41,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:41:41,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:41,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:41:41,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:41:41,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-01-09 16:41:41,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 134 transitions, 913 flow. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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:41,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:41,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-01-09 16:41:41,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:42,091 INFO L124 PetriNetUnfolderBase]: 4784/7211 cut-off events. [2025-01-09 16:41:42,092 INFO L125 PetriNetUnfolderBase]: For 17304/17834 co-relation queries the response was YES. [2025-01-09 16:41:42,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25664 conditions, 7211 events. 4784/7211 cut-off events. For 17304/17834 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 39660 event pairs, 910 based on Foata normal form. 270/7267 useless extension candidates. Maximal degree in co-relation 25615. Up to 3962 conditions per place. [2025-01-09 16:41:42,145 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 118 selfloop transitions, 34 changer transitions 0/189 dead transitions. [2025-01-09 16:41:42,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 189 transitions, 1477 flow [2025-01-09 16:41:42,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:41:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:41:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2025-01-09 16:41:42,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5022727272727273 [2025-01-09 16:41:42,147 INFO L175 Difference]: Start difference. First operand has 128 places, 134 transitions, 913 flow. Second operand 8 states and 221 transitions. [2025-01-09 16:41:42,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 189 transitions, 1477 flow [2025-01-09 16:41:42,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 189 transitions, 1346 flow, removed 13 selfloop flow, removed 15 redundant places. [2025-01-09 16:41:42,212 INFO L231 Difference]: Finished difference. Result has 119 places, 134 transitions, 895 flow [2025-01-09 16:41:42,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=895, PETRI_PLACES=119, PETRI_TRANSITIONS=134} [2025-01-09 16:41:42,213 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 63 predicate places. [2025-01-09 16:41:42,214 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 134 transitions, 895 flow [2025-01-09 16:41:42,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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:42,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:42,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:41:42,214 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:41:42,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:42,215 INFO L85 PathProgramCache]: Analyzing trace with hash -650838467, now seen corresponding path program 2 times [2025-01-09 16:41:42,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:42,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473497354] [2025-01-09 16:41:42,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:41:42,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:42,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-09 16:41:42,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 48 statements. [2025-01-09 16:41:42,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:41:42,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:42,462 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:42,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:42,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473497354] [2025-01-09 16:41:42,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473497354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:42,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:42,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:41:42,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109005291] [2025-01-09 16:41:42,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:42,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:41:42,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:42,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:41:42,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:41:42,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2025-01-09 16:41:42,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 134 transitions, 895 flow. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 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:42,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:42,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2025-01-09 16:41:42,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:43,953 INFO L124 PetriNetUnfolderBase]: 7339/10706 cut-off events. [2025-01-09 16:41:43,953 INFO L125 PetriNetUnfolderBase]: For 66856/67013 co-relation queries the response was YES. [2025-01-09 16:41:43,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44287 conditions, 10706 events. 7339/10706 cut-off events. For 66856/67013 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 54947 event pairs, 1164 based on Foata normal form. 151/10855 useless extension candidates. Maximal degree in co-relation 44212. Up to 4060 conditions per place. [2025-01-09 16:41:44,016 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 216 selfloop transitions, 48 changer transitions 69/337 dead transitions. [2025-01-09 16:41:44,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 337 transitions, 2523 flow [2025-01-09 16:41:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:41:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 16:41:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 426 transitions. [2025-01-09 16:41:44,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36883116883116884 [2025-01-09 16:41:44,021 INFO L175 Difference]: Start difference. First operand has 119 places, 134 transitions, 895 flow. Second operand 21 states and 426 transitions. [2025-01-09 16:41:44,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 337 transitions, 2523 flow [2025-01-09 16:41:44,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 337 transitions, 2435 flow, removed 16 selfloop flow, removed 7 redundant places. [2025-01-09 16:41:44,175 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 981 flow [2025-01-09 16:41:44,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=981, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2025-01-09 16:41:44,176 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 82 predicate places. [2025-01-09 16:41:44,176 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 981 flow [2025-01-09 16:41:44,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 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:44,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:44,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:41:44,177 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:41:44,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1573454194, now seen corresponding path program 1 times [2025-01-09 16:41:44,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:44,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982421067] [2025-01-09 16:41:44,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:41:44,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:44,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:41:44,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:41:44,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:41:44,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:44,468 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:44,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:44,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982421067] [2025-01-09 16:41:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982421067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:41:44,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435199135] [2025-01-09 16:41:44,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:44,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:41:44,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:44,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:41:44,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:41:44,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-01-09 16:41:44,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 136 transitions, 981 flow. Second operand has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 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:44,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:44,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-01-09 16:41:44,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:46,684 INFO L124 PetriNetUnfolderBase]: 8746/12763 cut-off events. [2025-01-09 16:41:46,685 INFO L125 PetriNetUnfolderBase]: For 94337/94351 co-relation queries the response was YES. [2025-01-09 16:41:46,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54278 conditions, 12763 events. 8746/12763 cut-off events. For 94337/94351 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 66668 event pairs, 1151 based on Foata normal form. 10/12773 useless extension candidates. Maximal degree in co-relation 54217. Up to 3350 conditions per place. [2025-01-09 16:41:46,788 INFO L140 encePairwiseOnDemand]: 36/55 looper letters, 307 selfloop transitions, 91 changer transitions 84/485 dead transitions. [2025-01-09 16:41:46,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 485 transitions, 3855 flow [2025-01-09 16:41:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 16:41:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-01-09 16:41:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 596 transitions. [2025-01-09 16:41:46,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3386363636363636 [2025-01-09 16:41:46,791 INFO L175 Difference]: Start difference. First operand has 138 places, 136 transitions, 981 flow. Second operand 32 states and 596 transitions. [2025-01-09 16:41:46,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 485 transitions, 3855 flow [2025-01-09 16:41:47,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 485 transitions, 3696 flow, removed 26 selfloop flow, removed 18 redundant places. [2025-01-09 16:41:47,155 INFO L231 Difference]: Finished difference. Result has 166 places, 175 transitions, 1524 flow [2025-01-09 16:41:47,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1524, PETRI_PLACES=166, PETRI_TRANSITIONS=175} [2025-01-09 16:41:47,156 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 110 predicate places. [2025-01-09 16:41:47,156 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 175 transitions, 1524 flow [2025-01-09 16:41:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 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:47,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:47,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:41:47,157 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:41:47,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash -385792304, now seen corresponding path program 2 times [2025-01-09 16:41:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:47,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678040534] [2025-01-09 16:41:47,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:41:47,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:47,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-09 16:41:47,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:41:47,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:41:47,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:41:47,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:47,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678040534] [2025-01-09 16:41:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678040534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:47,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:47,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:41:47,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682809729] [2025-01-09 16:41:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:47,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:41:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:47,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:41:47,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:41:47,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-01-09 16:41:47,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 175 transitions, 1524 flow. Second operand has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 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:47,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:47,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-01-09 16:41:47,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:50,446 INFO L124 PetriNetUnfolderBase]: 10360/15088 cut-off events. [2025-01-09 16:41:50,446 INFO L125 PetriNetUnfolderBase]: For 177223/177237 co-relation queries the response was YES. [2025-01-09 16:41:50,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75393 conditions, 15088 events. 10360/15088 cut-off events. For 177223/177237 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 81480 event pairs, 1670 based on Foata normal form. 10/15098 useless extension candidates. Maximal degree in co-relation 75305. Up to 6182 conditions per place. [2025-01-09 16:41:50,629 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 365 selfloop transitions, 97 changer transitions 85/550 dead transitions. [2025-01-09 16:41:50,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 550 transitions, 5093 flow [2025-01-09 16:41:50,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 16:41:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-01-09 16:41:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 645 transitions. [2025-01-09 16:41:50,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33506493506493507 [2025-01-09 16:41:50,633 INFO L175 Difference]: Start difference. First operand has 166 places, 175 transitions, 1524 flow. Second operand 35 states and 645 transitions. [2025-01-09 16:41:50,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 550 transitions, 5093 flow [2025-01-09 16:41:51,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 550 transitions, 4679 flow, removed 165 selfloop flow, removed 16 redundant places. [2025-01-09 16:41:51,473 INFO L231 Difference]: Finished difference. Result has 195 places, 212 transitions, 2058 flow [2025-01-09 16:41:51,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2058, PETRI_PLACES=195, PETRI_TRANSITIONS=212} [2025-01-09 16:41:51,474 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 139 predicate places. [2025-01-09 16:41:51,474 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 212 transitions, 2058 flow [2025-01-09 16:41:51,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 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:51,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:51,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:41:51,475 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:41:51,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash -395725642, now seen corresponding path program 3 times [2025-01-09 16:41:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437172382] [2025-01-09 16:41:51,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:41:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:51,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 2 equivalence classes. [2025-01-09 16:41:51,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 47 of 49 statements. [2025-01-09 16:41:51,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:41:51,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:41:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437172382] [2025-01-09 16:41:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437172382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:41:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:41:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:41:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133502037] [2025-01-09 16:41:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:41:51,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:41:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:51,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:41:51,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:41:51,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-01-09 16:41:51,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 212 transitions, 2058 flow. Second operand has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 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:51,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:51,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-01-09 16:41:51,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:41:55,403 INFO L124 PetriNetUnfolderBase]: 13361/19436 cut-off events. [2025-01-09 16:41:55,403 INFO L125 PetriNetUnfolderBase]: For 322628/322680 co-relation queries the response was YES. [2025-01-09 16:41:55,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109501 conditions, 19436 events. 13361/19436 cut-off events. For 322628/322680 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 110278 event pairs, 1292 based on Foata normal form. 20/19233 useless extension candidates. Maximal degree in co-relation 109413. Up to 6261 conditions per place. [2025-01-09 16:41:55,527 INFO L140 encePairwiseOnDemand]: 37/55 looper letters, 304 selfloop transitions, 185 changer transitions 215/717 dead transitions. [2025-01-09 16:41:55,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 717 transitions, 7617 flow [2025-01-09 16:41:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-09 16:41:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-01-09 16:41:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 904 transitions. [2025-01-09 16:41:55,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37355371900826445 [2025-01-09 16:41:55,530 INFO L175 Difference]: Start difference. First operand has 195 places, 212 transitions, 2058 flow. Second operand 44 states and 904 transitions. [2025-01-09 16:41:55,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 717 transitions, 7617 flow [2025-01-09 16:41:56,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 717 transitions, 6965 flow, removed 248 selfloop flow, removed 22 redundant places. [2025-01-09 16:41:56,566 INFO L231 Difference]: Finished difference. Result has 230 places, 297 transitions, 3438 flow [2025-01-09 16:41:56,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=3438, PETRI_PLACES=230, PETRI_TRANSITIONS=297} [2025-01-09 16:41:56,567 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 174 predicate places. [2025-01-09 16:41:56,567 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 297 transitions, 3438 flow [2025-01-09 16:41:56,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 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:56,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:41:56,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:41:56,568 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:41:56,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:41:56,568 INFO L85 PathProgramCache]: Analyzing trace with hash -243397534, now seen corresponding path program 4 times [2025-01-09 16:41:56,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:41:56,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480648766] [2025-01-09 16:41:56,569 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:41:56,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:41:56,577 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-01-09 16:41:56,588 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:41:56,588 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:41:56,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:41:56,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:41:56,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480648766] [2025-01-09 16:41:56,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480648766] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:41:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306427327] [2025-01-09 16:41:56,902 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:41:56,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:41:56,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:41:56,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:41:56,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:41:56,967 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-01-09 16:41:56,997 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:41:56,997 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:41:56,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:41:57,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 16:41:57,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:41:57,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 16:41:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:41:57,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:41:57,327 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 16:41:57,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 16:41:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:41:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306427327] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:41:57,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:41:57,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 22 [2025-01-09 16:41:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823636180] [2025-01-09 16:41:57,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:41:57,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 16:41:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:41:57,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 16:41:57,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:41:57,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-01-09 16:41:57,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 297 transitions, 3438 flow. Second operand has 22 states, 22 states have (on average 13.772727272727273) internal successors, (303), 22 states have internal predecessors, (303), 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:57,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:41:57,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-01-09 16:41:57,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:01,916 INFO L124 PetriNetUnfolderBase]: 13803/20366 cut-off events. [2025-01-09 16:42:01,917 INFO L125 PetriNetUnfolderBase]: For 470256/470292 co-relation queries the response was YES. [2025-01-09 16:42:02,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120455 conditions, 20366 events. 13803/20366 cut-off events. For 470256/470292 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 123405 event pairs, 725 based on Foata normal form. 122/20302 useless extension candidates. Maximal degree in co-relation 120355. Up to 7420 conditions per place. [2025-01-09 16:42:02,189 INFO L140 encePairwiseOnDemand]: 34/55 looper letters, 535 selfloop transitions, 273 changer transitions 152/973 dead transitions. [2025-01-09 16:42:02,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 973 transitions, 12283 flow [2025-01-09 16:42:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-09 16:42:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-01-09 16:42:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 1090 transitions. [2025-01-09 16:42:02,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3538961038961039 [2025-01-09 16:42:02,192 INFO L175 Difference]: Start difference. First operand has 230 places, 297 transitions, 3438 flow. Second operand 56 states and 1090 transitions. [2025-01-09 16:42:02,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 973 transitions, 12283 flow [2025-01-09 16:42:04,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 973 transitions, 11166 flow, removed 436 selfloop flow, removed 22 redundant places. [2025-01-09 16:42:04,378 INFO L231 Difference]: Finished difference. Result has 285 places, 474 transitions, 6219 flow [2025-01-09 16:42:04,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=2982, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=6219, PETRI_PLACES=285, PETRI_TRANSITIONS=474} [2025-01-09 16:42:04,379 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 229 predicate places. [2025-01-09 16:42:04,379 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 474 transitions, 6219 flow [2025-01-09 16:42:04,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.772727272727273) internal successors, (303), 22 states have internal predecessors, (303), 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:42:04,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:04,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:04,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:42:04,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 16:42:04,580 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:42:04,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1896255508, now seen corresponding path program 5 times [2025-01-09 16:42:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-01-09 16:42:04,581 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:42:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:04,593 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-09 16:42:04,601 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:04,602 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:04,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:42:04,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:04,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-01-09 16:42:04,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465913524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:04,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:04,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:42:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496539883] [2025-01-09 16:42:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:04,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:42:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:04,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:42:04,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:42:05,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-01-09 16:42:05,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 474 transitions, 6219 flow. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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:42:05,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:05,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-01-09 16:42:05,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:09,742 INFO L124 PetriNetUnfolderBase]: 14687/21726 cut-off events. [2025-01-09 16:42:09,742 INFO L125 PetriNetUnfolderBase]: For 590441/590455 co-relation queries the response was YES. [2025-01-09 16:42:09,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142421 conditions, 21726 events. 14687/21726 cut-off events. For 590441/590455 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 132706 event pairs, 1368 based on Foata normal form. 10/21632 useless extension candidates. Maximal degree in co-relation 142302. Up to 7153 conditions per place. [2025-01-09 16:42:10,013 INFO L140 encePairwiseOnDemand]: 38/55 looper letters, 432 selfloop transitions, 360 changer transitions 119/914 dead transitions. [2025-01-09 16:42:10,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 914 transitions, 12670 flow [2025-01-09 16:42:10,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 16:42:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-01-09 16:42:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 624 transitions. [2025-01-09 16:42:10,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2909090909090909 [2025-01-09 16:42:10,015 INFO L175 Difference]: Start difference. First operand has 285 places, 474 transitions, 6219 flow. Second operand 39 states and 624 transitions. [2025-01-09 16:42:10,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 914 transitions, 12670 flow [2025-01-09 16:42:13,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 914 transitions, 12096 flow, removed 244 selfloop flow, removed 15 redundant places. [2025-01-09 16:42:13,020 INFO L231 Difference]: Finished difference. Result has 315 places, 582 transitions, 8735 flow [2025-01-09 16:42:13,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=5932, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=8735, PETRI_PLACES=315, PETRI_TRANSITIONS=582} [2025-01-09 16:42:13,021 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 259 predicate places. [2025-01-09 16:42:13,022 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 582 transitions, 8735 flow [2025-01-09 16:42:13,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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:42:13,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:13,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:13,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:42:13,022 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:42:13,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash 329885352, now seen corresponding path program 6 times [2025-01-09 16:42:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:13,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789866417] [2025-01-09 16:42:13,023 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:42:13,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:13,030 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 2 equivalence classes. [2025-01-09 16:42:13,044 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:13,044 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:42:13,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:13,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:13,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789866417] [2025-01-09 16:42:13,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789866417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:13,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:13,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:42:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667406459] [2025-01-09 16:42:13,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:13,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:42:13,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:13,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:42:13,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:42:13,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 55 [2025-01-09 16:42:13,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 582 transitions, 8735 flow. Second operand has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 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:42:13,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:13,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 55 [2025-01-09 16:42:13,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:17,760 INFO L124 PetriNetUnfolderBase]: 14599/21785 cut-off events. [2025-01-09 16:42:17,760 INFO L125 PetriNetUnfolderBase]: For 529581/529603 co-relation queries the response was YES. [2025-01-09 16:42:18,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142682 conditions, 21785 events. 14599/21785 cut-off events. For 529581/529603 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 135249 event pairs, 1781 based on Foata normal form. 9/21679 useless extension candidates. Maximal degree in co-relation 142554. Up to 14075 conditions per place. [2025-01-09 16:42:18,231 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 597 selfloop transitions, 192 changer transitions 72/874 dead transitions. [2025-01-09 16:42:18,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 874 transitions, 13640 flow [2025-01-09 16:42:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 16:42:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-09 16:42:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 498 transitions. [2025-01-09 16:42:18,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39367588932806324 [2025-01-09 16:42:18,233 INFO L175 Difference]: Start difference. First operand has 315 places, 582 transitions, 8735 flow. Second operand 23 states and 498 transitions. [2025-01-09 16:42:18,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 874 transitions, 13640 flow [2025-01-09 16:42:22,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 874 transitions, 12578 flow, removed 429 selfloop flow, removed 25 redundant places. [2025-01-09 16:42:22,540 INFO L231 Difference]: Finished difference. Result has 315 places, 623 transitions, 9060 flow [2025-01-09 16:42:22,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=8001, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=9060, PETRI_PLACES=315, PETRI_TRANSITIONS=623} [2025-01-09 16:42:22,541 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 259 predicate places. [2025-01-09 16:42:22,541 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 623 transitions, 9060 flow [2025-01-09 16:42:22,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 12 states have internal predecessors, (162), 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:42:22,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:22,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:22,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:42:22,542 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:42:22,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1678931428, now seen corresponding path program 7 times [2025-01-09 16:42:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:22,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713062185] [2025-01-09 16:42:22,543 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:42:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:22,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:22,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:22,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:22,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:42:22,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:22,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713062185] [2025-01-09 16:42:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713062185] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:22,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564993150] [2025-01-09 16:42:22,849 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:42:22,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:22,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:22,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:42:22,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:42:22,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 16:42:22,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 16:42:22,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:22,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:22,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 16:42:22,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:23,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 16:42:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:42:23,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:23,183 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 16:42:23,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:42:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:42:23,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564993150] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:23,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:23,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 18 [2025-01-09 16:42:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021227586] [2025-01-09 16:42:23,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:23,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:42:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:23,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:42:23,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:42:23,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 55 [2025-01-09 16:42:23,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 623 transitions, 9060 flow. Second operand has 18 states, 18 states have (on average 10.61111111111111) internal successors, (191), 18 states have internal predecessors, (191), 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:42:23,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:23,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 55 [2025-01-09 16:42:23,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:29,816 INFO L124 PetriNetUnfolderBase]: 16167/24079 cut-off events. [2025-01-09 16:42:29,816 INFO L125 PetriNetUnfolderBase]: For 599792/599806 co-relation queries the response was YES. [2025-01-09 16:42:30,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154243 conditions, 24079 events. 16167/24079 cut-off events. For 599792/599806 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 147785 event pairs, 494 based on Foata normal form. 128/24123 useless extension candidates. Maximal degree in co-relation 154117. Up to 5274 conditions per place. [2025-01-09 16:42:30,232 INFO L140 encePairwiseOnDemand]: 35/55 looper letters, 587 selfloop transitions, 606 changer transitions 163/1359 dead transitions. [2025-01-09 16:42:30,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 1359 transitions, 19544 flow [2025-01-09 16:42:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-01-09 16:42:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2025-01-09 16:42:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 1105 transitions. [2025-01-09 16:42:30,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25113636363636366 [2025-01-09 16:42:30,235 INFO L175 Difference]: Start difference. First operand has 315 places, 623 transitions, 9060 flow. Second operand 80 states and 1105 transitions. [2025-01-09 16:42:30,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 1359 transitions, 19544 flow [2025-01-09 16:42:33,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 1359 transitions, 19045 flow, removed 108 selfloop flow, removed 13 redundant places. [2025-01-09 16:42:33,409 INFO L231 Difference]: Finished difference. Result has 406 places, 840 transitions, 13596 flow [2025-01-09 16:42:33,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=8476, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=386, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=13596, PETRI_PLACES=406, PETRI_TRANSITIONS=840} [2025-01-09 16:42:33,410 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 350 predicate places. [2025-01-09 16:42:33,410 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 840 transitions, 13596 flow [2025-01-09 16:42:33,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.61111111111111) internal successors, (191), 18 states have internal predecessors, (191), 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:42:33,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:33,411 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:33,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:42:33,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 16:42:33,612 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:42:33,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -389949014, now seen corresponding path program 8 times [2025-01-09 16:42:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:33,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249579061] [2025-01-09 16:42:33,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:33,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:33,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 16:42:33,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 16:42:33,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:33,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:42:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249579061] [2025-01-09 16:42:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249579061] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967039731] [2025-01-09 16:42:33,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:33,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:33,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:33,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:42:33,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:42:33,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 16:42:33,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 16:42:33,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:33,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:33,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:42:33,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:42:33,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:42:33,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967039731] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:33,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:33,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 16:42:33,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237127682] [2025-01-09 16:42:33,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:33,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:42:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:33,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:42:33,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:42:33,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2025-01-09 16:42:33,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 840 transitions, 13596 flow. Second operand has 14 states, 14 states have (on average 23.571428571428573) internal successors, (330), 14 states have internal predecessors, (330), 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:42:33,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:33,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2025-01-09 16:42:33,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:40,280 INFO L124 PetriNetUnfolderBase]: 17269/27564 cut-off events. [2025-01-09 16:42:40,280 INFO L125 PetriNetUnfolderBase]: For 549428/549732 co-relation queries the response was YES. [2025-01-09 16:42:41,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193729 conditions, 27564 events. 17269/27564 cut-off events. For 549428/549732 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 199943 event pairs, 6291 based on Foata normal form. 736/28019 useless extension candidates. Maximal degree in co-relation 193578. Up to 16367 conditions per place. [2025-01-09 16:42:41,275 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 511 selfloop transitions, 5 changer transitions 377/1218 dead transitions. [2025-01-09 16:42:41,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 1218 transitions, 20908 flow [2025-01-09 16:42:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:42:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:42:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions. [2025-01-09 16:42:41,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-09 16:42:41,276 INFO L175 Difference]: Start difference. First operand has 406 places, 840 transitions, 13596 flow. Second operand 7 states and 220 transitions. [2025-01-09 16:42:41,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 1218 transitions, 20908 flow