./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.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 b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:37:54,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:37:54,564 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:37:54,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:37:54,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:37:54,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:37:54,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:37:54,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:37:54,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:37:54,590 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:37:54,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:37:54,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:37:54,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:37:54,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:37:54,593 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:37:54,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:37:54,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:37:54,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:37:54,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:37:54,594 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 -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a [2025-01-09 16:37:54,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:37:54,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:37:54,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:37:54,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:37:54,795 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:37:54,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-01-09 16:37:55,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cf091699/97f34d83725e450794de4212d1c3cb92/FLAG9f3fd30c6 [2025-01-09 16:37:56,154 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:37:56,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-01-09 16:37:56,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cf091699/97f34d83725e450794de4212d1c3cb92/FLAG9f3fd30c6 [2025-01-09 16:37:56,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3cf091699/97f34d83725e450794de4212d1c3cb92 [2025-01-09 16:37:56,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:37:56,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:37:56,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:37:56,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:37:56,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:37:56,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139279b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56, skipping insertion in model container [2025-01-09 16:37:56,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:37:56,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c[2592,2605] [2025-01-09 16:37:56,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:37:56,388 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:37:56,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c[2592,2605] [2025-01-09 16:37:56,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:37:56,424 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:37:56,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56 WrapperNode [2025-01-09 16:37:56,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:37:56,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:37:56,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:37:56,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:37:56,433 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:37:56" (1/1) ... [2025-01-09 16:37:56,438 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:37:56" (1/1) ... [2025-01-09 16:37:56,455 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 157 [2025-01-09 16:37:56,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:37:56,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:37:56,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:37:56,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:37:56,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,482 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-09 16:37:56,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:37:56,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:37:56,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:37:56,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:37:56,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (1/1) ... [2025-01-09 16:37:56,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:37:56,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:37:56,528 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:37:56,533 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:37:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:37:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:37:56,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:37:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:37:56,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:37:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:37:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:37:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:37:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:37:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:37:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:37:56,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:37:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:37:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:37:56,552 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:37:56,627 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:37:56,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:37:56,833 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:37:56,833 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:37:57,016 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:37:57,016 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:37:57,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:37:57 BoogieIcfgContainer [2025-01-09 16:37:57,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:37:57,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:37:57,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:37:57,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:37:57,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:37:56" (1/3) ... [2025-01-09 16:37:57,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cecee85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:37:57, skipping insertion in model container [2025-01-09 16:37:57,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:37:56" (2/3) ... [2025-01-09 16:37:57,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cecee85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:37:57, skipping insertion in model container [2025-01-09 16:37:57,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:37:57" (3/3) ... [2025-01-09 16:37:57,025 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-01-09 16:37:57,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:37:57,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:37:57,037 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:37:57,081 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:37:57,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 70 flow [2025-01-09 16:37:57,146 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-01-09 16:37:57,147 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:37:57,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 6/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-01-09 16:37:57,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 28 transitions, 70 flow [2025-01-09 16:37:57,152 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 25 transitions, 62 flow [2025-01-09 16:37:57,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:37:57,171 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;@334fbfa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:37:57,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:37:57,182 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:37:57,184 INFO L124 PetriNetUnfolderBase]: 6/24 cut-off events. [2025-01-09 16:37:57,184 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:37:57,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:57,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:57,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:37:57,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:57,189 INFO L85 PathProgramCache]: Analyzing trace with hash 220919716, now seen corresponding path program 1 times [2025-01-09 16:37:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:57,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767662216] [2025-01-09 16:37:57,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:57,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:37:57,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:37:57,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:57,451 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:37:57,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:57,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767662216] [2025-01-09 16:37:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767662216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:57,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:57,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:37:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955189158] [2025-01-09 16:37:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:57,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:37:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:57,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:37:57,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:37:57,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:37:57,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:37:57,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:57,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:37:57,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:57,633 INFO L124 PetriNetUnfolderBase]: 229/388 cut-off events. [2025-01-09 16:37:57,634 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-09 16:37:57,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 388 events. 229/388 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1458 event pairs, 65 based on Foata normal form. 5/320 useless extension candidates. Maximal degree in co-relation 700. Up to 173 conditions per place. [2025-01-09 16:37:57,640 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 43 selfloop transitions, 5 changer transitions 2/52 dead transitions. [2025-01-09 16:37:57,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 52 transitions, 234 flow [2025-01-09 16:37:57,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:37:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:37:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-01-09 16:37:57,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-01-09 16:37:57,650 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 62 flow. Second operand 5 states and 71 transitions. [2025-01-09 16:37:57,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 52 transitions, 234 flow [2025-01-09 16:37:57,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:37:57,656 INFO L231 Difference]: Finished difference. Result has 28 places, 27 transitions, 78 flow [2025-01-09 16:37:57,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=28, PETRI_TRANSITIONS=27} [2025-01-09 16:37:57,661 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2025-01-09 16:37:57,662 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 78 flow [2025-01-09 16:37:57,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:37:57,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:57,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:57,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:37:57,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:37:57,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1461377420, now seen corresponding path program 2 times [2025-01-09 16:37:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:57,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-01-09 16:37:57,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:37:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:57,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:37:57,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:37:57,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:37:57,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:57,752 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:37:57,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:57,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-01-09 16:37:57,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141021097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:57,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:57,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:37:57,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070261318] [2025-01-09 16:37:57,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:57,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:37:57,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:57,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:37:57,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:37:57,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:37:57,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:37:57,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:57,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:37:57,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:57,870 INFO L124 PetriNetUnfolderBase]: 265/463 cut-off events. [2025-01-09 16:37:57,870 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-01-09 16:37:57,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 463 events. 265/463 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1818 event pairs, 71 based on Foata normal form. 8/436 useless extension candidates. Maximal degree in co-relation 230. Up to 313 conditions per place. [2025-01-09 16:37:57,872 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 39 selfloop transitions, 4 changer transitions 3/48 dead transitions. [2025-01-09 16:37:57,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 48 transitions, 228 flow [2025-01-09 16:37:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:37:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:37:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-01-09 16:37:57,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2025-01-09 16:37:57,874 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 78 flow. Second operand 4 states and 61 transitions. [2025-01-09 16:37:57,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 48 transitions, 228 flow [2025-01-09 16:37:57,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 48 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:37:57,875 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 112 flow [2025-01-09 16:37:57,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2025-01-09 16:37:57,875 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2025-01-09 16:37:57,876 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 112 flow [2025-01-09 16:37:57,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:37:57,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:57,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:57,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:37:57,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:37:57,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash -989757094, now seen corresponding path program 3 times [2025-01-09 16:37:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:57,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086096615] [2025-01-09 16:37:57,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:37:57,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:57,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:37:57,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:37:57,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:37:57,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:57,946 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:37:57,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:57,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086096615] [2025-01-09 16:37:57,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086096615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:57,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:57,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:37:57,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460660958] [2025-01-09 16:37:57,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:57,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:37:57,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:57,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:37:57,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:37:57,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:37:57,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:37:57,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:57,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:37:57,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:58,048 INFO L124 PetriNetUnfolderBase]: 399/690 cut-off events. [2025-01-09 16:37:58,048 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2025-01-09 16:37:58,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 690 events. 399/690 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2979 event pairs, 47 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 563. Up to 434 conditions per place. [2025-01-09 16:37:58,052 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 43 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2025-01-09 16:37:58,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 275 flow [2025-01-09 16:37:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:37:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:37:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-01-09 16:37:58,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-01-09 16:37:58,053 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 112 flow. Second operand 4 states and 60 transitions. [2025-01-09 16:37:58,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 275 flow [2025-01-09 16:37:58,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:37:58,055 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 166 flow [2025-01-09 16:37:58,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-01-09 16:37:58,055 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2025-01-09 16:37:58,055 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 166 flow [2025-01-09 16:37:58,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:37:58,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:58,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:58,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:37:58,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:37:58,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1570116629, now seen corresponding path program 1 times [2025-01-09 16:37:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:58,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29652131] [2025-01-09 16:37:58,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:58,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:37:58,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:37:58,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:58,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:58,168 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:37:58,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:58,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29652131] [2025-01-09 16:37:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29652131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:58,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:58,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:37:58,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237270879] [2025-01-09 16:37:58,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:58,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:37:58,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:58,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:37:58,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:37:58,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:37:58,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:37:58,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:58,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:37:58,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:58,280 INFO L124 PetriNetUnfolderBase]: 370/629 cut-off events. [2025-01-09 16:37:58,280 INFO L125 PetriNetUnfolderBase]: For 599/599 co-relation queries the response was YES. [2025-01-09 16:37:58,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1703 conditions, 629 events. 370/629 cut-off events. For 599/599 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2597 event pairs, 117 based on Foata normal form. 14/641 useless extension candidates. Maximal degree in co-relation 670. Up to 303 conditions per place. [2025-01-09 16:37:58,284 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 47 selfloop transitions, 8 changer transitions 3/60 dead transitions. [2025-01-09 16:37:58,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 361 flow [2025-01-09 16:37:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:37:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:37:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-01-09 16:37:58,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2025-01-09 16:37:58,285 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 166 flow. Second operand 4 states and 67 transitions. [2025-01-09 16:37:58,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 361 flow [2025-01-09 16:37:58,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 355 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 16:37:58,289 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 182 flow [2025-01-09 16:37:58,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-01-09 16:37:58,290 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2025-01-09 16:37:58,290 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 182 flow [2025-01-09 16:37:58,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:37:58,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:58,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:58,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:37:58,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:37:58,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash -210142338, now seen corresponding path program 1 times [2025-01-09 16:37:58,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:58,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794331924] [2025-01-09 16:37:58,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:58,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:58,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:37:58,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:37:58,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:58,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:58,367 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:37:58,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:58,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794331924] [2025-01-09 16:37:58,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794331924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:58,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:58,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:37:58,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419546589] [2025-01-09 16:37:58,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:58,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:37:58,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:58,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:37:58,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:37:58,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:37:58,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:37:58,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:58,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:37:58,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:58,510 INFO L124 PetriNetUnfolderBase]: 536/912 cut-off events. [2025-01-09 16:37:58,512 INFO L125 PetriNetUnfolderBase]: For 1216/1216 co-relation queries the response was YES. [2025-01-09 16:37:58,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2544 conditions, 912 events. 536/912 cut-off events. For 1216/1216 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4120 event pairs, 190 based on Foata normal form. 4/913 useless extension candidates. Maximal degree in co-relation 2386. Up to 429 conditions per place. [2025-01-09 16:37:58,516 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 53 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2025-01-09 16:37:58,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 425 flow [2025-01-09 16:37:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:37:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:37:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-01-09 16:37:58,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2025-01-09 16:37:58,519 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 182 flow. Second operand 5 states and 67 transitions. [2025-01-09 16:37:58,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 425 flow [2025-01-09 16:37:58,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 405 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-09 16:37:58,521 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 207 flow [2025-01-09 16:37:58,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2025-01-09 16:37:58,521 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2025-01-09 16:37:58,521 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 207 flow [2025-01-09 16:37:58,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:37:58,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:58,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:58,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:37:58,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:37:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2032208774, now seen corresponding path program 2 times [2025-01-09 16:37:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:58,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980943574] [2025-01-09 16:37:58,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:37:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:58,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:37:58,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:37:58,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:37:58,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:58,598 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:37:58,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:58,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980943574] [2025-01-09 16:37:58,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980943574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:58,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:58,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:37:58,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352573523] [2025-01-09 16:37:58,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:58,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:37:58,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:58,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:37:58,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:37:58,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:37:58,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:37:58,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:58,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:37:58,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:58,734 INFO L124 PetriNetUnfolderBase]: 481/815 cut-off events. [2025-01-09 16:37:58,734 INFO L125 PetriNetUnfolderBase]: For 1144/1144 co-relation queries the response was YES. [2025-01-09 16:37:58,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2392 conditions, 815 events. 481/815 cut-off events. For 1144/1144 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3499 event pairs, 184 based on Foata normal form. 16/830 useless extension candidates. Maximal degree in co-relation 1561. Up to 432 conditions per place. [2025-01-09 16:37:58,740 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 49 selfloop transitions, 8 changer transitions 2/61 dead transitions. [2025-01-09 16:37:58,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 420 flow [2025-01-09 16:37:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:37:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:37:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-01-09 16:37:58,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-01-09 16:37:58,742 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 207 flow. Second operand 4 states and 63 transitions. [2025-01-09 16:37:58,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 420 flow [2025-01-09 16:37:58,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 407 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 16:37:58,746 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 214 flow [2025-01-09 16:37:58,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-01-09 16:37:58,747 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2025-01-09 16:37:58,747 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 214 flow [2025-01-09 16:37:58,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:37:58,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:58,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:58,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:37:58,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:37:58,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:58,748 INFO L85 PathProgramCache]: Analyzing trace with hash 748331011, now seen corresponding path program 1 times [2025-01-09 16:37:58,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:58,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363840971] [2025-01-09 16:37:58,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:58,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:37:58,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:37:58,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:58,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:58,819 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:37:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:58,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363840971] [2025-01-09 16:37:58,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363840971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:58,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:58,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:37:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322039021] [2025-01-09 16:37:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:58,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:37:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:58,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:37:58,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:37:58,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:37:58,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:37:58,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:58,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:37:58,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:58,913 INFO L124 PetriNetUnfolderBase]: 444/776 cut-off events. [2025-01-09 16:37:58,914 INFO L125 PetriNetUnfolderBase]: For 1136/1136 co-relation queries the response was YES. [2025-01-09 16:37:58,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 776 events. 444/776 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3451 event pairs, 287 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 2129. Up to 736 conditions per place. [2025-01-09 16:37:58,919 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 32 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-01-09 16:37:58,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 290 flow [2025-01-09 16:37:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:37:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:37:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-01-09 16:37:58,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-01-09 16:37:58,920 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 214 flow. Second operand 3 states and 41 transitions. [2025-01-09 16:37:58,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 290 flow [2025-01-09 16:37:58,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 278 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-09 16:37:58,922 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 224 flow [2025-01-09 16:37:58,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-01-09 16:37:58,923 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 19 predicate places. [2025-01-09 16:37:58,924 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 224 flow [2025-01-09 16:37:58,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:37:58,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:58,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:58,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:37:58,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:37:58,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1540073302, now seen corresponding path program 1 times [2025-01-09 16:37:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162665499] [2025-01-09 16:37:58,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:58,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:37:58,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:37:58,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:58,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:37:59,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162665499] [2025-01-09 16:37:59,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162665499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:37:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037953007] [2025-01-09 16:37:59,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:59,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:37:59,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:37:59,005 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:37:59,006 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:37:59,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:37:59,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:37:59,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:59,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:59,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:37:59,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:37:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:37:59,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:37:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:37:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037953007] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:37:59,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:37:59,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-09 16:37:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142946974] [2025-01-09 16:37:59,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:37:59,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:37:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:59,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:37:59,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:37:59,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:37:59,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 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:37:59,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:59,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:37:59,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:59,237 INFO L124 PetriNetUnfolderBase]: 444/782 cut-off events. [2025-01-09 16:37:59,237 INFO L125 PetriNetUnfolderBase]: For 929/929 co-relation queries the response was YES. [2025-01-09 16:37:59,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 782 events. 444/782 cut-off events. For 929/929 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3446 event pairs, 287 based on Foata normal form. 3/782 useless extension candidates. Maximal degree in co-relation 2230. Up to 736 conditions per place. [2025-01-09 16:37:59,240 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 32 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2025-01-09 16:37:59,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 332 flow [2025-01-09 16:37:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:37:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:37:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-01-09 16:37:59,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-01-09 16:37:59,241 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 224 flow. Second operand 6 states and 66 transitions. [2025-01-09 16:37:59,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 332 flow [2025-01-09 16:37:59,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:37:59,244 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 286 flow [2025-01-09 16:37:59,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2025-01-09 16:37:59,244 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-01-09 16:37:59,246 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 286 flow [2025-01-09 16:37:59,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 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:37:59,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:59,246 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:59,253 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:37:59,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:37:59,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:37:59,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1834342501, now seen corresponding path program 2 times [2025-01-09 16:37:59,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:59,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024614098] [2025-01-09 16:37:59,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:37:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:59,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:37:59,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 27 statements. [2025-01-09 16:37:59,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:37:59,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:38:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024614098] [2025-01-09 16:38:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024614098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:00,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:00,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495010153] [2025-01-09 16:38:00,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:00,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:00,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:00,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:00,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:00,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 286 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:00,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:00,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:00,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:00,854 INFO L124 PetriNetUnfolderBase]: 687/1273 cut-off events. [2025-01-09 16:38:00,855 INFO L125 PetriNetUnfolderBase]: For 1545/1545 co-relation queries the response was YES. [2025-01-09 16:38:00,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3606 conditions, 1273 events. 687/1273 cut-off events. For 1545/1545 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6868 event pairs, 69 based on Foata normal form. 3/1275 useless extension candidates. Maximal degree in co-relation 3535. Up to 272 conditions per place. [2025-01-09 16:38:00,859 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 112 selfloop transitions, 59 changer transitions 8/182 dead transitions. [2025-01-09 16:38:00,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 182 transitions, 1201 flow [2025-01-09 16:38:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:38:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 16:38:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 250 transitions. [2025-01-09 16:38:00,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2025-01-09 16:38:00,861 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 286 flow. Second operand 21 states and 250 transitions. [2025-01-09 16:38:00,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 182 transitions, 1201 flow [2025-01-09 16:38:00,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 182 transitions, 1185 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:38:00,864 INFO L231 Difference]: Finished difference. Result has 80 places, 95 transitions, 755 flow [2025-01-09 16:38:00,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=755, PETRI_PLACES=80, PETRI_TRANSITIONS=95} [2025-01-09 16:38:00,865 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 54 predicate places. [2025-01-09 16:38:00,865 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 95 transitions, 755 flow [2025-01-09 16:38:00,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:00,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:00,865 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:00,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:38:00,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:00,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:00,866 INFO L85 PathProgramCache]: Analyzing trace with hash -261762991, now seen corresponding path program 3 times [2025-01-09 16:38:00,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:00,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661786286] [2025-01-09 16:38:00,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:00,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:00,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-01-09 16:38:00,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 27 statements. [2025-01-09 16:38:00,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:38:00,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:38:01,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:01,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661786286] [2025-01-09 16:38:01,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661786286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:01,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:01,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:01,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438685752] [2025-01-09 16:38:01,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:01,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:01,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:01,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:01,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:01,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:01,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 95 transitions, 755 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:01,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:01,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:01,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:02,196 INFO L124 PetriNetUnfolderBase]: 859/1600 cut-off events. [2025-01-09 16:38:02,197 INFO L125 PetriNetUnfolderBase]: For 4867/4867 co-relation queries the response was YES. [2025-01-09 16:38:02,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5678 conditions, 1600 events. 859/1600 cut-off events. For 4867/4867 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9341 event pairs, 74 based on Foata normal form. 1/1600 useless extension candidates. Maximal degree in co-relation 5604. Up to 281 conditions per place. [2025-01-09 16:38:02,204 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 146 selfloop transitions, 91 changer transitions 10/250 dead transitions. [2025-01-09 16:38:02,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 250 transitions, 2009 flow [2025-01-09 16:38:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 16:38:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 16:38:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 356 transitions. [2025-01-09 16:38:02,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2025-01-09 16:38:02,206 INFO L175 Difference]: Start difference. First operand has 80 places, 95 transitions, 755 flow. Second operand 30 states and 356 transitions. [2025-01-09 16:38:02,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 250 transitions, 2009 flow [2025-01-09 16:38:02,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 250 transitions, 1883 flow, removed 53 selfloop flow, removed 4 redundant places. [2025-01-09 16:38:02,237 INFO L231 Difference]: Finished difference. Result has 115 places, 128 transitions, 1218 flow [2025-01-09 16:38:02,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1218, PETRI_PLACES=115, PETRI_TRANSITIONS=128} [2025-01-09 16:38:02,237 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 89 predicate places. [2025-01-09 16:38:02,237 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 128 transitions, 1218 flow [2025-01-09 16:38:02,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:02,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:02,238 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:02,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:38:02,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:02,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:02,238 INFO L85 PathProgramCache]: Analyzing trace with hash 98592485, now seen corresponding path program 4 times [2025-01-09 16:38:02,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:02,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713906608] [2025-01-09 16:38:02,238 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:02,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:02,247 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:38:02,253 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 27 statements. [2025-01-09 16:38:02,253 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:38:02,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:38:02,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:02,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713906608] [2025-01-09 16:38:02,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713906608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:02,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:02,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:38:02,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549490945] [2025-01-09 16:38:02,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:02,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:38:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:02,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:38:02,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:38:02,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:02,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 128 transitions, 1218 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:02,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:02,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:02,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:03,363 INFO L124 PetriNetUnfolderBase]: 982/1822 cut-off events. [2025-01-09 16:38:03,363 INFO L125 PetriNetUnfolderBase]: For 7538/7538 co-relation queries the response was YES. [2025-01-09 16:38:03,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7117 conditions, 1822 events. 982/1822 cut-off events. For 7538/7538 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10937 event pairs, 82 based on Foata normal form. 3/1824 useless extension candidates. Maximal degree in co-relation 7033. Up to 317 conditions per place. [2025-01-09 16:38:03,375 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 167 selfloop transitions, 102 changer transitions 10/282 dead transitions. [2025-01-09 16:38:03,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 282 transitions, 2504 flow [2025-01-09 16:38:03,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 16:38:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-09 16:38:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 366 transitions. [2025-01-09 16:38:03,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46683673469387754 [2025-01-09 16:38:03,377 INFO L175 Difference]: Start difference. First operand has 115 places, 128 transitions, 1218 flow. Second operand 28 states and 366 transitions. [2025-01-09 16:38:03,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 282 transitions, 2504 flow [2025-01-09 16:38:03,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 282 transitions, 2293 flow, removed 40 selfloop flow, removed 12 redundant places. [2025-01-09 16:38:03,405 INFO L231 Difference]: Finished difference. Result has 135 places, 147 transitions, 1434 flow [2025-01-09 16:38:03,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1434, PETRI_PLACES=135, PETRI_TRANSITIONS=147} [2025-01-09 16:38:03,406 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 109 predicate places. [2025-01-09 16:38:03,406 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 147 transitions, 1434 flow [2025-01-09 16:38:03,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:03,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:03,406 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:03,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:38:03,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:03,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash 571232111, now seen corresponding path program 5 times [2025-01-09 16:38:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:03,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116214797] [2025-01-09 16:38:03,407 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:03,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:03,416 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-01-09 16:38:03,433 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:38:03,433 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:38:03,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 16:38:03,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:03,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116214797] [2025-01-09 16:38:03,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116214797] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:03,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113835857] [2025-01-09 16:38:03,583 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:03,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:03,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:03,585 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:38:03,588 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:38:03,632 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-01-09 16:38:03,660 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:38:03,660 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:38:03,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:03,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:38:03,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 16:38:03,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 16:38:03,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113835857] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:03,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:03,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 16:38:03,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574455343] [2025-01-09 16:38:03,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:03,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:38:03,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:03,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:38:03,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:38:03,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:03,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 147 transitions, 1434 flow. Second operand has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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:38:03,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:03,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:03,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:03,931 INFO L124 PetriNetUnfolderBase]: 972/1799 cut-off events. [2025-01-09 16:38:03,931 INFO L125 PetriNetUnfolderBase]: For 7910/7910 co-relation queries the response was YES. [2025-01-09 16:38:03,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7399 conditions, 1799 events. 972/1799 cut-off events. For 7910/7910 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10761 event pairs, 540 based on Foata normal form. 1/1798 useless extension candidates. Maximal degree in co-relation 7300. Up to 1685 conditions per place. [2025-01-09 16:38:03,941 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 134 selfloop transitions, 12 changer transitions 0/149 dead transitions. [2025-01-09 16:38:03,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 1738 flow [2025-01-09 16:38:03,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:38:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:38:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2025-01-09 16:38:03,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3520408163265306 [2025-01-09 16:38:03,942 INFO L175 Difference]: Start difference. First operand has 135 places, 147 transitions, 1434 flow. Second operand 7 states and 69 transitions. [2025-01-09 16:38:03,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 1738 flow [2025-01-09 16:38:03,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 149 transitions, 1592 flow, removed 10 selfloop flow, removed 15 redundant places. [2025-01-09 16:38:03,969 INFO L231 Difference]: Finished difference. Result has 126 places, 149 transitions, 1334 flow [2025-01-09 16:38:03,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1334, PETRI_PLACES=126, PETRI_TRANSITIONS=149} [2025-01-09 16:38:03,970 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 100 predicate places. [2025-01-09 16:38:03,971 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 149 transitions, 1334 flow [2025-01-09 16:38:03,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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:38:03,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:03,972 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:03,978 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:38:04,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:04,172 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:04,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:04,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1265719946, now seen corresponding path program 6 times [2025-01-09 16:38:04,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:04,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461534768] [2025-01-09 16:38:04,173 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:38:04,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:04,183 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-01-09 16:38:04,195 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-01-09 16:38:04,196 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:38:04,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:04,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:04,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461534768] [2025-01-09 16:38:04,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461534768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:04,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:04,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:04,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680248072] [2025-01-09 16:38:04,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:04,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:04,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:04,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:04,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:04,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:04,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 149 transitions, 1334 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:04,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:04,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:04,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:05,722 INFO L124 PetriNetUnfolderBase]: 972/1797 cut-off events. [2025-01-09 16:38:05,722 INFO L125 PetriNetUnfolderBase]: For 6152/6152 co-relation queries the response was YES. [2025-01-09 16:38:05,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6878 conditions, 1797 events. 972/1797 cut-off events. For 6152/6152 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10716 event pairs, 102 based on Foata normal form. 1/1798 useless extension candidates. Maximal degree in co-relation 6768. Up to 374 conditions per place. [2025-01-09 16:38:05,734 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 137 selfloop transitions, 103 changer transitions 10/253 dead transitions. [2025-01-09 16:38:05,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 253 transitions, 2275 flow [2025-01-09 16:38:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 16:38:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-09 16:38:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 313 transitions. [2025-01-09 16:38:05,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.414021164021164 [2025-01-09 16:38:05,736 INFO L175 Difference]: Start difference. First operand has 126 places, 149 transitions, 1334 flow. Second operand 27 states and 313 transitions. [2025-01-09 16:38:05,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 253 transitions, 2275 flow [2025-01-09 16:38:05,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 253 transitions, 2251 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-09 16:38:05,761 INFO L231 Difference]: Finished difference. Result has 149 places, 148 transitions, 1507 flow [2025-01-09 16:38:05,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1507, PETRI_PLACES=149, PETRI_TRANSITIONS=148} [2025-01-09 16:38:05,761 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 123 predicate places. [2025-01-09 16:38:05,761 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 148 transitions, 1507 flow [2025-01-09 16:38:05,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:05,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:05,762 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:05,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:38:05,762 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:05,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2129243198, now seen corresponding path program 7 times [2025-01-09 16:38:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:05,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646812706] [2025-01-09 16:38:05,763 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:38:05,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:05,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:38:05,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:05,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:05,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:06,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:06,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646812706] [2025-01-09 16:38:06,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646812706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:06,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:06,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930161607] [2025-01-09 16:38:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:06,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:06,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:06,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:06,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:06,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:06,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 1507 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:06,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:06,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:06,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:07,230 INFO L124 PetriNetUnfolderBase]: 1186/2215 cut-off events. [2025-01-09 16:38:07,230 INFO L125 PetriNetUnfolderBase]: For 8839/8839 co-relation queries the response was YES. [2025-01-09 16:38:07,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9049 conditions, 2215 events. 1186/2215 cut-off events. For 8839/8839 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14028 event pairs, 83 based on Foata normal form. 1/2216 useless extension candidates. Maximal degree in co-relation 8947. Up to 469 conditions per place. [2025-01-09 16:38:07,251 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 130 selfloop transitions, 139 changer transitions 7/279 dead transitions. [2025-01-09 16:38:07,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 279 transitions, 2917 flow [2025-01-09 16:38:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 16:38:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-09 16:38:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 282 transitions. [2025-01-09 16:38:07,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43788819875776397 [2025-01-09 16:38:07,255 INFO L175 Difference]: Start difference. First operand has 149 places, 148 transitions, 1507 flow. Second operand 23 states and 282 transitions. [2025-01-09 16:38:07,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 279 transitions, 2917 flow [2025-01-09 16:38:07,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 279 transitions, 2623 flow, removed 8 selfloop flow, removed 26 redundant places. [2025-01-09 16:38:07,295 INFO L231 Difference]: Finished difference. Result has 152 places, 197 transitions, 2158 flow [2025-01-09 16:38:07,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2158, PETRI_PLACES=152, PETRI_TRANSITIONS=197} [2025-01-09 16:38:07,297 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 126 predicate places. [2025-01-09 16:38:07,297 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 197 transitions, 2158 flow [2025-01-09 16:38:07,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:07,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:07,297 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:07,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:38:07,298 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:07,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1886527144, now seen corresponding path program 8 times [2025-01-09 16:38:07,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:07,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531172425] [2025-01-09 16:38:07,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:07,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:07,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:07,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-01-09 16:38:07,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:38:07,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:07,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:07,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531172425] [2025-01-09 16:38:07,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531172425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:07,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:07,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:07,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564240806] [2025-01-09 16:38:07,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:07,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:07,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:07,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:07,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:07,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:07,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 197 transitions, 2158 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:07,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:07,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:07,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:08,521 INFO L124 PetriNetUnfolderBase]: 1181/2211 cut-off events. [2025-01-09 16:38:08,521 INFO L125 PetriNetUnfolderBase]: For 10535/10535 co-relation queries the response was YES. [2025-01-09 16:38:08,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9592 conditions, 2211 events. 1181/2211 cut-off events. For 10535/10535 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14019 event pairs, 78 based on Foata normal form. 1/2212 useless extension candidates. Maximal degree in co-relation 9484. Up to 447 conditions per place. [2025-01-09 16:38:08,539 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 149 selfloop transitions, 145 changer transitions 7/304 dead transitions. [2025-01-09 16:38:08,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 304 transitions, 3351 flow [2025-01-09 16:38:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 16:38:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-09 16:38:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 301 transitions. [2025-01-09 16:38:08,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2025-01-09 16:38:08,542 INFO L175 Difference]: Start difference. First operand has 152 places, 197 transitions, 2158 flow. Second operand 24 states and 301 transitions. [2025-01-09 16:38:08,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 304 transitions, 3351 flow [2025-01-09 16:38:08,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 304 transitions, 3214 flow, removed 64 selfloop flow, removed 4 redundant places. [2025-01-09 16:38:08,592 INFO L231 Difference]: Finished difference. Result has 177 places, 214 transitions, 2617 flow [2025-01-09 16:38:08,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2617, PETRI_PLACES=177, PETRI_TRANSITIONS=214} [2025-01-09 16:38:08,593 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 151 predicate places. [2025-01-09 16:38:08,593 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 214 transitions, 2617 flow [2025-01-09 16:38:08,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:08,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:08,593 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:08,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:38:08,593 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:08,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2022102974, now seen corresponding path program 9 times [2025-01-09 16:38:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:08,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221403480] [2025-01-09 16:38:08,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:08,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-01-09 16:38:08,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-01-09 16:38:08,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:38:08,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:08,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:08,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221403480] [2025-01-09 16:38:08,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221403480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:08,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:08,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:08,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182090157] [2025-01-09 16:38:08,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:08,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:08,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:08,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:08,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:08,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:08,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 214 transitions, 2617 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:08,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:08,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:08,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:09,556 INFO L124 PetriNetUnfolderBase]: 1266/2431 cut-off events. [2025-01-09 16:38:09,556 INFO L125 PetriNetUnfolderBase]: For 11578/11578 co-relation queries the response was YES. [2025-01-09 16:38:09,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10914 conditions, 2431 events. 1266/2431 cut-off events. For 11578/11578 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16204 event pairs, 122 based on Foata normal form. 1/2432 useless extension candidates. Maximal degree in co-relation 10800. Up to 755 conditions per place. [2025-01-09 16:38:09,570 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 158 selfloop transitions, 115 changer transitions 7/283 dead transitions. [2025-01-09 16:38:09,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 283 transitions, 3537 flow [2025-01-09 16:38:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:38:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 16:38:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 220 transitions. [2025-01-09 16:38:09,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2025-01-09 16:38:09,572 INFO L175 Difference]: Start difference. First operand has 177 places, 214 transitions, 2617 flow. Second operand 18 states and 220 transitions. [2025-01-09 16:38:09,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 283 transitions, 3537 flow [2025-01-09 16:38:09,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 283 transitions, 3422 flow, removed 20 selfloop flow, removed 9 redundant places. [2025-01-09 16:38:09,639 INFO L231 Difference]: Finished difference. Result has 187 places, 219 transitions, 2828 flow [2025-01-09 16:38:09,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2516, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2828, PETRI_PLACES=187, PETRI_TRANSITIONS=219} [2025-01-09 16:38:09,640 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 161 predicate places. [2025-01-09 16:38:09,640 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 219 transitions, 2828 flow [2025-01-09 16:38:09,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:09,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:09,640 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:09,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:38:09,640 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:09,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:09,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1332728996, now seen corresponding path program 10 times [2025-01-09 16:38:09,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:09,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165692964] [2025-01-09 16:38:09,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:09,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:09,650 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:09,654 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-01-09 16:38:09,654 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:38:09,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:09,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165692964] [2025-01-09 16:38:09,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165692964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:09,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:09,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:38:09,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817606132] [2025-01-09 16:38:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:09,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:38:09,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:09,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:38:09,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:38:09,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:09,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 219 transitions, 2828 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:09,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:09,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:09,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:10,748 INFO L124 PetriNetUnfolderBase]: 1305/2505 cut-off events. [2025-01-09 16:38:10,748 INFO L125 PetriNetUnfolderBase]: For 12455/12455 co-relation queries the response was YES. [2025-01-09 16:38:10,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11652 conditions, 2505 events. 1305/2505 cut-off events. For 12455/12455 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 16864 event pairs, 57 based on Foata normal form. 1/2506 useless extension candidates. Maximal degree in co-relation 11537. Up to 511 conditions per place. [2025-01-09 16:38:10,759 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 130 selfloop transitions, 167 changer transitions 8/308 dead transitions. [2025-01-09 16:38:10,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 308 transitions, 3879 flow [2025-01-09 16:38:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:38:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 16:38:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 270 transitions. [2025-01-09 16:38:10,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2025-01-09 16:38:10,760 INFO L175 Difference]: Start difference. First operand has 187 places, 219 transitions, 2828 flow. Second operand 21 states and 270 transitions. [2025-01-09 16:38:10,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 308 transitions, 3879 flow [2025-01-09 16:38:10,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 308 transitions, 3663 flow, removed 6 selfloop flow, removed 13 redundant places. [2025-01-09 16:38:10,802 INFO L231 Difference]: Finished difference. Result has 196 places, 226 transitions, 3075 flow [2025-01-09 16:38:10,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3075, PETRI_PLACES=196, PETRI_TRANSITIONS=226} [2025-01-09 16:38:10,802 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 170 predicate places. [2025-01-09 16:38:10,802 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 226 transitions, 3075 flow [2025-01-09 16:38:10,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:10,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:10,803 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:10,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:38:10,803 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:10,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:10,803 INFO L85 PathProgramCache]: Analyzing trace with hash 881042152, now seen corresponding path program 11 times [2025-01-09 16:38:10,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:10,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062181559] [2025-01-09 16:38:10,803 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:10,810 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-01-09 16:38:10,843 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:10,844 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:38:10,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:11,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062181559] [2025-01-09 16:38:11,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062181559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:11,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:11,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632085897] [2025-01-09 16:38:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:11,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:11,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:11,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:11,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:11,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 226 transitions, 3075 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:11,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:11,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:11,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:12,103 INFO L124 PetriNetUnfolderBase]: 1311/2512 cut-off events. [2025-01-09 16:38:12,103 INFO L125 PetriNetUnfolderBase]: For 14073/14073 co-relation queries the response was YES. [2025-01-09 16:38:12,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12118 conditions, 2512 events. 1311/2512 cut-off events. For 14073/14073 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 16855 event pairs, 100 based on Foata normal form. 1/2513 useless extension candidates. Maximal degree in co-relation 12001. Up to 509 conditions per place. [2025-01-09 16:38:12,116 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 142 selfloop transitions, 163 changer transitions 7/315 dead transitions. [2025-01-09 16:38:12,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 315 transitions, 4073 flow [2025-01-09 16:38:12,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 16:38:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-09 16:38:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 310 transitions. [2025-01-09 16:38:12,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-01-09 16:38:12,119 INFO L175 Difference]: Start difference. First operand has 196 places, 226 transitions, 3075 flow. Second operand 25 states and 310 transitions. [2025-01-09 16:38:12,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 315 transitions, 4073 flow [2025-01-09 16:38:12,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 315 transitions, 3881 flow, removed 17 selfloop flow, removed 15 redundant places. [2025-01-09 16:38:12,201 INFO L231 Difference]: Finished difference. Result has 206 places, 227 transitions, 3258 flow [2025-01-09 16:38:12,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2905, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3258, PETRI_PLACES=206, PETRI_TRANSITIONS=227} [2025-01-09 16:38:12,202 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 180 predicate places. [2025-01-09 16:38:12,202 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 227 transitions, 3258 flow [2025-01-09 16:38:12,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:12,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:12,202 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:12,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:38:12,203 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:12,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1413887518, now seen corresponding path program 12 times [2025-01-09 16:38:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243111814] [2025-01-09 16:38:12,203 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:38:12,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:12,213 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-01-09 16:38:12,221 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-01-09 16:38:12,222 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:38:12,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:12,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:12,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243111814] [2025-01-09 16:38:12,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243111814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:12,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:12,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:12,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051517470] [2025-01-09 16:38:12,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:12,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:12,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:12,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:12,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:12,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 227 transitions, 3258 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:12,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:12,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:12,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:13,180 INFO L124 PetriNetUnfolderBase]: 1311/2507 cut-off events. [2025-01-09 16:38:13,181 INFO L125 PetriNetUnfolderBase]: For 15207/15207 co-relation queries the response was YES. [2025-01-09 16:38:13,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12553 conditions, 2507 events. 1311/2507 cut-off events. For 15207/15207 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16796 event pairs, 270 based on Foata normal form. 1/2504 useless extension candidates. Maximal degree in co-relation 12434. Up to 844 conditions per place. [2025-01-09 16:38:13,192 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 181 selfloop transitions, 94 changer transitions 7/285 dead transitions. [2025-01-09 16:38:13,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 285 transitions, 4074 flow [2025-01-09 16:38:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:38:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 16:38:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 209 transitions. [2025-01-09 16:38:13,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43907563025210083 [2025-01-09 16:38:13,193 INFO L175 Difference]: Start difference. First operand has 206 places, 227 transitions, 3258 flow. Second operand 17 states and 209 transitions. [2025-01-09 16:38:13,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 285 transitions, 4074 flow [2025-01-09 16:38:13,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 285 transitions, 3824 flow, removed 4 selfloop flow, removed 20 redundant places. [2025-01-09 16:38:13,237 INFO L231 Difference]: Finished difference. Result has 203 places, 227 transitions, 3213 flow [2025-01-09 16:38:13,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3016, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3213, PETRI_PLACES=203, PETRI_TRANSITIONS=227} [2025-01-09 16:38:13,237 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 177 predicate places. [2025-01-09 16:38:13,237 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 227 transitions, 3213 flow [2025-01-09 16:38:13,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:13,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:13,237 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:13,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:38:13,238 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:13,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash -275165378, now seen corresponding path program 13 times [2025-01-09 16:38:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:13,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227912689] [2025-01-09 16:38:13,239 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:38:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:13,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:38:13,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:13,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:13,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:13,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227912689] [2025-01-09 16:38:13,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227912689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:13,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:13,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690194587] [2025-01-09 16:38:13,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:13,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:13,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:13,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:13,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:13,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:13,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 227 transitions, 3213 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:13,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:13,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:13,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:14,249 INFO L124 PetriNetUnfolderBase]: 1441/2794 cut-off events. [2025-01-09 16:38:14,249 INFO L125 PetriNetUnfolderBase]: For 16304/16304 co-relation queries the response was YES. [2025-01-09 16:38:14,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13495 conditions, 2794 events. 1441/2794 cut-off events. For 16304/16304 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 19455 event pairs, 140 based on Foata normal form. 1/2791 useless extension candidates. Maximal degree in co-relation 13375. Up to 593 conditions per place. [2025-01-09 16:38:14,268 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 170 selfloop transitions, 178 changer transitions 8/359 dead transitions. [2025-01-09 16:38:14,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 359 transitions, 5012 flow [2025-01-09 16:38:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 16:38:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-09 16:38:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 257 transitions. [2025-01-09 16:38:14,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4589285714285714 [2025-01-09 16:38:14,272 INFO L175 Difference]: Start difference. First operand has 203 places, 227 transitions, 3213 flow. Second operand 20 states and 257 transitions. [2025-01-09 16:38:14,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 359 transitions, 5012 flow [2025-01-09 16:38:14,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 359 transitions, 4849 flow, removed 8 selfloop flow, removed 13 redundant places. [2025-01-09 16:38:14,328 INFO L231 Difference]: Finished difference. Result has 222 places, 277 transitions, 4478 flow [2025-01-09 16:38:14,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3093, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4478, PETRI_PLACES=222, PETRI_TRANSITIONS=277} [2025-01-09 16:38:14,329 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 196 predicate places. [2025-01-09 16:38:14,329 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 277 transitions, 4478 flow [2025-01-09 16:38:14,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:14,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:14,329 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:14,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:38:14,329 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:14,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2111700192, now seen corresponding path program 14 times [2025-01-09 16:38:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951567122] [2025-01-09 16:38:14,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:14,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:14,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-01-09 16:38:14,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:38:14,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951567122] [2025-01-09 16:38:14,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951567122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:14,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:14,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29176124] [2025-01-09 16:38:14,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:14,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:14,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:14,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:14,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:14,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:14,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 277 transitions, 4478 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:14,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:14,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:14,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:15,462 INFO L124 PetriNetUnfolderBase]: 1448/2838 cut-off events. [2025-01-09 16:38:15,462 INFO L125 PetriNetUnfolderBase]: For 21428/21428 co-relation queries the response was YES. [2025-01-09 16:38:15,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14993 conditions, 2838 events. 1448/2838 cut-off events. For 21428/21428 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 20006 event pairs, 78 based on Foata normal form. 1/2839 useless extension candidates. Maximal degree in co-relation 14861. Up to 619 conditions per place. [2025-01-09 16:38:15,488 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 121 selfloop transitions, 230 changer transitions 7/361 dead transitions. [2025-01-09 16:38:15,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 361 transitions, 5741 flow [2025-01-09 16:38:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:38:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 16:38:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 236 transitions. [2025-01-09 16:38:15,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2025-01-09 16:38:15,493 INFO L175 Difference]: Start difference. First operand has 222 places, 277 transitions, 4478 flow. Second operand 21 states and 236 transitions. [2025-01-09 16:38:15,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 361 transitions, 5741 flow [2025-01-09 16:38:15,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 361 transitions, 5668 flow, removed 35 selfloop flow, removed 3 redundant places. [2025-01-09 16:38:15,592 INFO L231 Difference]: Finished difference. Result has 242 places, 295 transitions, 5226 flow [2025-01-09 16:38:15,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4417, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5226, PETRI_PLACES=242, PETRI_TRANSITIONS=295} [2025-01-09 16:38:15,592 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 216 predicate places. [2025-01-09 16:38:15,592 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 295 transitions, 5226 flow [2025-01-09 16:38:15,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:15,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:15,597 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:15,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:38:15,597 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:15,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash 881944834, now seen corresponding path program 15 times [2025-01-09 16:38:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-01-09 16:38:15,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:15,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:15,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-01-09 16:38:15,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-01-09 16:38:15,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:38:15,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:15,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:15,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-01-09 16:38:15,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825343523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:15,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:15,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:15,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992369199] [2025-01-09 16:38:15,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:15,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:15,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:15,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:15,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:15,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:15,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 295 transitions, 5226 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:15,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:15,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:15,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:17,150 INFO L124 PetriNetUnfolderBase]: 1865/3684 cut-off events. [2025-01-09 16:38:17,151 INFO L125 PetriNetUnfolderBase]: For 30599/30599 co-relation queries the response was YES. [2025-01-09 16:38:17,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20272 conditions, 3684 events. 1865/3684 cut-off events. For 30599/30599 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 27527 event pairs, 128 based on Foata normal form. 1/3685 useless extension candidates. Maximal degree in co-relation 20137. Up to 571 conditions per place. [2025-01-09 16:38:17,178 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 172 selfloop transitions, 290 changer transitions 8/473 dead transitions. [2025-01-09 16:38:17,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 473 transitions, 7754 flow [2025-01-09 16:38:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 16:38:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 16:38:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 350 transitions. [2025-01-09 16:38:17,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-01-09 16:38:17,244 INFO L175 Difference]: Start difference. First operand has 242 places, 295 transitions, 5226 flow. Second operand 30 states and 350 transitions. [2025-01-09 16:38:17,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 473 transitions, 7754 flow [2025-01-09 16:38:17,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 473 transitions, 7203 flow, removed 75 selfloop flow, removed 10 redundant places. [2025-01-09 16:38:17,355 INFO L231 Difference]: Finished difference. Result has 268 places, 364 transitions, 6499 flow [2025-01-09 16:38:17,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4848, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6499, PETRI_PLACES=268, PETRI_TRANSITIONS=364} [2025-01-09 16:38:17,355 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 242 predicate places. [2025-01-09 16:38:17,355 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 364 transitions, 6499 flow [2025-01-09 16:38:17,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:17,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:17,356 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:17,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:38:17,356 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:17,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1714939936, now seen corresponding path program 16 times [2025-01-09 16:38:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:17,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409978404] [2025-01-09 16:38:17,356 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:17,364 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:17,367 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-01-09 16:38:17,367 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:38:17,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:17,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:17,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409978404] [2025-01-09 16:38:17,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409978404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:17,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:17,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:38:17,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138494489] [2025-01-09 16:38:17,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:17,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:38:17,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:17,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:38:17,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:38:17,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:17,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 364 transitions, 6499 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:17,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:17,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:17,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:18,861 INFO L124 PetriNetUnfolderBase]: 1963/3882 cut-off events. [2025-01-09 16:38:18,861 INFO L125 PetriNetUnfolderBase]: For 30300/30300 co-relation queries the response was YES. [2025-01-09 16:38:18,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21571 conditions, 3882 events. 1963/3882 cut-off events. For 30300/30300 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 29368 event pairs, 172 based on Foata normal form. 4/3886 useless extension candidates. Maximal degree in co-relation 21431. Up to 618 conditions per place. [2025-01-09 16:38:18,889 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 201 selfloop transitions, 288 changer transitions 11/503 dead transitions. [2025-01-09 16:38:18,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 503 transitions, 8282 flow [2025-01-09 16:38:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 16:38:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-09 16:38:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 380 transitions. [2025-01-09 16:38:18,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4377880184331797 [2025-01-09 16:38:18,891 INFO L175 Difference]: Start difference. First operand has 268 places, 364 transitions, 6499 flow. Second operand 31 states and 380 transitions. [2025-01-09 16:38:18,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 503 transitions, 8282 flow [2025-01-09 16:38:19,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 503 transitions, 8096 flow, removed 39 selfloop flow, removed 7 redundant places. [2025-01-09 16:38:19,031 INFO L231 Difference]: Finished difference. Result has 295 places, 379 transitions, 7290 flow [2025-01-09 16:38:19,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6351, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=7290, PETRI_PLACES=295, PETRI_TRANSITIONS=379} [2025-01-09 16:38:19,032 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 269 predicate places. [2025-01-09 16:38:19,032 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 379 transitions, 7290 flow [2025-01-09 16:38:19,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:19,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:19,033 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:19,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:38:19,033 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:19,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:19,033 INFO L85 PathProgramCache]: Analyzing trace with hash 774804610, now seen corresponding path program 17 times [2025-01-09 16:38:19,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:19,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147993713] [2025-01-09 16:38:19,034 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:19,041 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-01-09 16:38:19,058 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:19,059 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:38:19,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 16:38:19,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:19,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147993713] [2025-01-09 16:38:19,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147993713] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:19,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525214937] [2025-01-09 16:38:19,538 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:19,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:19,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:19,544 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:38:19,545 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:38:19,606 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-01-09 16:38:19,659 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:19,659 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:38:19,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:19,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 16:38:19,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:19,806 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-01-09 16:38:19,807 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 103 treesize of output 64 [2025-01-09 16:38:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:19,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:38:19,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525214937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:19,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:38:19,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2025-01-09 16:38:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778622264] [2025-01-09 16:38:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:19,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:38:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:19,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:38:19,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:38:19,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:19,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 379 transitions, 7290 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:19,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:19,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:19,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:20,720 INFO L124 PetriNetUnfolderBase]: 1950/3854 cut-off events. [2025-01-09 16:38:20,720 INFO L125 PetriNetUnfolderBase]: For 30420/30420 co-relation queries the response was YES. [2025-01-09 16:38:20,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22599 conditions, 3854 events. 1950/3854 cut-off events. For 30420/30420 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 29259 event pairs, 580 based on Foata normal form. 5/3859 useless extension candidates. Maximal degree in co-relation 22456. Up to 1391 conditions per place. [2025-01-09 16:38:20,747 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 285 selfloop transitions, 118 changer transitions 10/416 dead transitions. [2025-01-09 16:38:20,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 416 transitions, 8255 flow [2025-01-09 16:38:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:38:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:38:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2025-01-09 16:38:20,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-01-09 16:38:20,751 INFO L175 Difference]: Start difference. First operand has 295 places, 379 transitions, 7290 flow. Second operand 10 states and 136 transitions. [2025-01-09 16:38:20,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 416 transitions, 8255 flow [2025-01-09 16:38:20,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 416 transitions, 7686 flow, removed 28 selfloop flow, removed 20 redundant places. [2025-01-09 16:38:20,918 INFO L231 Difference]: Finished difference. Result has 284 places, 375 transitions, 6895 flow [2025-01-09 16:38:20,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6702, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6895, PETRI_PLACES=284, PETRI_TRANSITIONS=375} [2025-01-09 16:38:20,919 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 258 predicate places. [2025-01-09 16:38:20,919 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 375 transitions, 6895 flow [2025-01-09 16:38:20,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:20,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:20,919 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:20,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:38:21,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:21,124 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:21,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash 628055888, now seen corresponding path program 18 times [2025-01-09 16:38:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:21,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-01-09 16:38:21,125 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:38:21,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:21,133 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-01-09 16:38:21,138 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-01-09 16:38:21,138 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:38:21,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:21,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:21,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-01-09 16:38:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74735963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:21,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:21,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869662946] [2025-01-09 16:38:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:21,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:21,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:21,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:21,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:21,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:21,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 375 transitions, 6895 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:21,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:21,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:21,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:22,836 INFO L124 PetriNetUnfolderBase]: 2046/4048 cut-off events. [2025-01-09 16:38:22,836 INFO L125 PetriNetUnfolderBase]: For 31064/31064 co-relation queries the response was YES. [2025-01-09 16:38:22,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23091 conditions, 4048 events. 2046/4048 cut-off events. For 31064/31064 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 30941 event pairs, 234 based on Foata normal form. 4/4052 useless extension candidates. Maximal degree in co-relation 22949. Up to 824 conditions per place. [2025-01-09 16:38:22,867 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 244 selfloop transitions, 239 changer transitions 10/496 dead transitions. [2025-01-09 16:38:22,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 496 transitions, 8796 flow [2025-01-09 16:38:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 16:38:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-09 16:38:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 307 transitions. [2025-01-09 16:38:22,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4568452380952381 [2025-01-09 16:38:22,868 INFO L175 Difference]: Start difference. First operand has 284 places, 375 transitions, 6895 flow. Second operand 24 states and 307 transitions. [2025-01-09 16:38:22,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 496 transitions, 8796 flow [2025-01-09 16:38:23,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 496 transitions, 8482 flow, removed 8 selfloop flow, removed 14 redundant places. [2025-01-09 16:38:23,019 INFO L231 Difference]: Finished difference. Result has 303 places, 400 transitions, 7773 flow [2025-01-09 16:38:23,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=6618, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=7773, PETRI_PLACES=303, PETRI_TRANSITIONS=400} [2025-01-09 16:38:23,020 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 277 predicate places. [2025-01-09 16:38:23,020 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 400 transitions, 7773 flow [2025-01-09 16:38:23,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:23,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:23,020 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:23,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 16:38:23,020 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:23,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash 693405554, now seen corresponding path program 19 times [2025-01-09 16:38:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:23,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093419979] [2025-01-09 16:38:23,021 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:38:23,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:23,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:38:23,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:38:23,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:23,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:23,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093419979] [2025-01-09 16:38:23,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093419979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:23,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:23,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708031574] [2025-01-09 16:38:23,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:23,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:23,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:23,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:23,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:23,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:23,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 400 transitions, 7773 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:23,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:23,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:23,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:24,491 INFO L124 PetriNetUnfolderBase]: 2174/4269 cut-off events. [2025-01-09 16:38:24,491 INFO L125 PetriNetUnfolderBase]: For 39086/39086 co-relation queries the response was YES. [2025-01-09 16:38:24,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25561 conditions, 4269 events. 2174/4269 cut-off events. For 39086/39086 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 32732 event pairs, 322 based on Foata normal form. 5/4270 useless extension candidates. Maximal degree in co-relation 25410. Up to 1027 conditions per place. [2025-01-09 16:38:24,525 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 250 selfloop transitions, 253 changer transitions 9/515 dead transitions. [2025-01-09 16:38:24,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 515 transitions, 9691 flow [2025-01-09 16:38:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 16:38:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-09 16:38:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 303 transitions. [2025-01-09 16:38:24,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2025-01-09 16:38:24,527 INFO L175 Difference]: Start difference. First operand has 303 places, 400 transitions, 7773 flow. Second operand 24 states and 303 transitions. [2025-01-09 16:38:24,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 515 transitions, 9691 flow [2025-01-09 16:38:24,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 515 transitions, 9494 flow, removed 29 selfloop flow, removed 6 redundant places. [2025-01-09 16:38:24,719 INFO L231 Difference]: Finished difference. Result has 325 places, 418 transitions, 8595 flow [2025-01-09 16:38:24,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7622, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8595, PETRI_PLACES=325, PETRI_TRANSITIONS=418} [2025-01-09 16:38:24,719 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 299 predicate places. [2025-01-09 16:38:24,720 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 418 transitions, 8595 flow [2025-01-09 16:38:24,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:24,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:24,720 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:24,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 16:38:24,720 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:24,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1633540880, now seen corresponding path program 20 times [2025-01-09 16:38:24,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:24,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411370697] [2025-01-09 16:38:24,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:24,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:24,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-01-09 16:38:24,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:38:24,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:24,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:24,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411370697] [2025-01-09 16:38:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411370697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:24,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537309244] [2025-01-09 16:38:24,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:24,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:24,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:24,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:24,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:25,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:25,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 418 transitions, 8595 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:25,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:25,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:25,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:26,287 INFO L124 PetriNetUnfolderBase]: 2165/4255 cut-off events. [2025-01-09 16:38:26,287 INFO L125 PetriNetUnfolderBase]: For 45553/45553 co-relation queries the response was YES. [2025-01-09 16:38:26,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26422 conditions, 4255 events. 2165/4255 cut-off events. For 45553/45553 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 32637 event pairs, 159 based on Foata normal form. 1/4256 useless extension candidates. Maximal degree in co-relation 26267. Up to 684 conditions per place. [2025-01-09 16:38:26,323 INFO L140 encePairwiseOnDemand]: 16/28 looper letters, 170 selfloop transitions, 318 changer transitions 7/498 dead transitions. [2025-01-09 16:38:26,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 498 transitions, 9917 flow [2025-01-09 16:38:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 16:38:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-09 16:38:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 307 transitions. [2025-01-09 16:38:26,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43857142857142856 [2025-01-09 16:38:26,325 INFO L175 Difference]: Start difference. First operand has 325 places, 418 transitions, 8595 flow. Second operand 25 states and 307 transitions. [2025-01-09 16:38:26,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 498 transitions, 9917 flow [2025-01-09 16:38:26,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 498 transitions, 9626 flow, removed 20 selfloop flow, removed 15 redundant places. [2025-01-09 16:38:26,539 INFO L231 Difference]: Finished difference. Result has 334 places, 417 transitions, 8943 flow [2025-01-09 16:38:26,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8316, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=318, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=8943, PETRI_PLACES=334, PETRI_TRANSITIONS=417} [2025-01-09 16:38:26,540 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 308 predicate places. [2025-01-09 16:38:26,540 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 417 transitions, 8943 flow [2025-01-09 16:38:26,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:26,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:26,541 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:26,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 16:38:26,541 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:26,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash 85190098, now seen corresponding path program 21 times [2025-01-09 16:38:26,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:26,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868463879] [2025-01-09 16:38:26,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:26,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:26,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-01-09 16:38:26,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 29 statements. [2025-01-09 16:38:26,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:38:26,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:26,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868463879] [2025-01-09 16:38:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868463879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:26,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:26,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033140337] [2025-01-09 16:38:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:26,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:26,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:26,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:26,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:26,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:26,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 417 transitions, 8943 flow. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:26,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:26,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:26,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:27,735 INFO L124 PetriNetUnfolderBase]: 2156/4220 cut-off events. [2025-01-09 16:38:27,735 INFO L125 PetriNetUnfolderBase]: For 45750/45750 co-relation queries the response was YES. [2025-01-09 16:38:27,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27101 conditions, 4220 events. 2156/4220 cut-off events. For 45750/45750 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 32357 event pairs, 512 based on Foata normal form. 1/4213 useless extension candidates. Maximal degree in co-relation 26951. Up to 1352 conditions per place. [2025-01-09 16:38:27,767 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 298 selfloop transitions, 163 changer transitions 7/471 dead transitions. [2025-01-09 16:38:27,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 471 transitions, 10122 flow [2025-01-09 16:38:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:38:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 16:38:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 203 transitions. [2025-01-09 16:38:27,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2025-01-09 16:38:27,768 INFO L175 Difference]: Start difference. First operand has 334 places, 417 transitions, 8943 flow. Second operand 17 states and 203 transitions. [2025-01-09 16:38:27,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 471 transitions, 10122 flow [2025-01-09 16:38:28,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 471 transitions, 9560 flow, removed 7 selfloop flow, removed 23 redundant places. [2025-01-09 16:38:28,072 INFO L231 Difference]: Finished difference. Result has 327 places, 416 transitions, 8708 flow [2025-01-09 16:38:28,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8391, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8708, PETRI_PLACES=327, PETRI_TRANSITIONS=416} [2025-01-09 16:38:28,073 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 301 predicate places. [2025-01-09 16:38:28,073 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 416 transitions, 8708 flow [2025-01-09 16:38:28,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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:38:28,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:28,073 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:28,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 16:38:28,073 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:28,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash 557829724, now seen corresponding path program 22 times [2025-01-09 16:38:28,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:28,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951240409] [2025-01-09 16:38:28,076 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:28,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:28,082 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:38:28,086 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-01-09 16:38:28,086 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:38:28,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:28,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:28,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951240409] [2025-01-09 16:38:28,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951240409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:28,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:28,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:38:28,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286590249] [2025-01-09 16:38:28,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:28,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:38:28,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:28,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:38:28,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:38:28,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:28,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 416 transitions, 8708 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:28,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:28,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:28,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:29,376 INFO L124 PetriNetUnfolderBase]: 2176/4291 cut-off events. [2025-01-09 16:38:29,376 INFO L125 PetriNetUnfolderBase]: For 44822/44822 co-relation queries the response was YES. [2025-01-09 16:38:29,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26762 conditions, 4291 events. 2176/4291 cut-off events. For 44822/44822 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 33111 event pairs, 261 based on Foata normal form. 1/4292 useless extension candidates. Maximal degree in co-relation 26613. Up to 851 conditions per place. [2025-01-09 16:38:29,399 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 238 selfloop transitions, 239 changer transitions 8/488 dead transitions. [2025-01-09 16:38:29,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 488 transitions, 10073 flow [2025-01-09 16:38:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:38:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 16:38:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 239 transitions. [2025-01-09 16:38:29,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4492481203007519 [2025-01-09 16:38:29,401 INFO L175 Difference]: Start difference. First operand has 327 places, 416 transitions, 8708 flow. Second operand 19 states and 239 transitions. [2025-01-09 16:38:29,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 488 transitions, 10073 flow [2025-01-09 16:38:29,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 488 transitions, 9744 flow, removed 9 selfloop flow, removed 14 redundant places. [2025-01-09 16:38:29,580 INFO L231 Difference]: Finished difference. Result has 332 places, 421 transitions, 9007 flow [2025-01-09 16:38:29,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8393, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9007, PETRI_PLACES=332, PETRI_TRANSITIONS=421} [2025-01-09 16:38:29,581 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 306 predicate places. [2025-01-09 16:38:29,581 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 421 transitions, 9007 flow [2025-01-09 16:38:29,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:29,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:29,581 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:29,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 16:38:29,581 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:29,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2071282396, now seen corresponding path program 1 times [2025-01-09 16:38:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:29,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122397617] [2025-01-09 16:38:29,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:29,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:29,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:38:29,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:38:29,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:29,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122397617] [2025-01-09 16:38:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122397617] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43129206] [2025-01-09 16:38:29,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:29,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:29,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:29,628 INFO L229 MonitoredProcess]: Starting monitored process 5 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:38:29,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:38:29,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:38:29,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:38:29,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:29,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:29,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:38:29,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:29,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:29,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43129206] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:29,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:29,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 16:38:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353465962] [2025-01-09 16:38:29,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:29,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:38:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:29,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:38:29,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:38:29,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:38:29,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 421 transitions, 9007 flow. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:29,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:29,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:38:29,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:30,709 INFO L124 PetriNetUnfolderBase]: 3176/5843 cut-off events. [2025-01-09 16:38:30,709 INFO L125 PetriNetUnfolderBase]: For 59738/59738 co-relation queries the response was YES. [2025-01-09 16:38:30,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39121 conditions, 5843 events. 3176/5843 cut-off events. For 59738/59738 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 41156 event pairs, 540 based on Foata normal form. 515/6358 useless extension candidates. Maximal degree in co-relation 38974. Up to 1432 conditions per place. [2025-01-09 16:38:30,755 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 584 selfloop transitions, 107 changer transitions 0/693 dead transitions. [2025-01-09 16:38:30,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 693 transitions, 15523 flow [2025-01-09 16:38:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:38:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:38:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2025-01-09 16:38:30,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-01-09 16:38:30,756 INFO L175 Difference]: Start difference. First operand has 332 places, 421 transitions, 9007 flow. Second operand 8 states and 116 transitions. [2025-01-09 16:38:30,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 693 transitions, 15523 flow [2025-01-09 16:38:31,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 693 transitions, 14727 flow, removed 36 selfloop flow, removed 19 redundant places. [2025-01-09 16:38:31,118 INFO L231 Difference]: Finished difference. Result has 323 places, 462 transitions, 9586 flow [2025-01-09 16:38:31,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8471, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9586, PETRI_PLACES=323, PETRI_TRANSITIONS=462} [2025-01-09 16:38:31,120 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 297 predicate places. [2025-01-09 16:38:31,120 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 462 transitions, 9586 flow [2025-01-09 16:38:31,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:31,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:31,120 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:31,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:31,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:31,324 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:31,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash 20078824, now seen corresponding path program 1 times [2025-01-09 16:38:31,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:31,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447620612] [2025-01-09 16:38:31,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:31,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:31,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:38:31,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:38:31,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:31,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:31,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:31,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447620612] [2025-01-09 16:38:31,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447620612] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:31,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137923029] [2025-01-09 16:38:31,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:31,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:31,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:31,375 INFO L229 MonitoredProcess]: Starting monitored process 6 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:38:31,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:38:31,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:38:31,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:38:31,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:31,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:31,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:38:31,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:31,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:31,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137923029] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:31,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:31,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 16:38:31,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44474343] [2025-01-09 16:38:31,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:31,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:38:31,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:31,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:38:31,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:38:31,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:38:31,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 462 transitions, 9586 flow. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:38:31,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:31,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:38:31,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:32,930 INFO L124 PetriNetUnfolderBase]: 4220/7513 cut-off events. [2025-01-09 16:38:32,930 INFO L125 PetriNetUnfolderBase]: For 82255/82367 co-relation queries the response was YES. [2025-01-09 16:38:32,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53883 conditions, 7513 events. 4220/7513 cut-off events. For 82255/82367 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 51398 event pairs, 970 based on Foata normal form. 544/8041 useless extension candidates. Maximal degree in co-relation 53736. Up to 1932 conditions per place. [2025-01-09 16:38:33,010 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 679 selfloop transitions, 121 changer transitions 0/802 dead transitions. [2025-01-09 16:38:33,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 802 transitions, 18174 flow [2025-01-09 16:38:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:38:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:38:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-01-09 16:38:33,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2025-01-09 16:38:33,011 INFO L175 Difference]: Start difference. First operand has 323 places, 462 transitions, 9586 flow. Second operand 7 states and 121 transitions. [2025-01-09 16:38:33,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 802 transitions, 18174 flow [2025-01-09 16:38:33,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 802 transitions, 17862 flow, removed 21 selfloop flow, removed 6 redundant places. [2025-01-09 16:38:33,600 INFO L231 Difference]: Finished difference. Result has 327 places, 506 transitions, 10700 flow [2025-01-09 16:38:33,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=9399, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10700, PETRI_PLACES=327, PETRI_TRANSITIONS=506} [2025-01-09 16:38:33,601 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 301 predicate places. [2025-01-09 16:38:33,601 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 506 transitions, 10700 flow [2025-01-09 16:38:33,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:38:33,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:33,601 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:33,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:33,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:33,802 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:33,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash 627028288, now seen corresponding path program 1 times [2025-01-09 16:38:33,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:33,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727197688] [2025-01-09 16:38:33,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:33,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:33,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:38:33,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:33,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:33,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:34,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:34,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727197688] [2025-01-09 16:38:34,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727197688] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:34,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229692842] [2025-01-09 16:38:34,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:34,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:34,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:34,049 INFO L229 MonitoredProcess]: Starting monitored process 7 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:38:34,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:38:34,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:38:34,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:34,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:34,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:34,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:38:34,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:34,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:34,345 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-01-09 16:38:34,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-01-09 16:38:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229692842] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:34,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:34,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2025-01-09 16:38:34,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326257952] [2025-01-09 16:38:34,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:34,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:38:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:34,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:38:34,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:38:34,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:34,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 506 transitions, 10700 flow. Second operand has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 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:38:34,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:34,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:34,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:35,807 INFO L124 PetriNetUnfolderBase]: 4033/7260 cut-off events. [2025-01-09 16:38:35,807 INFO L125 PetriNetUnfolderBase]: For 80343/80526 co-relation queries the response was YES. [2025-01-09 16:38:35,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54182 conditions, 7260 events. 4033/7260 cut-off events. For 80343/80526 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 50421 event pairs, 352 based on Foata normal form. 50/7271 useless extension candidates. Maximal degree in co-relation 54035. Up to 1736 conditions per place. [2025-01-09 16:38:35,878 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 197 selfloop transitions, 390 changer transitions 1/591 dead transitions. [2025-01-09 16:38:35,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 591 transitions, 12750 flow [2025-01-09 16:38:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:38:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 16:38:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 213 transitions. [2025-01-09 16:38:35,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2025-01-09 16:38:35,879 INFO L175 Difference]: Start difference. First operand has 327 places, 506 transitions, 10700 flow. Second operand 18 states and 213 transitions. [2025-01-09 16:38:35,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 591 transitions, 12750 flow [2025-01-09 16:38:36,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 591 transitions, 12477 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-01-09 16:38:36,544 INFO L231 Difference]: Finished difference. Result has 342 places, 531 transitions, 11873 flow [2025-01-09 16:38:36,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=10394, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=362, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11873, PETRI_PLACES=342, PETRI_TRANSITIONS=531} [2025-01-09 16:38:36,545 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 316 predicate places. [2025-01-09 16:38:36,545 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 531 transitions, 11873 flow [2025-01-09 16:38:36,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 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:38:36,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:36,545 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:36,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:36,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-01-09 16:38:36,746 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:36,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash -523392737, now seen corresponding path program 1 times [2025-01-09 16:38:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:36,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-01-09 16:38:36,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:36,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:36,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:38:36,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:36,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:36,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:37,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-01-09 16:38:37,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45589607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308736431] [2025-01-09 16:38:37,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:38:37,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:37,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:37,056 INFO L229 MonitoredProcess]: Starting monitored process 8 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:38:37,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:38:37,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:38:37,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:37,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:38:37,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:37,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:38:37,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:37,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:38:37,267 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 118 treesize of output 74 [2025-01-09 16:38:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:37,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:37,414 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-01-09 16:38:37,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 87 [2025-01-09 16:38:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:37,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308736431] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:37,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:38:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 18 [2025-01-09 16:38:37,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393761341] [2025-01-09 16:38:37,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:37,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:38:37,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:37,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:38:37,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:38:37,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:37,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 531 transitions, 11873 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:37,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:37,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:37,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:39,048 INFO L124 PetriNetUnfolderBase]: 4502/8259 cut-off events. [2025-01-09 16:38:39,048 INFO L125 PetriNetUnfolderBase]: For 94447/94629 co-relation queries the response was YES. [2025-01-09 16:38:39,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61102 conditions, 8259 events. 4502/8259 cut-off events. For 94447/94629 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 60342 event pairs, 817 based on Foata normal form. 28/8248 useless extension candidates. Maximal degree in co-relation 60949. Up to 2640 conditions per place. [2025-01-09 16:38:39,132 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 357 selfloop transitions, 249 changer transitions 0/609 dead transitions. [2025-01-09 16:38:39,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 609 transitions, 13854 flow [2025-01-09 16:38:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:38:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:38:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2025-01-09 16:38:39,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5097402597402597 [2025-01-09 16:38:39,133 INFO L175 Difference]: Start difference. First operand has 342 places, 531 transitions, 11873 flow. Second operand 11 states and 157 transitions. [2025-01-09 16:38:39,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 609 transitions, 13854 flow [2025-01-09 16:38:39,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 609 transitions, 13507 flow, removed 15 selfloop flow, removed 8 redundant places. [2025-01-09 16:38:39,778 INFO L231 Difference]: Finished difference. Result has 346 places, 546 transitions, 12450 flow [2025-01-09 16:38:39,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=11544, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12450, PETRI_PLACES=346, PETRI_TRANSITIONS=546} [2025-01-09 16:38:39,779 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 320 predicate places. [2025-01-09 16:38:39,779 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 546 transitions, 12450 flow [2025-01-09 16:38:39,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:39,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:39,779 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:39,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 16:38:39,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:39,980 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:39,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:39,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1589213505, now seen corresponding path program 2 times [2025-01-09 16:38:39,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:39,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424449470] [2025-01-09 16:38:39,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:39,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:39,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:40,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:40,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:38:40,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:40,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:40,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424449470] [2025-01-09 16:38:40,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424449470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:40,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:40,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:38:40,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395044773] [2025-01-09 16:38:40,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:40,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:38:40,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:40,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:38:40,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:38:40,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:40,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 546 transitions, 12450 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:40,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:40,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:40,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:41,754 INFO L124 PetriNetUnfolderBase]: 4497/8256 cut-off events. [2025-01-09 16:38:41,754 INFO L125 PetriNetUnfolderBase]: For 100549/100729 co-relation queries the response was YES. [2025-01-09 16:38:41,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62304 conditions, 8256 events. 4497/8256 cut-off events. For 100549/100729 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 60345 event pairs, 1186 based on Foata normal form. 5/8232 useless extension candidates. Maximal degree in co-relation 62153. Up to 3219 conditions per place. [2025-01-09 16:38:41,837 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 315 selfloop transitions, 246 changer transitions 10/574 dead transitions. [2025-01-09 16:38:41,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 574 transitions, 13652 flow [2025-01-09 16:38:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:38:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:38:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-01-09 16:38:41,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2025-01-09 16:38:41,839 INFO L175 Difference]: Start difference. First operand has 346 places, 546 transitions, 12450 flow. Second operand 10 states and 123 transitions. [2025-01-09 16:38:41,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 574 transitions, 13652 flow [2025-01-09 16:38:42,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 574 transitions, 13446 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-09 16:38:42,652 INFO L231 Difference]: Finished difference. Result has 352 places, 543 transitions, 12661 flow [2025-01-09 16:38:42,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12211, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12661, PETRI_PLACES=352, PETRI_TRANSITIONS=543} [2025-01-09 16:38:42,652 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 326 predicate places. [2025-01-09 16:38:42,652 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 543 transitions, 12661 flow [2025-01-09 16:38:42,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:42,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:42,653 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:42,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 16:38:42,653 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:42,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1878259063, now seen corresponding path program 3 times [2025-01-09 16:38:42,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:42,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000870968] [2025-01-09 16:38:42,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:42,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:42,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-01-09 16:38:42,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 31 statements. [2025-01-09 16:38:42,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:38:42,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:42,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:42,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000870968] [2025-01-09 16:38:42,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000870968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:42,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:42,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:38:42,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651133264] [2025-01-09 16:38:42,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:42,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:38:42,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:42,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:38:42,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:38:42,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:42,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 543 transitions, 12661 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:42,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:42,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:42,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:44,991 INFO L124 PetriNetUnfolderBase]: 4563/8415 cut-off events. [2025-01-09 16:38:44,991 INFO L125 PetriNetUnfolderBase]: For 104011/104191 co-relation queries the response was YES. [2025-01-09 16:38:45,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64057 conditions, 8415 events. 4563/8415 cut-off events. For 104011/104191 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 62172 event pairs, 1195 based on Foata normal form. 5/8383 useless extension candidates. Maximal degree in co-relation 63904. Up to 3191 conditions per place. [2025-01-09 16:38:45,116 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 349 selfloop transitions, 237 changer transitions 5/594 dead transitions. [2025-01-09 16:38:45,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 594 transitions, 14097 flow [2025-01-09 16:38:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:38:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:38:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2025-01-09 16:38:45,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-01-09 16:38:45,117 INFO L175 Difference]: Start difference. First operand has 352 places, 543 transitions, 12661 flow. Second operand 15 states and 175 transitions. [2025-01-09 16:38:45,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 594 transitions, 14097 flow [2025-01-09 16:38:45,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 594 transitions, 13620 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-09 16:38:45,879 INFO L231 Difference]: Finished difference. Result has 355 places, 545 transitions, 12715 flow [2025-01-09 16:38:45,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12161, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12715, PETRI_PLACES=355, PETRI_TRANSITIONS=545} [2025-01-09 16:38:45,880 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 329 predicate places. [2025-01-09 16:38:45,880 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 545 transitions, 12715 flow [2025-01-09 16:38:45,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:45,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:45,881 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:45,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 16:38:45,881 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:45,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1238748417, now seen corresponding path program 4 times [2025-01-09 16:38:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:45,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064584000] [2025-01-09 16:38:45,882 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:45,893 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:45,895 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 31 statements. [2025-01-09 16:38:45,895 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:38:45,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:45,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064584000] [2025-01-09 16:38:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064584000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:45,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:38:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826684702] [2025-01-09 16:38:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:45,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:38:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:45,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:38:45,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:38:45,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:45,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 545 transitions, 12715 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:45,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:45,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:45,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:47,556 INFO L124 PetriNetUnfolderBase]: 4481/8236 cut-off events. [2025-01-09 16:38:47,556 INFO L125 PetriNetUnfolderBase]: For 103146/103326 co-relation queries the response was YES. [2025-01-09 16:38:47,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63184 conditions, 8236 events. 4481/8236 cut-off events. For 103146/103326 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 60306 event pairs, 771 based on Foata normal form. 5/8215 useless extension candidates. Maximal degree in co-relation 63031. Up to 1805 conditions per place. [2025-01-09 16:38:47,627 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 319 selfloop transitions, 277 changer transitions 4/603 dead transitions. [2025-01-09 16:38:47,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 603 transitions, 14206 flow [2025-01-09 16:38:47,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:38:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:38:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 179 transitions. [2025-01-09 16:38:47,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45663265306122447 [2025-01-09 16:38:47,628 INFO L175 Difference]: Start difference. First operand has 355 places, 545 transitions, 12715 flow. Second operand 14 states and 179 transitions. [2025-01-09 16:38:47,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 603 transitions, 14206 flow [2025-01-09 16:38:48,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 603 transitions, 14059 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-01-09 16:38:48,224 INFO L231 Difference]: Finished difference. Result has 355 places, 545 transitions, 13121 flow [2025-01-09 16:38:48,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12522, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13121, PETRI_PLACES=355, PETRI_TRANSITIONS=545} [2025-01-09 16:38:48,225 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 329 predicate places. [2025-01-09 16:38:48,225 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 545 transitions, 13121 flow [2025-01-09 16:38:48,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:48,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:48,226 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:48,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 16:38:48,226 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:48,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:48,227 INFO L85 PathProgramCache]: Analyzing trace with hash 752191108, now seen corresponding path program 2 times [2025-01-09 16:38:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:48,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175278297] [2025-01-09 16:38:48,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:38:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:48,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:48,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-01-09 16:38:48,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:38:48,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:48,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:48,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175278297] [2025-01-09 16:38:48,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175278297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:48,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:48,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:38:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292122399] [2025-01-09 16:38:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:48,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:38:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:48,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:38:48,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:38:48,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:48,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 545 transitions, 13121 flow. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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:38:48,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:48,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:48,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:50,038 INFO L124 PetriNetUnfolderBase]: 4402/8142 cut-off events. [2025-01-09 16:38:50,040 INFO L125 PetriNetUnfolderBase]: For 103049/103222 co-relation queries the response was YES. [2025-01-09 16:38:50,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63938 conditions, 8142 events. 4402/8142 cut-off events. For 103049/103222 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 59864 event pairs, 1197 based on Foata normal form. 41/8146 useless extension candidates. Maximal degree in co-relation 63786. Up to 3554 conditions per place. [2025-01-09 16:38:50,107 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 344 selfloop transitions, 259 changer transitions 0/606 dead transitions. [2025-01-09 16:38:50,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 606 transitions, 15130 flow [2025-01-09 16:38:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:38:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:38:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 155 transitions. [2025-01-09 16:38:50,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46130952380952384 [2025-01-09 16:38:50,109 INFO L175 Difference]: Start difference. First operand has 355 places, 545 transitions, 13121 flow. Second operand 12 states and 155 transitions. [2025-01-09 16:38:50,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 606 transitions, 15130 flow [2025-01-09 16:38:50,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 606 transitions, 14976 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-09 16:38:50,666 INFO L231 Difference]: Finished difference. Result has 358 places, 542 transitions, 13459 flow [2025-01-09 16:38:50,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12841, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13459, PETRI_PLACES=358, PETRI_TRANSITIONS=542} [2025-01-09 16:38:50,667 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 332 predicate places. [2025-01-09 16:38:50,667 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 542 transitions, 13459 flow [2025-01-09 16:38:50,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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:38:50,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:50,668 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:50,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 16:38:50,668 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:50,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash -790857186, now seen corresponding path program 3 times [2025-01-09 16:38:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:50,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542202469] [2025-01-09 16:38:50,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:38:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:50,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-01-09 16:38:50,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 31 statements. [2025-01-09 16:38:50,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:38:50,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:50,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542202469] [2025-01-09 16:38:50,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542202469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:50,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:50,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:38:50,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273093991] [2025-01-09 16:38:50,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:50,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:38:50,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:50,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:38:50,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:38:50,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:50,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 542 transitions, 13459 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:50,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:50,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:50,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:52,694 INFO L124 PetriNetUnfolderBase]: 4394/8130 cut-off events. [2025-01-09 16:38:52,695 INFO L125 PetriNetUnfolderBase]: For 112327/112501 co-relation queries the response was YES. [2025-01-09 16:38:52,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65357 conditions, 8130 events. 4394/8130 cut-off events. For 112327/112501 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 59794 event pairs, 1790 based on Foata normal form. 4/8103 useless extension candidates. Maximal degree in co-relation 65203. Up to 5608 conditions per place. [2025-01-09 16:38:52,765 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 421 selfloop transitions, 135 changer transitions 5/564 dead transitions. [2025-01-09 16:38:52,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 564 transitions, 14593 flow [2025-01-09 16:38:52,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:38:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:38:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2025-01-09 16:38:52,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3898809523809524 [2025-01-09 16:38:52,767 INFO L175 Difference]: Start difference. First operand has 358 places, 542 transitions, 13459 flow. Second operand 12 states and 131 transitions. [2025-01-09 16:38:52,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 564 transitions, 14593 flow [2025-01-09 16:38:53,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 564 transitions, 14218 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-01-09 16:38:53,383 INFO L231 Difference]: Finished difference. Result has 361 places, 539 transitions, 13273 flow [2025-01-09 16:38:53,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13029, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=13273, PETRI_PLACES=361, PETRI_TRANSITIONS=539} [2025-01-09 16:38:53,384 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 335 predicate places. [2025-01-09 16:38:53,384 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 539 transitions, 13273 flow [2025-01-09 16:38:53,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:53,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:53,385 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:53,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 16:38:53,385 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:53,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:53,385 INFO L85 PathProgramCache]: Analyzing trace with hash -376323226, now seen corresponding path program 4 times [2025-01-09 16:38:53,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:53,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154880829] [2025-01-09 16:38:53,386 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:38:53,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:53,392 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:38:53,395 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 31 statements. [2025-01-09 16:38:53,395 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:38:53,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:53,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:53,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154880829] [2025-01-09 16:38:53,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154880829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:38:53,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:38:53,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:38:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422744218] [2025-01-09 16:38:53,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:38:53,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:38:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:53,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:38:53,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:38:53,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:53,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 539 transitions, 13273 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:53,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:53,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:53,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:55,146 INFO L124 PetriNetUnfolderBase]: 4666/8675 cut-off events. [2025-01-09 16:38:55,146 INFO L125 PetriNetUnfolderBase]: For 115388/115559 co-relation queries the response was YES. [2025-01-09 16:38:55,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67566 conditions, 8675 events. 4666/8675 cut-off events. For 115388/115559 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 64828 event pairs, 939 based on Foata normal form. 32/8670 useless extension candidates. Maximal degree in co-relation 67412. Up to 3186 conditions per place. [2025-01-09 16:38:55,242 INFO L140 encePairwiseOnDemand]: 19/28 looper letters, 303 selfloop transitions, 288 changer transitions 2/596 dead transitions. [2025-01-09 16:38:55,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 596 transitions, 14890 flow [2025-01-09 16:38:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:38:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:38:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2025-01-09 16:38:55,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5032467532467533 [2025-01-09 16:38:55,244 INFO L175 Difference]: Start difference. First operand has 361 places, 539 transitions, 13273 flow. Second operand 11 states and 155 transitions. [2025-01-09 16:38:55,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 596 transitions, 14890 flow [2025-01-09 16:38:56,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 596 transitions, 14436 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-01-09 16:38:56,112 INFO L231 Difference]: Finished difference. Result has 356 places, 542 transitions, 13654 flow [2025-01-09 16:38:56,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12585, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13654, PETRI_PLACES=356, PETRI_TRANSITIONS=542} [2025-01-09 16:38:56,113 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 330 predicate places. [2025-01-09 16:38:56,113 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 542 transitions, 13654 flow [2025-01-09 16:38:56,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:38:56,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:56,113 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:56,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 16:38:56,115 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:56,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:56,115 INFO L85 PathProgramCache]: Analyzing trace with hash -766104563, now seen corresponding path program 5 times [2025-01-09 16:38:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:56,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979802246] [2025-01-09 16:38:56,116 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:56,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:56,124 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-01-09 16:38:56,156 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:56,156 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:38:56,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 16:38:56,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:38:56,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979802246] [2025-01-09 16:38:56,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979802246] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:38:56,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970014006] [2025-01-09 16:38:56,423 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:56,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:38:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:56,425 INFO L229 MonitoredProcess]: Starting monitored process 9 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:38:56,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:38:56,521 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-01-09 16:38:56,580 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:38:56,580 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:38:56,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:38:56,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 16:38:56,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:38:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:56,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:56,792 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-01-09 16:38:56,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-01-09 16:38:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:38:56,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970014006] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:56,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:56,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-01-09 16:38:56,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758363379] [2025-01-09 16:38:56,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:56,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:38:56,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:56,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:38:56,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:38:56,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:38:56,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 542 transitions, 13654 flow. Second operand has 17 states, 17 states have (on average 7.470588235294118) internal successors, (127), 17 states have internal predecessors, (127), 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:38:56,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:56,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:38:56,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:58,745 INFO L124 PetriNetUnfolderBase]: 4891/9165 cut-off events. [2025-01-09 16:38:58,745 INFO L125 PetriNetUnfolderBase]: For 141848/142018 co-relation queries the response was YES. [2025-01-09 16:38:58,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71372 conditions, 9165 events. 4891/9165 cut-off events. For 141848/142018 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 70077 event pairs, 984 based on Foata normal form. 48/9178 useless extension candidates. Maximal degree in co-relation 71218. Up to 2677 conditions per place. [2025-01-09 16:38:58,968 INFO L140 encePairwiseOnDemand]: 15/28 looper letters, 351 selfloop transitions, 290 changer transitions 0/644 dead transitions. [2025-01-09 16:38:58,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 644 transitions, 16152 flow [2025-01-09 16:38:58,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:38:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 16:38:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 209 transitions. [2025-01-09 16:38:58,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43907563025210083 [2025-01-09 16:38:58,970 INFO L175 Difference]: Start difference. First operand has 356 places, 542 transitions, 13654 flow. Second operand 17 states and 209 transitions. [2025-01-09 16:38:58,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 644 transitions, 16152 flow [2025-01-09 16:38:59,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 644 transitions, 15672 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-01-09 16:38:59,775 INFO L231 Difference]: Finished difference. Result has 368 places, 581 transitions, 14839 flow [2025-01-09 16:38:59,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=13194, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=14839, PETRI_PLACES=368, PETRI_TRANSITIONS=581} [2025-01-09 16:38:59,776 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 342 predicate places. [2025-01-09 16:38:59,776 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 581 transitions, 14839 flow [2025-01-09 16:38:59,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.470588235294118) internal successors, (127), 17 states have internal predecessors, (127), 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:38:59,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:38:59,776 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:38:59,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 16:38:59,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-01-09 16:38:59,978 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:38:59,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:38:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1610818398, now seen corresponding path program 5 times [2025-01-09 16:38:59,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:38:59,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788956700] [2025-01-09 16:38:59,979 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:38:59,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:38:59,990 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-01-09 16:39:00,007 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:39:00,008 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:39:00,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788956700] [2025-01-09 16:39:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788956700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:39:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853261682] [2025-01-09 16:39:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:00,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:39:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:00,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:39:00,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:39:00,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:39:00,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 581 transitions, 14839 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:00,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:00,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:39:00,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:02,980 INFO L124 PetriNetUnfolderBase]: 4997/9390 cut-off events. [2025-01-09 16:39:02,980 INFO L125 PetriNetUnfolderBase]: For 142023/142189 co-relation queries the response was YES. [2025-01-09 16:39:03,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74654 conditions, 9390 events. 4997/9390 cut-off events. For 142023/142189 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 72134 event pairs, 1051 based on Foata normal form. 32/9379 useless extension candidates. Maximal degree in co-relation 74492. Up to 3354 conditions per place. [2025-01-09 16:39:03,285 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 341 selfloop transitions, 307 changer transitions 1/652 dead transitions. [2025-01-09 16:39:03,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 652 transitions, 16924 flow [2025-01-09 16:39:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:39:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 16:39:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2025-01-09 16:39:03,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47527472527472525 [2025-01-09 16:39:03,286 INFO L175 Difference]: Start difference. First operand has 368 places, 581 transitions, 14839 flow. Second operand 13 states and 173 transitions. [2025-01-09 16:39:03,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 652 transitions, 16924 flow [2025-01-09 16:39:04,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 652 transitions, 16466 flow, removed 28 selfloop flow, removed 11 redundant places. [2025-01-09 16:39:04,230 INFO L231 Difference]: Finished difference. Result has 372 places, 587 transitions, 15537 flow [2025-01-09 16:39:04,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=14405, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15537, PETRI_PLACES=372, PETRI_TRANSITIONS=587} [2025-01-09 16:39:04,231 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 346 predicate places. [2025-01-09 16:39:04,231 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 587 transitions, 15537 flow [2025-01-09 16:39:04,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:04,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:04,232 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:04,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 16:39:04,232 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:04,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:04,232 INFO L85 PathProgramCache]: Analyzing trace with hash 752934235, now seen corresponding path program 6 times [2025-01-09 16:39:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:04,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277669633] [2025-01-09 16:39:04,232 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:39:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:04,243 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-01-09 16:39:04,259 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 31 statements. [2025-01-09 16:39:04,260 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-09 16:39:04,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:04,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:04,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277669633] [2025-01-09 16:39:04,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277669633] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:04,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823707902] [2025-01-09 16:39:04,912 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:39:04,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:04,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:04,921 INFO L229 MonitoredProcess]: Starting monitored process 10 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:39:04,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 16:39:05,027 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-01-09 16:39:05,055 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 31 statements. [2025-01-09 16:39:05,055 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-09 16:39:05,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:05,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 16:39:05,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:05,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:05,271 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 118 treesize of output 70 [2025-01-09 16:39:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:05,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:05,495 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-01-09 16:39:05,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-01-09 16:39:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823707902] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:39:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 9] total 18 [2025-01-09 16:39:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346803145] [2025-01-09 16:39:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:05,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:39:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:05,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:39:05,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:39:05,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:39:05,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 587 transitions, 15537 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:05,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:05,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:39:05,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:07,837 INFO L124 PetriNetUnfolderBase]: 5109/9617 cut-off events. [2025-01-09 16:39:07,837 INFO L125 PetriNetUnfolderBase]: For 172589/172758 co-relation queries the response was YES. [2025-01-09 16:39:07,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78647 conditions, 9617 events. 5109/9617 cut-off events. For 172589/172758 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 74601 event pairs, 1028 based on Foata normal form. 28/9610 useless extension candidates. Maximal degree in co-relation 78489. Up to 2835 conditions per place. [2025-01-09 16:39:07,949 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 391 selfloop transitions, 272 changer transitions 0/666 dead transitions. [2025-01-09 16:39:07,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 666 transitions, 17587 flow [2025-01-09 16:39:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:39:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:39:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 197 transitions. [2025-01-09 16:39:07,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5025510204081632 [2025-01-09 16:39:07,950 INFO L175 Difference]: Start difference. First operand has 372 places, 587 transitions, 15537 flow. Second operand 14 states and 197 transitions. [2025-01-09 16:39:07,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 666 transitions, 17587 flow [2025-01-09 16:39:09,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 666 transitions, 17245 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-01-09 16:39:09,095 INFO L231 Difference]: Finished difference. Result has 377 places, 595 transitions, 15998 flow [2025-01-09 16:39:09,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=15216, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15998, PETRI_PLACES=377, PETRI_TRANSITIONS=595} [2025-01-09 16:39:09,096 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 351 predicate places. [2025-01-09 16:39:09,096 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 595 transitions, 15998 flow [2025-01-09 16:39:09,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:09,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:09,096 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:09,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 16:39:09,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:09,297 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:09,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:09,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2081631655, now seen corresponding path program 7 times [2025-01-09 16:39:09,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:09,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322363588] [2025-01-09 16:39:09,298 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:39:09,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:09,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:39:09,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:39:09,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:09,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:09,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322363588] [2025-01-09 16:39:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322363588] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481166122] [2025-01-09 16:39:09,668 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:39:09,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:09,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:09,674 INFO L229 MonitoredProcess]: Starting monitored process 11 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:39:09,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 16:39:09,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:39:09,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:39:09,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:09,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:09,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:39:09,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:09,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:09,877 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 118 treesize of output 74 [2025-01-09 16:39:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:09,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:09,975 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-01-09 16:39:09,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 95 [2025-01-09 16:39:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:10,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481166122] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:10,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:39:10,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 7] total 18 [2025-01-09 16:39:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346538561] [2025-01-09 16:39:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:10,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:39:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:10,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:39:10,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:39:10,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:39:10,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 595 transitions, 15998 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:10,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:10,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:39:10,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:11,930 INFO L124 PetriNetUnfolderBase]: 5011/9437 cut-off events. [2025-01-09 16:39:11,930 INFO L125 PetriNetUnfolderBase]: For 173017/173183 co-relation queries the response was YES. [2025-01-09 16:39:11,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78434 conditions, 9437 events. 5011/9437 cut-off events. For 173017/173183 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 72937 event pairs, 1097 based on Foata normal form. 28/9426 useless extension candidates. Maximal degree in co-relation 78275. Up to 3415 conditions per place. [2025-01-09 16:39:12,017 INFO L140 encePairwiseOnDemand]: 20/28 looper letters, 394 selfloop transitions, 250 changer transitions 0/647 dead transitions. [2025-01-09 16:39:12,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 647 transitions, 17595 flow [2025-01-09 16:39:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:39:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:39:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 159 transitions. [2025-01-09 16:39:12,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5162337662337663 [2025-01-09 16:39:12,018 INFO L175 Difference]: Start difference. First operand has 377 places, 595 transitions, 15998 flow. Second operand 11 states and 159 transitions. [2025-01-09 16:39:12,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 647 transitions, 17595 flow [2025-01-09 16:39:13,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 647 transitions, 17162 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-01-09 16:39:13,225 INFO L231 Difference]: Finished difference. Result has 381 places, 589 transitions, 16000 flow [2025-01-09 16:39:13,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=15383, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16000, PETRI_PLACES=381, PETRI_TRANSITIONS=589} [2025-01-09 16:39:13,227 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 355 predicate places. [2025-01-09 16:39:13,227 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 589 transitions, 16000 flow [2025-01-09 16:39:13,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:13,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:13,228 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:13,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 16:39:13,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:13,429 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:13,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:13,430 INFO L85 PathProgramCache]: Analyzing trace with hash 37578555, now seen corresponding path program 8 times [2025-01-09 16:39:13,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:13,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689081837] [2025-01-09 16:39:13,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:13,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:13,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:39:13,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 31 statements. [2025-01-09 16:39:13,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:13,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:13,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:13,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689081837] [2025-01-09 16:39:13,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689081837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:13,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:13,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:39:13,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157065139] [2025-01-09 16:39:13,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:13,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:39:13,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:13,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:39:13,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:39:13,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:39:13,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 589 transitions, 16000 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:13,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:13,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:39:13,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:16,048 INFO L124 PetriNetUnfolderBase]: 4992/9409 cut-off events. [2025-01-09 16:39:16,048 INFO L125 PetriNetUnfolderBase]: For 172582/172746 co-relation queries the response was YES. [2025-01-09 16:39:16,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78713 conditions, 9409 events. 4992/9409 cut-off events. For 172582/172746 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 72645 event pairs, 2182 based on Foata normal form. 5/9371 useless extension candidates. Maximal degree in co-relation 78554. Up to 6354 conditions per place. [2025-01-09 16:39:16,337 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 521 selfloop transitions, 92 changer transitions 3/619 dead transitions. [2025-01-09 16:39:16,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 619 transitions, 17412 flow [2025-01-09 16:39:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:39:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:39:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2025-01-09 16:39:16,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-01-09 16:39:16,338 INFO L175 Difference]: Start difference. First operand has 381 places, 589 transitions, 16000 flow. Second operand 11 states and 133 transitions. [2025-01-09 16:39:16,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 619 transitions, 17412 flow [2025-01-09 16:39:17,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 619 transitions, 17012 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-09 16:39:17,369 INFO L231 Difference]: Finished difference. Result has 384 places, 585 transitions, 15689 flow [2025-01-09 16:39:17,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=15531, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15689, PETRI_PLACES=384, PETRI_TRANSITIONS=585} [2025-01-09 16:39:17,369 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 358 predicate places. [2025-01-09 16:39:17,369 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 585 transitions, 15689 flow [2025-01-09 16:39:17,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:17,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:17,370 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:17,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 16:39:17,370 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:17,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1872622241, now seen corresponding path program 9 times [2025-01-09 16:39:17,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:17,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876960020] [2025-01-09 16:39:17,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:17,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:17,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-01-09 16:39:17,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 31 statements. [2025-01-09 16:39:17,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:39:17,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876960020] [2025-01-09 16:39:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876960020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:17,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:39:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516351467] [2025-01-09 16:39:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:17,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:39:17,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:17,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:39:17,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:39:17,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:39:17,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 585 transitions, 15689 flow. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:17,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:17,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:39:17,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:19,935 INFO L124 PetriNetUnfolderBase]: 5023/9489 cut-off events. [2025-01-09 16:39:19,935 INFO L125 PetriNetUnfolderBase]: For 171925/172089 co-relation queries the response was YES. [2025-01-09 16:39:19,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77759 conditions, 9489 events. 5023/9489 cut-off events. For 171925/172089 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 73628 event pairs, 2167 based on Foata normal form. 5/9451 useless extension candidates. Maximal degree in co-relation 77599. Up to 6309 conditions per place. [2025-01-09 16:39:20,030 INFO L140 encePairwiseOnDemand]: 18/28 looper letters, 513 selfloop transitions, 102 changer transitions 5/623 dead transitions. [2025-01-09 16:39:20,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 623 transitions, 17137 flow [2025-01-09 16:39:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:39:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:39:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 154 transitions. [2025-01-09 16:39:20,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-01-09 16:39:20,031 INFO L175 Difference]: Start difference. First operand has 384 places, 585 transitions, 15689 flow. Second operand 14 states and 154 transitions. [2025-01-09 16:39:20,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 623 transitions, 17137 flow [2025-01-09 16:39:21,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 623 transitions, 16927 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-01-09 16:39:21,215 INFO L231 Difference]: Finished difference. Result has 385 places, 587 transitions, 15769 flow [2025-01-09 16:39:21,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=15415, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15769, PETRI_PLACES=385, PETRI_TRANSITIONS=587} [2025-01-09 16:39:21,216 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 359 predicate places. [2025-01-09 16:39:21,216 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 587 transitions, 15769 flow [2025-01-09 16:39:21,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:21,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:21,216 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:21,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 16:39:21,216 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:21,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:21,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1366275975, now seen corresponding path program 10 times [2025-01-09 16:39:21,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:21,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562542304] [2025-01-09 16:39:21,217 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:21,233 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:39:21,240 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 31 statements. [2025-01-09 16:39:21,241 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:39:21,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:21,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:21,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562542304] [2025-01-09 16:39:21,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562542304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:21,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:21,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:39:21,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330282730] [2025-01-09 16:39:21,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:21,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:39:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:21,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:39:21,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:39:21,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:39:21,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 587 transitions, 15769 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:21,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:21,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:39:21,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand