./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-subst.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-name-comparator-subst.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 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:38:57,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:38:57,703 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:38:57,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:38:57,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:38:57,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:38:57,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:38:57,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:38:57,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:38:57,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:38:57,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:38:57,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:38:57,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:38:57,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:38:57,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:38:57,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:38:57,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:38:57,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:38:57,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:38:57,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:38:57,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:38:57,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:38:57,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:38:57,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:38:57,733 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 -> 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d [2025-01-09 16:38:57,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:38:57,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:38:57,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:38:57,978 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:38:57,978 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:38:57,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-01-09 16:38:59,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a471100c5/606ecc5e23d04347bec6922e2ecdadf9/FLAG870646ecb [2025-01-09 16:38:59,308 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:38:59,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-01-09 16:38:59,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a471100c5/606ecc5e23d04347bec6922e2ecdadf9/FLAG870646ecb [2025-01-09 16:38:59,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a471100c5/606ecc5e23d04347bec6922e2ecdadf9 [2025-01-09 16:38:59,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:38:59,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:38:59,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:38:59,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:38:59,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:38:59,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c31941c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59, skipping insertion in model container [2025-01-09 16:38:59,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:38:59,832 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-name-comparator-subst.wvr.c[4875,4888] [2025-01-09 16:38:59,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:38:59,852 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:38:59,880 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-name-comparator-subst.wvr.c[4875,4888] [2025-01-09 16:38:59,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:38:59,892 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:38:59,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59 WrapperNode [2025-01-09 16:38:59,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:38:59,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:38:59,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:38:59,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:38:59,899 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:38:59" (1/1) ... [2025-01-09 16:38:59,907 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:38:59" (1/1) ... [2025-01-09 16:38:59,935 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 298 [2025-01-09 16:38:59,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:38:59,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:38:59,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:38:59,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:38:59,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,958 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:38:59,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:38:59,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:38:59,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:38:59,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:38:59,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (1/1) ... [2025-01-09 16:38:59,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:38:59,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:38:59,994 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:38:59,996 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:39:00,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:39:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:39:00,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:39:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:39:00,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:39:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:39:00,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:39:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:39:00,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:39:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:39:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:39:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:39:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:39:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:39:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:39:00,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:39:00,019 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:39:00,100 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:39:00,101 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:39:00,414 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:39:00,414 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:39:00,726 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:39:00,727 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 16:39:00,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:00 BoogieIcfgContainer [2025-01-09 16:39:00,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:39:00,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:39:00,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:39:00,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:39:00,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:38:59" (1/3) ... [2025-01-09 16:39:00,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771f092b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:00, skipping insertion in model container [2025-01-09 16:39:00,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:38:59" (2/3) ... [2025-01-09 16:39:00,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771f092b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:00, skipping insertion in model container [2025-01-09 16:39:00,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:00" (3/3) ... [2025-01-09 16:39:00,735 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2025-01-09 16:39:00,746 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:39:00,747 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-subst.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:39:00,748 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:39:00,804 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:39:00,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 36 transitions, 93 flow [2025-01-09 16:39:00,858 INFO L124 PetriNetUnfolderBase]: 7/33 cut-off events. [2025-01-09 16:39:00,860 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:00,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 7/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-01-09 16:39:00,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 36 transitions, 93 flow [2025-01-09 16:39:00,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 82 flow [2025-01-09 16:39:00,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:39:00,887 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;@1c64079e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:39:00,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:39:00,900 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:39:00,900 INFO L124 PetriNetUnfolderBase]: 7/31 cut-off events. [2025-01-09 16:39:00,900 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:00,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:00,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:00,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:00,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash -762245982, now seen corresponding path program 1 times [2025-01-09 16:39:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:00,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135384327] [2025-01-09 16:39:00,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:00,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:00,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:39:01,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:39:01,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:01,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:01,091 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:39:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:01,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135384327] [2025-01-09 16:39:01,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135384327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:01,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:01,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:39:01,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608112340] [2025-01-09 16:39:01,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:01,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:39:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:01,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:39:01,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:39:01,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:01,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 82 flow. Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:01,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:01,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:01,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:01,384 INFO L124 PetriNetUnfolderBase]: 792/1137 cut-off events. [2025-01-09 16:39:01,385 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-01-09 16:39:01,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 1137 events. 792/1137 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3702 event pairs, 608 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 2150. Up to 1137 conditions per place. [2025-01-09 16:39:01,393 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 28 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2025-01-09 16:39:01,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 132 flow [2025-01-09 16:39:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:39:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:39:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-01-09 16:39:01,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-09 16:39:01,402 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 82 flow. Second operand 2 states and 39 transitions. [2025-01-09 16:39:01,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 132 flow [2025-01-09 16:39:01,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:39:01,408 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 64 flow [2025-01-09 16:39:01,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2025-01-09 16:39:01,411 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2025-01-09 16:39:01,412 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 64 flow [2025-01-09 16:39:01,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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:01,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:01,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:01,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:39:01,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:01,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1132213606, now seen corresponding path program 1 times [2025-01-09 16:39:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841964946] [2025-01-09 16:39:01,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:01,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:39:01,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:39:01,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:01,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:01,641 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:39:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841964946] [2025-01-09 16:39:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841964946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:01,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:01,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:39:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166304701] [2025-01-09 16:39:01,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:01,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:01,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:01,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:01,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:01,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:01,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:01,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:01,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:01,796 INFO L124 PetriNetUnfolderBase]: 792/1138 cut-off events. [2025-01-09 16:39:01,798 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 16:39:01,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 1138 events. 792/1138 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3697 event pairs, 608 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 2306. Up to 1137 conditions per place. [2025-01-09 16:39:01,805 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 27 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-01-09 16:39:01,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 124 flow [2025-01-09 16:39:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-01-09 16:39:01,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-01-09 16:39:01,808 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 64 flow. Second operand 3 states and 42 transitions. [2025-01-09 16:39:01,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 124 flow [2025-01-09 16:39:01,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:01,811 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 76 flow [2025-01-09 16:39:01,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2025-01-09 16:39:01,813 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2025-01-09 16:39:01,813 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 76 flow [2025-01-09 16:39:01,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:01,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:01,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:01,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:39:01,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:01,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1732024641, now seen corresponding path program 1 times [2025-01-09 16:39:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:01,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460676590] [2025-01-09 16:39:01,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:01,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:01,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:39:01,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:39:01,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:01,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:39:01,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:01,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460676590] [2025-01-09 16:39:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460676590] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281059389] [2025-01-09 16:39:01,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:01,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:01,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:01,962 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:39:01,963 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:39:02,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:39:02,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:39:02,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:02,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:02,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:39:02,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:39:02,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:39:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281059389] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:02,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:02,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:39:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905247536] [2025-01-09 16:39:02,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:02,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:39:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:02,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:39:02,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:39:02,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:02,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:02,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:02,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:02,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:02,362 INFO L124 PetriNetUnfolderBase]: 792/1140 cut-off events. [2025-01-09 16:39:02,363 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 16:39:02,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 1140 events. 792/1140 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3697 event pairs, 608 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 2317. Up to 1137 conditions per place. [2025-01-09 16:39:02,371 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 27 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-01-09 16:39:02,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 146 flow [2025-01-09 16:39:02,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:39:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:39:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-01-09 16:39:02,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2025-01-09 16:39:02,374 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 76 flow. Second operand 5 states and 53 transitions. [2025-01-09 16:39:02,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 146 flow [2025-01-09 16:39:02,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 142 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:02,376 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 98 flow [2025-01-09 16:39:02,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-01-09 16:39:02,377 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-01-09 16:39:02,378 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 98 flow [2025-01-09 16:39:02,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:02,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:02,378 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:02,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:39:02,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:02,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:02,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash 211984287, now seen corresponding path program 2 times [2025-01-09 16:39:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:02,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560797061] [2025-01-09 16:39:02,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:02,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:39:02,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-01-09 16:39:02,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:02,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:03,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:03,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560797061] [2025-01-09 16:39:03,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560797061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:03,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:03,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:39:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616066730] [2025-01-09 16:39:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:03,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:39:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:03,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:39:03,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:39:03,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:03,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:03,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:03,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:03,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:03,593 INFO L124 PetriNetUnfolderBase]: 1926/2789 cut-off events. [2025-01-09 16:39:03,593 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-09 16:39:03,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5646 conditions, 2789 events. 1926/2789 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11884 event pairs, 608 based on Foata normal form. 1/2306 useless extension candidates. Maximal degree in co-relation 5639. Up to 1184 conditions per place. [2025-01-09 16:39:03,603 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 75 selfloop transitions, 7 changer transitions 11/94 dead transitions. [2025-01-09 16:39:03,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 94 transitions, 421 flow [2025-01-09 16:39:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-01-09 16:39:03,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5324074074074074 [2025-01-09 16:39:03,604 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 98 flow. Second operand 6 states and 115 transitions. [2025-01-09 16:39:03,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 94 transitions, 421 flow [2025-01-09 16:39:03,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 94 transitions, 411 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:03,606 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 139 flow [2025-01-09 16:39:03,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2025-01-09 16:39:03,607 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-01-09 16:39:03,607 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 139 flow [2025-01-09 16:39:03,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:03,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:03,607 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:03,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:39:03,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:03,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1364587943, now seen corresponding path program 3 times [2025-01-09 16:39:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:03,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965796027] [2025-01-09 16:39:03,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:03,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-09 16:39:03,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-01-09 16:39:03,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:39:03,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965796027] [2025-01-09 16:39:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965796027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:39:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964246818] [2025-01-09 16:39:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:03,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:39:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:03,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:39:03,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:39:03,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:03,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:03,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:03,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:03,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:04,439 INFO L124 PetriNetUnfolderBase]: 2953/4259 cut-off events. [2025-01-09 16:39:04,440 INFO L125 PetriNetUnfolderBase]: For 1333/1333 co-relation queries the response was YES. [2025-01-09 16:39:04,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10364 conditions, 4259 events. 2953/4259 cut-off events. For 1333/1333 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19006 event pairs, 1209 based on Foata normal form. 1/4030 useless extension candidates. Maximal degree in co-relation 10352. Up to 2089 conditions per place. [2025-01-09 16:39:04,461 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 74 selfloop transitions, 8 changer transitions 11/94 dead transitions. [2025-01-09 16:39:04,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 94 transitions, 486 flow [2025-01-09 16:39:04,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-01-09 16:39:04,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2025-01-09 16:39:04,464 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 139 flow. Second operand 6 states and 105 transitions. [2025-01-09 16:39:04,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 94 transitions, 486 flow [2025-01-09 16:39:04,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 482 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:04,470 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 196 flow [2025-01-09 16:39:04,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2025-01-09 16:39:04,471 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2025-01-09 16:39:04,471 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 196 flow [2025-01-09 16:39:04,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:04,472 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:04,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:39:04,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:04,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:04,474 INFO L85 PathProgramCache]: Analyzing trace with hash -354585923, now seen corresponding path program 4 times [2025-01-09 16:39:04,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:04,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321168956] [2025-01-09 16:39:04,474 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:04,485 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:39:04,509 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:39:04,509 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:04,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:04,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321168956] [2025-01-09 16:39:04,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321168956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:04,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:04,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:39:04,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254511279] [2025-01-09 16:39:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:04,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:04,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:04,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:04,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:04,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:04,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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:04,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:04,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:04,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:05,919 INFO L124 PetriNetUnfolderBase]: 7015/10227 cut-off events. [2025-01-09 16:39:05,919 INFO L125 PetriNetUnfolderBase]: For 11168/11168 co-relation queries the response was YES. [2025-01-09 16:39:05,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28435 conditions, 10227 events. 7015/10227 cut-off events. For 11168/11168 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 56980 event pairs, 2510 based on Foata normal form. 1/9646 useless extension candidates. Maximal degree in co-relation 28419. Up to 4351 conditions per place. [2025-01-09 16:39:05,975 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 122 selfloop transitions, 19 changer transitions 2/144 dead transitions. [2025-01-09 16:39:05,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 144 transitions, 957 flow [2025-01-09 16:39:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-01-09 16:39:05,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-01-09 16:39:05,976 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 196 flow. Second operand 7 states and 135 transitions. [2025-01-09 16:39:05,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 144 transitions, 957 flow [2025-01-09 16:39:05,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 144 transitions, 930 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:05,988 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 409 flow [2025-01-09 16:39:05,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=409, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2025-01-09 16:39:05,988 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-01-09 16:39:05,989 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 409 flow [2025-01-09 16:39:05,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:05,989 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:05,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:39:05,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:05,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash -862869731, now seen corresponding path program 5 times [2025-01-09 16:39:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534558629] [2025-01-09 16:39:05,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:39:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:06,000 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-01-09 16:39:06,029 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:39:06,030 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:39:06,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:39:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534558629] [2025-01-09 16:39:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534558629] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16541302] [2025-01-09 16:39:06,699 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:39:06,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:06,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:06,701 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:39:06,702 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:39:06,768 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-01-09 16:39:06,800 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:39:06,800 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:39:06,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:06,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 16:39:06,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:07,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:39:07,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16541302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:07,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:39:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2025-01-09 16:39:07,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984133763] [2025-01-09 16:39:07,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:07,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:07,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:07,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:07,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:39:07,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:07,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 409 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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:07,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:07,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:07,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:08,259 INFO L124 PetriNetUnfolderBase]: 7067/10317 cut-off events. [2025-01-09 16:39:08,260 INFO L125 PetriNetUnfolderBase]: For 18088/18088 co-relation queries the response was YES. [2025-01-09 16:39:08,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32321 conditions, 10317 events. 7067/10317 cut-off events. For 18088/18088 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 55659 event pairs, 2733 based on Foata normal form. 1/10318 useless extension candidates. Maximal degree in co-relation 32301. Up to 4780 conditions per place. [2025-01-09 16:39:08,307 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 107 selfloop transitions, 27 changer transitions 4/139 dead transitions. [2025-01-09 16:39:08,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 139 transitions, 1036 flow [2025-01-09 16:39:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2025-01-09 16:39:08,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-01-09 16:39:08,312 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 409 flow. Second operand 7 states and 123 transitions. [2025-01-09 16:39:08,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 139 transitions, 1036 flow [2025-01-09 16:39:08,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 139 transitions, 1034 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:08,348 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 667 flow [2025-01-09 16:39:08,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=667, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2025-01-09 16:39:08,350 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2025-01-09 16:39:08,350 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 667 flow [2025-01-09 16:39:08,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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:08,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:08,351 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:08,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:39:08,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:08,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:08,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:08,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1329812689, now seen corresponding path program 6 times [2025-01-09 16:39:08,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:08,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445139897] [2025-01-09 16:39:08,555 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:39:08,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:08,567 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-01-09 16:39:08,580 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-01-09 16:39:08,582 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:39:08,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:08,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:08,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445139897] [2025-01-09 16:39:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445139897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:08,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:39:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350846914] [2025-01-09 16:39:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:08,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:39:08,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:08,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:39:08,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:39:08,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:08,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 667 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:08,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:08,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:08,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:09,859 INFO L124 PetriNetUnfolderBase]: 7067/10309 cut-off events. [2025-01-09 16:39:09,859 INFO L125 PetriNetUnfolderBase]: For 29406/29406 co-relation queries the response was YES. [2025-01-09 16:39:09,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35632 conditions, 10309 events. 7067/10309 cut-off events. For 29406/29406 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 56444 event pairs, 2670 based on Foata normal form. 4/10313 useless extension candidates. Maximal degree in co-relation 35606. Up to 4549 conditions per place. [2025-01-09 16:39:09,918 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 98 selfloop transitions, 34 changer transitions 16/149 dead transitions. [2025-01-09 16:39:09,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 149 transitions, 1350 flow [2025-01-09 16:39:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-01-09 16:39:09,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2025-01-09 16:39:09,919 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 667 flow. Second operand 6 states and 109 transitions. [2025-01-09 16:39:09,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 149 transitions, 1350 flow [2025-01-09 16:39:09,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 149 transitions, 1326 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:09,971 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 839 flow [2025-01-09 16:39:09,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=839, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2025-01-09 16:39:09,973 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 46 predicate places. [2025-01-09 16:39:09,974 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 839 flow [2025-01-09 16:39:09,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:09,974 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:09,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:39:09,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:09,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:09,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1742527249, now seen corresponding path program 7 times [2025-01-09 16:39:09,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:09,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119192067] [2025-01-09 16:39:09,976 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:39:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:09,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:39:10,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:39:10,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:10,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:10,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:10,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119192067] [2025-01-09 16:39:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119192067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:10,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:10,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:39:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39593428] [2025-01-09 16:39:10,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:10,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:39:10,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:10,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:39:10,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:39:10,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:10,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 839 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:10,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:10,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:11,392 INFO L124 PetriNetUnfolderBase]: 7016/10205 cut-off events. [2025-01-09 16:39:11,392 INFO L125 PetriNetUnfolderBase]: For 38739/38739 co-relation queries the response was YES. [2025-01-09 16:39:11,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37671 conditions, 10205 events. 7016/10205 cut-off events. For 38739/38739 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 55435 event pairs, 2503 based on Foata normal form. 4/10209 useless extension candidates. Maximal degree in co-relation 37640. Up to 4512 conditions per place. [2025-01-09 16:39:11,448 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 88 selfloop transitions, 41 changer transitions 15/145 dead transitions. [2025-01-09 16:39:11,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 145 transitions, 1426 flow [2025-01-09 16:39:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-01-09 16:39:11,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-01-09 16:39:11,449 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 839 flow. Second operand 6 states and 110 transitions. [2025-01-09 16:39:11,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 145 transitions, 1426 flow [2025-01-09 16:39:11,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 145 transitions, 1386 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:11,540 INFO L231 Difference]: Finished difference. Result has 86 places, 85 transitions, 958 flow [2025-01-09 16:39:11,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=958, PETRI_PLACES=86, PETRI_TRANSITIONS=85} [2025-01-09 16:39:11,541 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2025-01-09 16:39:11,542 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 85 transitions, 958 flow [2025-01-09 16:39:11,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:11,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:11,543 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:11,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:39:11,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:11,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2055616027, now seen corresponding path program 8 times [2025-01-09 16:39:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387890830] [2025-01-09 16:39:11,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:11,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:11,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:39:11,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-01-09 16:39:11,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:11,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:11,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:11,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387890830] [2025-01-09 16:39:11,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387890830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:11,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:11,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:39:11,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895204112] [2025-01-09 16:39:11,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:11,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:39:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:11,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:39:11,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:39:11,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:11,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 85 transitions, 958 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:11,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:11,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:11,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:12,688 INFO L124 PetriNetUnfolderBase]: 6985/10185 cut-off events. [2025-01-09 16:39:12,688 INFO L125 PetriNetUnfolderBase]: For 46705/46705 co-relation queries the response was YES. [2025-01-09 16:39:12,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38467 conditions, 10185 events. 6985/10185 cut-off events. For 46705/46705 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 54871 event pairs, 2802 based on Foata normal form. 4/10189 useless extension candidates. Maximal degree in co-relation 38434. Up to 4780 conditions per place. [2025-01-09 16:39:12,774 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 106 selfloop transitions, 29 changer transitions 17/153 dead transitions. [2025-01-09 16:39:12,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 153 transitions, 1568 flow [2025-01-09 16:39:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-01-09 16:39:12,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-01-09 16:39:12,776 INFO L175 Difference]: Start difference. First operand has 86 places, 85 transitions, 958 flow. Second operand 6 states and 110 transitions. [2025-01-09 16:39:12,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 153 transitions, 1568 flow [2025-01-09 16:39:12,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 153 transitions, 1489 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-01-09 16:39:12,878 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 985 flow [2025-01-09 16:39:12,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=985, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2025-01-09 16:39:12,879 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 54 predicate places. [2025-01-09 16:39:12,879 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 985 flow [2025-01-09 16:39:12,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:12,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:12,880 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:12,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:39:12,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:12,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash -686108253, now seen corresponding path program 9 times [2025-01-09 16:39:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:12,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114750807] [2025-01-09 16:39:12,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:12,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:12,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-09 16:39:12,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-01-09 16:39:12,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:39:12,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:13,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114750807] [2025-01-09 16:39:13,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114750807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:13,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:13,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:39:13,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134854203] [2025-01-09 16:39:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:13,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:13,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:13,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:13,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:13,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 985 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:13,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:13,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:14,303 INFO L124 PetriNetUnfolderBase]: 7219/10569 cut-off events. [2025-01-09 16:39:14,304 INFO L125 PetriNetUnfolderBase]: For 50819/50819 co-relation queries the response was YES. [2025-01-09 16:39:14,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40078 conditions, 10569 events. 7219/10569 cut-off events. For 50819/50819 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 59737 event pairs, 2655 based on Foata normal form. 1/10570 useless extension candidates. Maximal degree in co-relation 40044. Up to 4282 conditions per place. [2025-01-09 16:39:14,350 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 180 selfloop transitions, 27 changer transitions 2/210 dead transitions. [2025-01-09 16:39:14,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 210 transitions, 2639 flow [2025-01-09 16:39:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2025-01-09 16:39:14,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-09 16:39:14,351 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 985 flow. Second operand 7 states and 126 transitions. [2025-01-09 16:39:14,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 210 transitions, 2639 flow [2025-01-09 16:39:14,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 210 transitions, 2512 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-01-09 16:39:14,405 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 1315 flow [2025-01-09 16:39:14,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1315, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2025-01-09 16:39:14,405 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 61 predicate places. [2025-01-09 16:39:14,405 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 1315 flow [2025-01-09 16:39:14,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 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:14,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:14,406 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:14,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:39:14,406 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:14,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1853772633, now seen corresponding path program 10 times [2025-01-09 16:39:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:14,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229990043] [2025-01-09 16:39:14,407 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:14,413 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:39:14,420 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:39:14,421 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:14,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:14,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:14,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229990043] [2025-01-09 16:39:14,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229990043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:14,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:14,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:39:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424739050] [2025-01-09 16:39:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:14,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:39:14,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:14,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:39:14,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:39:14,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:14,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 1315 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:14,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:14,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:14,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:15,752 INFO L124 PetriNetUnfolderBase]: 7219/10561 cut-off events. [2025-01-09 16:39:15,752 INFO L125 PetriNetUnfolderBase]: For 57309/57309 co-relation queries the response was YES. [2025-01-09 16:39:15,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41879 conditions, 10561 events. 7219/10561 cut-off events. For 57309/57309 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 57736 event pairs, 2818 based on Foata normal form. 4/10565 useless extension candidates. Maximal degree in co-relation 41841. Up to 4830 conditions per place. [2025-01-09 16:39:15,819 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 106 selfloop transitions, 43 changer transitions 18/168 dead transitions. [2025-01-09 16:39:15,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 168 transitions, 2020 flow [2025-01-09 16:39:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-01-09 16:39:15,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-09 16:39:15,820 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 1315 flow. Second operand 6 states and 108 transitions. [2025-01-09 16:39:15,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 168 transitions, 2020 flow [2025-01-09 16:39:15,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 168 transitions, 1993 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:15,926 INFO L231 Difference]: Finished difference. Result has 102 places, 103 transitions, 1407 flow [2025-01-09 16:39:15,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1407, PETRI_PLACES=102, PETRI_TRANSITIONS=103} [2025-01-09 16:39:15,931 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 67 predicate places. [2025-01-09 16:39:15,931 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 103 transitions, 1407 flow [2025-01-09 16:39:15,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:15,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:15,931 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:15,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:39:15,931 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:15,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1437903922, now seen corresponding path program 1 times [2025-01-09 16:39:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750928171] [2025-01-09 16:39:15,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:15,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:39:15,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:15,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:15,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:16,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750928171] [2025-01-09 16:39:16,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750928171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:16,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:16,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:39:16,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681668950] [2025-01-09 16:39:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:16,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:16,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:16,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:16,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:16,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 1407 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:16,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:16,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:16,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:17,495 INFO L124 PetriNetUnfolderBase]: 8453/12390 cut-off events. [2025-01-09 16:39:17,496 INFO L125 PetriNetUnfolderBase]: For 68458/68458 co-relation queries the response was YES. [2025-01-09 16:39:17,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48463 conditions, 12390 events. 8453/12390 cut-off events. For 68458/68458 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 71767 event pairs, 1139 based on Foata normal form. 13/12403 useless extension candidates. Maximal degree in co-relation 48423. Up to 7882 conditions per place. [2025-01-09 16:39:17,555 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 200 selfloop transitions, 24 changer transitions 1/226 dead transitions. [2025-01-09 16:39:17,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 226 transitions, 3021 flow [2025-01-09 16:39:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2025-01-09 16:39:17,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-01-09 16:39:17,556 INFO L175 Difference]: Start difference. First operand has 102 places, 103 transitions, 1407 flow. Second operand 7 states and 129 transitions. [2025-01-09 16:39:17,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 226 transitions, 3021 flow [2025-01-09 16:39:17,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 226 transitions, 2823 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-01-09 16:39:17,663 INFO L231 Difference]: Finished difference. Result has 106 places, 115 transitions, 1570 flow [2025-01-09 16:39:17,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1570, PETRI_PLACES=106, PETRI_TRANSITIONS=115} [2025-01-09 16:39:17,664 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 71 predicate places. [2025-01-09 16:39:17,664 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 115 transitions, 1570 flow [2025-01-09 16:39:17,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:17,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:17,664 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:17,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:39:17,665 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:17,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1308879730, now seen corresponding path program 2 times [2025-01-09 16:39:17,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:17,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874026359] [2025-01-09 16:39:17,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:17,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:39:17,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:17,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:39:17,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:17,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:17,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874026359] [2025-01-09 16:39:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874026359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:17,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:17,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:39:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624900496] [2025-01-09 16:39:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:17,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:39:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:17,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:39:17,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:39:17,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:17,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 115 transitions, 1570 flow. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:17,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:17,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:19,150 INFO L124 PetriNetUnfolderBase]: 8797/12959 cut-off events. [2025-01-09 16:39:19,150 INFO L125 PetriNetUnfolderBase]: For 77262/77262 co-relation queries the response was YES. [2025-01-09 16:39:19,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51760 conditions, 12959 events. 8797/12959 cut-off events. For 77262/77262 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 75693 event pairs, 2887 based on Foata normal form. 13/12972 useless extension candidates. Maximal degree in co-relation 51717. Up to 4328 conditions per place. [2025-01-09 16:39:19,234 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 212 selfloop transitions, 27 changer transitions 1/241 dead transitions. [2025-01-09 16:39:19,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 241 transitions, 3190 flow [2025-01-09 16:39:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2025-01-09 16:39:19,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5436507936507936 [2025-01-09 16:39:19,235 INFO L175 Difference]: Start difference. First operand has 106 places, 115 transitions, 1570 flow. Second operand 7 states and 137 transitions. [2025-01-09 16:39:19,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 241 transitions, 3190 flow [2025-01-09 16:39:19,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 241 transitions, 3159 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:19,361 INFO L231 Difference]: Finished difference. Result has 115 places, 126 transitions, 1858 flow [2025-01-09 16:39:19,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1858, PETRI_PLACES=115, PETRI_TRANSITIONS=126} [2025-01-09 16:39:19,361 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 80 predicate places. [2025-01-09 16:39:19,362 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 126 transitions, 1858 flow [2025-01-09 16:39:19,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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:19,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:19,362 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:19,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:39:19,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:19,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:19,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1140978026, now seen corresponding path program 3 times [2025-01-09 16:39:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:19,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187147172] [2025-01-09 16:39:19,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:19,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:19,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-01-09 16:39:19,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-01-09 16:39:19,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:39:19,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:19,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187147172] [2025-01-09 16:39:19,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187147172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:19,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:39:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581178372] [2025-01-09 16:39:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:19,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:19,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:19,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:19,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:19,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:19,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 126 transitions, 1858 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:19,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:19,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:19,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:21,000 INFO L124 PetriNetUnfolderBase]: 9229/13597 cut-off events. [2025-01-09 16:39:21,001 INFO L125 PetriNetUnfolderBase]: For 90626/90626 co-relation queries the response was YES. [2025-01-09 16:39:21,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55697 conditions, 13597 events. 9229/13597 cut-off events. For 90626/90626 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 80141 event pairs, 2708 based on Foata normal form. 8/13605 useless extension candidates. Maximal degree in co-relation 55650. Up to 4360 conditions per place. [2025-01-09 16:39:21,082 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 198 selfloop transitions, 48 changer transitions 1/248 dead transitions. [2025-01-09 16:39:21,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 248 transitions, 3351 flow [2025-01-09 16:39:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-01-09 16:39:21,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-09 16:39:21,083 INFO L175 Difference]: Start difference. First operand has 115 places, 126 transitions, 1858 flow. Second operand 7 states and 147 transitions. [2025-01-09 16:39:21,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 248 transitions, 3351 flow [2025-01-09 16:39:21,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 248 transitions, 3317 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:21,253 INFO L231 Difference]: Finished difference. Result has 122 places, 134 transitions, 2083 flow [2025-01-09 16:39:21,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2083, PETRI_PLACES=122, PETRI_TRANSITIONS=134} [2025-01-09 16:39:21,253 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 87 predicate places. [2025-01-09 16:39:21,253 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 134 transitions, 2083 flow [2025-01-09 16:39:21,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:21,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:21,254 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:21,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:39:21,254 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:21,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash -71482004, now seen corresponding path program 1 times [2025-01-09 16:39:21,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:21,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691971499] [2025-01-09 16:39:21,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:21,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:21,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:39:21,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:21,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:21,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:21,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:21,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691971499] [2025-01-09 16:39:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691971499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:21,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:21,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:39:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104908685] [2025-01-09 16:39:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:21,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:39:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:21,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:39:21,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:39:21,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:21,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 134 transitions, 2083 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:21,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:21,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:23,277 INFO L124 PetriNetUnfolderBase]: 10981/16154 cut-off events. [2025-01-09 16:39:23,277 INFO L125 PetriNetUnfolderBase]: For 109866/109866 co-relation queries the response was YES. [2025-01-09 16:39:23,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66223 conditions, 16154 events. 10981/16154 cut-off events. For 109866/109866 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 95213 event pairs, 2106 based on Foata normal form. 12/16166 useless extension candidates. Maximal degree in co-relation 66173. Up to 7529 conditions per place. [2025-01-09 16:39:23,394 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 201 selfloop transitions, 42 changer transitions 1/245 dead transitions. [2025-01-09 16:39:23,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 245 transitions, 3443 flow [2025-01-09 16:39:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2025-01-09 16:39:23,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2025-01-09 16:39:23,395 INFO L175 Difference]: Start difference. First operand has 122 places, 134 transitions, 2083 flow. Second operand 7 states and 136 transitions. [2025-01-09 16:39:23,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 245 transitions, 3443 flow [2025-01-09 16:39:23,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 245 transitions, 3344 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:23,684 INFO L231 Difference]: Finished difference. Result has 130 places, 146 transitions, 2344 flow [2025-01-09 16:39:23,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2013, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2344, PETRI_PLACES=130, PETRI_TRANSITIONS=146} [2025-01-09 16:39:23,684 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 95 predicate places. [2025-01-09 16:39:23,684 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 146 transitions, 2344 flow [2025-01-09 16:39:23,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:23,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:23,684 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:23,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:39:23,685 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:23,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash -80246418, now seen corresponding path program 4 times [2025-01-09 16:39:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:23,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870786348] [2025-01-09 16:39:23,685 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:23,693 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:39:23,708 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:23,709 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:23,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:23,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:23,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870786348] [2025-01-09 16:39:23,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870786348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:23,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:23,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:39:23,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666134254] [2025-01-09 16:39:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:23,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:23,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:23,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:23,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:23,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:23,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 146 transitions, 2344 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:23,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:23,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:23,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:25,667 INFO L124 PetriNetUnfolderBase]: 11325/16723 cut-off events. [2025-01-09 16:39:25,667 INFO L125 PetriNetUnfolderBase]: For 125725/125725 co-relation queries the response was YES. [2025-01-09 16:39:25,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69385 conditions, 16723 events. 11325/16723 cut-off events. For 125725/125725 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 101864 event pairs, 3136 based on Foata normal form. 13/16736 useless extension candidates. Maximal degree in co-relation 69331. Up to 5369 conditions per place. [2025-01-09 16:39:25,801 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 210 selfloop transitions, 55 changer transitions 1/267 dead transitions. [2025-01-09 16:39:25,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 267 transitions, 3942 flow [2025-01-09 16:39:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2025-01-09 16:39:25,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2025-01-09 16:39:25,806 INFO L175 Difference]: Start difference. First operand has 130 places, 146 transitions, 2344 flow. Second operand 7 states and 146 transitions. [2025-01-09 16:39:25,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 267 transitions, 3942 flow [2025-01-09 16:39:26,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 267 transitions, 3845 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:26,083 INFO L231 Difference]: Finished difference. Result has 137 places, 149 transitions, 2488 flow [2025-01-09 16:39:26,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2488, PETRI_PLACES=137, PETRI_TRANSITIONS=149} [2025-01-09 16:39:26,086 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 102 predicate places. [2025-01-09 16:39:26,086 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 149 transitions, 2488 flow [2025-01-09 16:39:26,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:26,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:26,086 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:26,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:39:26,086 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:26,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2009517476, now seen corresponding path program 2 times [2025-01-09 16:39:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:26,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124046158] [2025-01-09 16:39:26,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:26,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:39:26,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:26,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:39:26,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:26,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:26,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124046158] [2025-01-09 16:39:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124046158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:26,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:26,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:39:26,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073202642] [2025-01-09 16:39:26,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:26,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:26,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:26,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:26,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:26,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:26,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 149 transitions, 2488 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:26,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:26,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:26,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:28,880 INFO L124 PetriNetUnfolderBase]: 17748/26171 cut-off events. [2025-01-09 16:39:28,880 INFO L125 PetriNetUnfolderBase]: For 201459/201459 co-relation queries the response was YES. [2025-01-09 16:39:29,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108796 conditions, 26171 events. 17748/26171 cut-off events. For 201459/201459 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 166924 event pairs, 2673 based on Foata normal form. 12/26183 useless extension candidates. Maximal degree in co-relation 108739. Up to 12384 conditions per place. [2025-01-09 16:39:29,268 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 257 selfloop transitions, 56 changer transitions 1/315 dead transitions. [2025-01-09 16:39:29,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 315 transitions, 5217 flow [2025-01-09 16:39:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-01-09 16:39:29,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-01-09 16:39:29,272 INFO L175 Difference]: Start difference. First operand has 137 places, 149 transitions, 2488 flow. Second operand 7 states and 135 transitions. [2025-01-09 16:39:29,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 315 transitions, 5217 flow [2025-01-09 16:39:29,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 315 transitions, 5069 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:29,867 INFO L231 Difference]: Finished difference. Result has 146 places, 185 transitions, 3284 flow [2025-01-09 16:39:29,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3284, PETRI_PLACES=146, PETRI_TRANSITIONS=185} [2025-01-09 16:39:29,867 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 111 predicate places. [2025-01-09 16:39:29,867 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 185 transitions, 3284 flow [2025-01-09 16:39:29,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:29,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:29,867 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:29,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:39:29,868 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:29,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:29,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1099333490, now seen corresponding path program 5 times [2025-01-09 16:39:29,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:29,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434138115] [2025-01-09 16:39:29,868 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:39:29,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:29,876 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-01-09 16:39:29,884 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:29,885 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:39:29,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:30,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:30,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434138115] [2025-01-09 16:39:30,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434138115] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:30,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848628056] [2025-01-09 16:39:30,144 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:39:30,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:30,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:30,145 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:39:30,146 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:39:30,211 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 3 equivalence classes. [2025-01-09 16:39:30,236 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:30,236 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:39:30,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:30,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 16:39:30,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:30,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:30,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848628056] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:30,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:39:30,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 19 [2025-01-09 16:39:30,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128765090] [2025-01-09 16:39:30,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:30,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:39:30,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:30,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:39:30,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:39:30,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:30,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 185 transitions, 3284 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:30,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:30,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:30,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:33,502 INFO L124 PetriNetUnfolderBase]: 17727/26134 cut-off events. [2025-01-09 16:39:33,503 INFO L125 PetriNetUnfolderBase]: For 232059/232059 co-relation queries the response was YES. [2025-01-09 16:39:33,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112968 conditions, 26134 events. 17727/26134 cut-off events. For 232059/232059 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 168396 event pairs, 4704 based on Foata normal form. 13/26147 useless extension candidates. Maximal degree in co-relation 112906. Up to 8900 conditions per place. [2025-01-09 16:39:33,879 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 211 selfloop transitions, 89 changer transitions 1/302 dead transitions. [2025-01-09 16:39:33,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 302 transitions, 4923 flow [2025-01-09 16:39:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-01-09 16:39:33,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-09 16:39:33,880 INFO L175 Difference]: Start difference. First operand has 146 places, 185 transitions, 3284 flow. Second operand 7 states and 147 transitions. [2025-01-09 16:39:33,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 302 transitions, 4923 flow [2025-01-09 16:39:34,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 302 transitions, 4901 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-01-09 16:39:34,465 INFO L231 Difference]: Finished difference. Result has 154 places, 187 transitions, 3490 flow [2025-01-09 16:39:34,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3264, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3490, PETRI_PLACES=154, PETRI_TRANSITIONS=187} [2025-01-09 16:39:34,465 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 119 predicate places. [2025-01-09 16:39:34,465 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 187 transitions, 3490 flow [2025-01-09 16:39:34,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:34,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:34,466 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:34,472 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:39:34,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:34,666 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:34,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1961655760, now seen corresponding path program 3 times [2025-01-09 16:39:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904716495] [2025-01-09 16:39:34,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:34,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-01-09 16:39:34,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 30 statements. [2025-01-09 16:39:34,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:39:34,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:34,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:34,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904716495] [2025-01-09 16:39:34,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904716495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:34,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:34,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:39:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853569023] [2025-01-09 16:39:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:34,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:34,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:34,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:34,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:34,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 187 transitions, 3490 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:34,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:34,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:34,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:38,945 INFO L124 PetriNetUnfolderBase]: 18155/26768 cut-off events. [2025-01-09 16:39:38,945 INFO L125 PetriNetUnfolderBase]: For 259825/259825 co-relation queries the response was YES. [2025-01-09 16:39:39,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118107 conditions, 26768 events. 18155/26768 cut-off events. For 259825/259825 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 172564 event pairs, 6038 based on Foata normal form. 12/26780 useless extension candidates. Maximal degree in co-relation 118042. Up to 13158 conditions per place. [2025-01-09 16:39:39,350 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 248 selfloop transitions, 80 changer transitions 1/330 dead transitions. [2025-01-09 16:39:39,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 330 transitions, 5810 flow [2025-01-09 16:39:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2025-01-09 16:39:39,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5753968253968254 [2025-01-09 16:39:39,351 INFO L175 Difference]: Start difference. First operand has 154 places, 187 transitions, 3490 flow. Second operand 7 states and 145 transitions. [2025-01-09 16:39:39,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 330 transitions, 5810 flow [2025-01-09 16:39:39,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 330 transitions, 5600 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-09 16:39:39,998 INFO L231 Difference]: Finished difference. Result has 161 places, 210 transitions, 4098 flow [2025-01-09 16:39:39,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3335, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4098, PETRI_PLACES=161, PETRI_TRANSITIONS=210} [2025-01-09 16:39:39,999 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 126 predicate places. [2025-01-09 16:39:39,999 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 210 transitions, 4098 flow [2025-01-09 16:39:39,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:39,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:39,999 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:39,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:39:39,999 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:39,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash -162202718, now seen corresponding path program 6 times [2025-01-09 16:39:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041414010] [2025-01-09 16:39:40,000 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:39:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:40,007 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 3 equivalence classes. [2025-01-09 16:39:40,019 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:40,019 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-09 16:39:40,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:40,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:40,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041414010] [2025-01-09 16:39:40,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041414010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:40,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:40,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:39:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723466000] [2025-01-09 16:39:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:40,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:39:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:40,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:39:40,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:39:40,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:40,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 210 transitions, 4098 flow. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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:40,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:40,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:40,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:44,016 INFO L124 PetriNetUnfolderBase]: 18856/27921 cut-off events. [2025-01-09 16:39:44,017 INFO L125 PetriNetUnfolderBase]: For 276326/276326 co-relation queries the response was YES. [2025-01-09 16:39:44,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125219 conditions, 27921 events. 18856/27921 cut-off events. For 276326/276326 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 182662 event pairs, 4429 based on Foata normal form. 13/27934 useless extension candidates. Maximal degree in co-relation 125149. Up to 8900 conditions per place. [2025-01-09 16:39:44,499 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 260 selfloop transitions, 81 changer transitions 1/343 dead transitions. [2025-01-09 16:39:44,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 343 transitions, 6196 flow [2025-01-09 16:39:44,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2025-01-09 16:39:44,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-01-09 16:39:44,500 INFO L175 Difference]: Start difference. First operand has 161 places, 210 transitions, 4098 flow. Second operand 7 states and 142 transitions. [2025-01-09 16:39:44,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 343 transitions, 6196 flow [2025-01-09 16:39:45,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 343 transitions, 6041 flow, removed 57 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:45,723 INFO L231 Difference]: Finished difference. Result has 169 places, 213 transitions, 4241 flow [2025-01-09 16:39:45,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3965, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4241, PETRI_PLACES=169, PETRI_TRANSITIONS=213} [2025-01-09 16:39:45,723 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 134 predicate places. [2025-01-09 16:39:45,723 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 213 transitions, 4241 flow [2025-01-09 16:39:45,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 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:45,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:45,723 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:45,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:39:45,724 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:45,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 7046698, now seen corresponding path program 7 times [2025-01-09 16:39:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:45,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726264524] [2025-01-09 16:39:45,724 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:39:45,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:45,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:39:45,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:45,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:45,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:45,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726264524] [2025-01-09 16:39:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726264524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:45,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:45,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:39:45,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112030957] [2025-01-09 16:39:45,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:45,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:39:45,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:45,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:39:45,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:39:45,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:45,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 213 transitions, 4241 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:45,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:45,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:45,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:49,773 INFO L124 PetriNetUnfolderBase]: 20092/29853 cut-off events. [2025-01-09 16:39:49,774 INFO L125 PetriNetUnfolderBase]: For 310459/310459 co-relation queries the response was YES. [2025-01-09 16:39:50,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134692 conditions, 29853 events. 20092/29853 cut-off events. For 310459/310459 co-relation queries the response was YES. Maximal size of possible extension queue 1200. Compared 198550 event pairs, 5487 based on Foata normal form. 8/29861 useless extension candidates. Maximal degree in co-relation 134619. Up to 12207 conditions per place. [2025-01-09 16:39:50,095 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 228 selfloop transitions, 108 changer transitions 1/338 dead transitions. [2025-01-09 16:39:50,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 338 transitions, 6221 flow [2025-01-09 16:39:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2025-01-09 16:39:50,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-09 16:39:50,096 INFO L175 Difference]: Start difference. First operand has 169 places, 213 transitions, 4241 flow. Second operand 7 states and 144 transitions. [2025-01-09 16:39:50,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 338 transitions, 6221 flow [2025-01-09 16:39:51,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 338 transitions, 6106 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-01-09 16:39:51,156 INFO L231 Difference]: Finished difference. Result has 176 places, 241 transitions, 5145 flow [2025-01-09 16:39:51,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4141, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5145, PETRI_PLACES=176, PETRI_TRANSITIONS=241} [2025-01-09 16:39:51,157 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 141 predicate places. [2025-01-09 16:39:51,157 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 241 transitions, 5145 flow [2025-01-09 16:39:51,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:51,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:51,157 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:51,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:39:51,157 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:51,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1451952910, now seen corresponding path program 4 times [2025-01-09 16:39:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:51,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455318203] [2025-01-09 16:39:51,158 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:51,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:51,164 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:39:51,180 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:51,180 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:51,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455318203] [2025-01-09 16:39:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455318203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:51,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:51,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:39:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953615481] [2025-01-09 16:39:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:51,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:39:51,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:51,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:39:51,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:39:51,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:51,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 241 transitions, 5145 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:51,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:51,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:51,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:55,923 INFO L124 PetriNetUnfolderBase]: 20604/30626 cut-off events. [2025-01-09 16:39:55,923 INFO L125 PetriNetUnfolderBase]: For 352105/352105 co-relation queries the response was YES. [2025-01-09 16:39:56,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142400 conditions, 30626 events. 20604/30626 cut-off events. For 352105/352105 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 204764 event pairs, 7566 based on Foata normal form. 12/30638 useless extension candidates. Maximal degree in co-relation 142324. Up to 18358 conditions per place. [2025-01-09 16:39:56,493 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 214 selfloop transitions, 118 changer transitions 1/334 dead transitions. [2025-01-09 16:39:56,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 334 transitions, 6493 flow [2025-01-09 16:39:56,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2025-01-09 16:39:56,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-09 16:39:56,494 INFO L175 Difference]: Start difference. First operand has 176 places, 241 transitions, 5145 flow. Second operand 7 states and 144 transitions. [2025-01-09 16:39:56,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 334 transitions, 6493 flow [2025-01-09 16:39:57,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 334 transitions, 6391 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:57,756 INFO L231 Difference]: Finished difference. Result has 182 places, 247 transitions, 5451 flow [2025-01-09 16:39:57,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=5044, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5451, PETRI_PLACES=182, PETRI_TRANSITIONS=247} [2025-01-09 16:39:57,756 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 147 predicate places. [2025-01-09 16:39:57,756 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 247 transitions, 5451 flow [2025-01-09 16:39:57,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:57,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:57,757 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:57,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:39:57,757 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:39:57,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:57,757 INFO L85 PathProgramCache]: Analyzing trace with hash -953529180, now seen corresponding path program 8 times [2025-01-09 16:39:57,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:57,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703383947] [2025-01-09 16:39:57,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:57,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:57,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:39:57,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:39:57,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:39:57,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 16:39:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703383947] [2025-01-09 16:39:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703383947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:39:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315880739] [2025-01-09 16:39:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:57,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:57,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:57,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:57,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:57,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2025-01-09 16:39:57,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 247 transitions, 5451 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:57,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:57,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2025-01-09 16:39:57,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand