./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:25:32,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:25:32,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:25:32,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:25:32,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:25:32,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:25:32,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:25:32,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:25:32,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:25:32,555 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:25:32,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:25:32,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:25:32,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:25:32,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:25:32,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:25:32,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:25:32,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:25:32,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:25:32,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:25:32,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:25:32,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:25:32,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:25:32,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:25:32,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:25:32,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:25:32,557 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d [2025-03-04 02:25:32,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:25:32,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:25:32,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:25:32,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:25:32,774 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:25:32,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-04 02:25:33,890 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f40b0a0/cfdae78ff91a49d2b4387a84a1fdcc46/FLAG763900710 [2025-03-04 02:25:34,111 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:25:34,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-04 02:25:34,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f40b0a0/cfdae78ff91a49d2b4387a84a1fdcc46/FLAG763900710 [2025-03-04 02:25:34,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f40b0a0/cfdae78ff91a49d2b4387a84a1fdcc46 [2025-03-04 02:25:34,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:25:34,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:25:34,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:25:34,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:25:34,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:25:34,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646f0e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34, skipping insertion in model container [2025-03-04 02:25:34,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:25:34,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c[2896,2909] [2025-03-04 02:25:34,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:25:34,641 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:25:34,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c[2896,2909] [2025-03-04 02:25:34,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:25:34,672 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:25:34,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34 WrapperNode [2025-03-04 02:25:34,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:25:34,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:25:34,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:25:34,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:25:34,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,707 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2025-03-04 02:25:34,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:25:34,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:25:34,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:25:34,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:25:34,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,724 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-03-04 02:25:34,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:25:34,733 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:25:34,733 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:25:34,733 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:25:34,733 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (1/1) ... [2025-03-04 02:25:34,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:25:34,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:34,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:25:34,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:25:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:25:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:25:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:25:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:25:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:25:34,777 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:25:34,852 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:25:34,854 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:25:35,069 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:25:35,069 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:25:35,233 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:25:35,233 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:25:35,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:25:35 BoogieIcfgContainer [2025-03-04 02:25:35,234 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:25:35,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:25:35,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:25:35,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:25:35,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:25:34" (1/3) ... [2025-03-04 02:25:35,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efa26bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:25:35, skipping insertion in model container [2025-03-04 02:25:35,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:25:34" (2/3) ... [2025-03-04 02:25:35,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efa26bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:25:35, skipping insertion in model container [2025-03-04 02:25:35,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:25:35" (3/3) ... [2025-03-04 02:25:35,241 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2025-03-04 02:25:35,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:25:35,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-2-nl.wvr.c that has 3 procedures, 25 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-04 02:25:35,255 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:25:35,298 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:25:35,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-03-04 02:25:35,350 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-04 02:25:35,354 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:25:35,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-04 02:25:35,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-03-04 02:25:35,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 62 flow [2025-03-04 02:25:35,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:25:35,378 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;@2dcb317d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:25:35,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:25:35,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:25:35,408 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-04 02:25:35,408 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:25:35,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:35,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:35,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:35,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash 750824110, now seen corresponding path program 1 times [2025-03-04 02:25:35,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:35,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186079874] [2025-03-04 02:25:35,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:35,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:35,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 02:25:35,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 02:25:35,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:35,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:35,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:35,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186079874] [2025-03-04 02:25:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186079874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:35,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:35,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:25:35,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465764591] [2025-03-04 02:25:35,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:35,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:25:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:35,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:25:35,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:25:35,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-04 02:25:35,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:35,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:35,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-04 02:25:35,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:35,689 INFO L124 PetriNetUnfolderBase]: 108/203 cut-off events. [2025-03-04 02:25:35,689 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 02:25:35,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 203 events. 108/203 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 623 event pairs, 83 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 361. Up to 178 conditions per place. [2025-03-04 02:25:35,694 INFO L140 encePairwiseOnDemand]: 27/28 looper letters, 20 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2025-03-04 02:25:35,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 24 transitions, 100 flow [2025-03-04 02:25:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:25:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:25:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2025-03-04 02:25:35,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-03-04 02:25:35,704 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 2 states and 33 transitions. [2025-03-04 02:25:35,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 24 transitions, 100 flow [2025-03-04 02:25:35,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:25:35,709 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 52 flow [2025-03-04 02:25:35,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2025-03-04 02:25:35,714 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-03-04 02:25:35,714 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 52 flow [2025-03-04 02:25:35,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:35,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:35,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:35,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:25:35,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:35,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 733356482, now seen corresponding path program 1 times [2025-03-04 02:25:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634070748] [2025-03-04 02:25:35,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:35,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 02:25:35,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 02:25:35,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:35,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:35,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:35,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634070748] [2025-03-04 02:25:35,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634070748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:35,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:35,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:25:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392280476] [2025-03-04 02:25:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:35,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:25:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:35,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:25:35,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:25:35,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-04 02:25:35,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:35,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:35,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-04 02:25:35,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:35,997 INFO L124 PetriNetUnfolderBase]: 121/237 cut-off events. [2025-03-04 02:25:35,998 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:25:35,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 237 events. 121/237 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 776 event pairs, 96 based on Foata normal form. 17/239 useless extension candidates. Maximal degree in co-relation 458. Up to 178 conditions per place. [2025-03-04 02:25:35,999 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 19 selfloop transitions, 2 changer transitions 8/33 dead transitions. [2025-03-04 02:25:35,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 130 flow [2025-03-04 02:25:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:25:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:25:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-03-04 02:25:36,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 02:25:36,001 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 52 flow. Second operand 4 states and 56 transitions. [2025-03-04 02:25:36,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 130 flow [2025-03-04 02:25:36,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:25:36,002 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 70 flow [2025-03-04 02:25:36,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2025-03-04 02:25:36,003 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-03-04 02:25:36,003 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 70 flow [2025-03-04 02:25:36,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:36,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:36,003 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] [2025-03-04 02:25:36,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:25:36,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:36,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:36,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1559089454, now seen corresponding path program 1 times [2025-03-04 02:25:36,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:36,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280725474] [2025-03-04 02:25:36,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:36,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:36,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:25:36,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:25:36,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:36,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:36,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:36,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280725474] [2025-03-04 02:25:36,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280725474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:36,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:36,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:36,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266738435] [2025-03-04 02:25:36,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:36,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:25:36,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:36,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:25:36,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:25:36,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:25:36,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 70 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:36,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:36,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:25:36,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:36,757 INFO L124 PetriNetUnfolderBase]: 205/380 cut-off events. [2025-03-04 02:25:36,758 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-04 02:25:36,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 380 events. 205/380 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1485 event pairs, 5 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 824. Up to 227 conditions per place. [2025-03-04 02:25:36,760 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 44 selfloop transitions, 14 changer transitions 5/66 dead transitions. [2025-03-04 02:25:36,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 66 transitions, 303 flow [2025-03-04 02:25:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:25:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:25:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-03-04 02:25:36,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2025-03-04 02:25:36,762 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 70 flow. Second operand 10 states and 113 transitions. [2025-03-04 02:25:36,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 66 transitions, 303 flow [2025-03-04 02:25:36,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 299 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:36,765 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 151 flow [2025-03-04 02:25:36,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-04 02:25:36,765 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 14 predicate places. [2025-03-04 02:25:36,765 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 151 flow [2025-03-04 02:25:36,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:36,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:36,765 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] [2025-03-04 02:25:36,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:25:36,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:36,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1018964508, now seen corresponding path program 2 times [2025-03-04 02:25:36,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:36,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672251053] [2025-03-04 02:25:36,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:36,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:36,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:25:36,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-04 02:25:36,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:25:36,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:36,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672251053] [2025-03-04 02:25:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672251053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:36,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:36,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:25:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140863992] [2025-03-04 02:25:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:36,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:25:36,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:36,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:25:36,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:25:36,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-04 02:25:36,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 151 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-03-04 02:25:36,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:36,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-04 02:25:36,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:36,854 INFO L124 PetriNetUnfolderBase]: 148/289 cut-off events. [2025-03-04 02:25:36,854 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-03-04 02:25:36,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 289 events. 148/289 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1049 event pairs, 31 based on Foata normal form. 8/296 useless extension candidates. Maximal degree in co-relation 803. Up to 221 conditions per place. [2025-03-04 02:25:36,857 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 35 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-03-04 02:25:36,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 242 flow [2025-03-04 02:25:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:25:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:25:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-03-04 02:25:36,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-03-04 02:25:36,858 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 151 flow. Second operand 3 states and 46 transitions. [2025-03-04 02:25:36,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 242 flow [2025-03-04 02:25:36,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 232 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 02:25:36,859 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 155 flow [2025-03-04 02:25:36,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-03-04 02:25:36,860 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-03-04 02:25:36,860 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 155 flow [2025-03-04 02:25:36,860 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-03-04 02:25:36,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:36,860 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] [2025-03-04 02:25:36,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:25:36,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:36,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:36,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2007233324, now seen corresponding path program 3 times [2025-03-04 02:25:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:36,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153612751] [2025-03-04 02:25:36,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:36,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:36,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:25:36,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-04 02:25:36,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:25:36,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:37,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:37,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153612751] [2025-03-04 02:25:37,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153612751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:37,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:37,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083578497] [2025-03-04 02:25:37,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:37,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:25:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:37,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:25:37,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:25:37,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:25:37,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 155 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:37,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:37,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:25:37,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:37,431 INFO L124 PetriNetUnfolderBase]: 190/369 cut-off events. [2025-03-04 02:25:37,431 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2025-03-04 02:25:37,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 369 events. 190/369 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1454 event pairs, 25 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 1115. Up to 223 conditions per place. [2025-03-04 02:25:37,434 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 44 selfloop transitions, 18 changer transitions 5/70 dead transitions. [2025-03-04 02:25:37,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 431 flow [2025-03-04 02:25:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:25:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:25:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-03-04 02:25:37,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 02:25:37,435 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 155 flow. Second operand 10 states and 112 transitions. [2025-03-04 02:25:37,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 431 flow [2025-03-04 02:25:37,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 400 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:37,440 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 237 flow [2025-03-04 02:25:37,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-03-04 02:25:37,441 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 23 predicate places. [2025-03-04 02:25:37,442 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 237 flow [2025-03-04 02:25:37,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:37,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:37,442 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] [2025-03-04 02:25:37,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:25:37,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:37,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash -282080118, now seen corresponding path program 4 times [2025-03-04 02:25:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:37,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664891701] [2025-03-04 02:25:37,444 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:37,454 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:25:37,472 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:25:37,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:37,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:37,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664891701] [2025-03-04 02:25:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664891701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:37,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:37,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:37,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587723036] [2025-03-04 02:25:37,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:37,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:25:37,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:37,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:25:37,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:25:37,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:25:37,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 237 flow. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:37,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:37,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:25:37,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:38,046 INFO L124 PetriNetUnfolderBase]: 225/427 cut-off events. [2025-03-04 02:25:38,046 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-03-04 02:25:38,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 427 events. 225/427 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1702 event pairs, 34 based on Foata normal form. 1/428 useless extension candidates. Maximal degree in co-relation 1358. Up to 270 conditions per place. [2025-03-04 02:25:38,050 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 52 selfloop transitions, 22 changer transitions 5/81 dead transitions. [2025-03-04 02:25:38,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 550 flow [2025-03-04 02:25:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:25:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:25:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2025-03-04 02:25:38,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-04 02:25:38,052 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 237 flow. Second operand 10 states and 110 transitions. [2025-03-04 02:25:38,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 550 flow [2025-03-04 02:25:38,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 515 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 02:25:38,055 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 339 flow [2025-03-04 02:25:38,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=339, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2025-03-04 02:25:38,056 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 32 predicate places. [2025-03-04 02:25:38,056 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 339 flow [2025-03-04 02:25:38,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:38,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:38,056 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] [2025-03-04 02:25:38,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:25:38,057 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:38,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash 500416654, now seen corresponding path program 5 times [2025-03-04 02:25:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:38,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041756590] [2025-03-04 02:25:38,057 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:38,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:38,065 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:25:38,074 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:25:38,074 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:38,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:38,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:38,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041756590] [2025-03-04 02:25:38,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041756590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:38,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:38,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:38,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901363440] [2025-03-04 02:25:38,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:38,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:25:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:38,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:25:38,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:25:38,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:25:38,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 339 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:38,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:38,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:25:38,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:38,566 INFO L124 PetriNetUnfolderBase]: 206/417 cut-off events. [2025-03-04 02:25:38,566 INFO L125 PetriNetUnfolderBase]: For 807/807 co-relation queries the response was YES. [2025-03-04 02:25:38,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 417 events. 206/417 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1784 event pairs, 15 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 1474. Up to 223 conditions per place. [2025-03-04 02:25:38,569 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 50 selfloop transitions, 27 changer transitions 5/85 dead transitions. [2025-03-04 02:25:38,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 644 flow [2025-03-04 02:25:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:25:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:25:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2025-03-04 02:25:38,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3961038961038961 [2025-03-04 02:25:38,570 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 339 flow. Second operand 11 states and 122 transitions. [2025-03-04 02:25:38,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 644 flow [2025-03-04 02:25:38,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 630 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-04 02:25:38,573 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 429 flow [2025-03-04 02:25:38,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=429, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2025-03-04 02:25:38,574 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 44 predicate places. [2025-03-04 02:25:38,574 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 429 flow [2025-03-04 02:25:38,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:38,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:38,574 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] [2025-03-04 02:25:38,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:25:38,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:38,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash -655015518, now seen corresponding path program 6 times [2025-03-04 02:25:38,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:38,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623849527] [2025-03-04 02:25:38,575 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:25:38,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:38,580 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:25:38,587 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-04 02:25:38,587 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:25:38,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:38,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623849527] [2025-03-04 02:25:38,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623849527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:38,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654939354] [2025-03-04 02:25:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:38,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:25:38,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:38,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:25:38,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:25:38,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:25:38,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 429 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:38,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:38,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:25:38,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:39,077 INFO L124 PetriNetUnfolderBase]: 218/449 cut-off events. [2025-03-04 02:25:39,078 INFO L125 PetriNetUnfolderBase]: For 1430/1430 co-relation queries the response was YES. [2025-03-04 02:25:39,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 449 events. 218/449 cut-off events. For 1430/1430 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2011 event pairs, 22 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 1726. Up to 287 conditions per place. [2025-03-04 02:25:39,080 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 55 selfloop transitions, 23 changer transitions 5/86 dead transitions. [2025-03-04 02:25:39,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 86 transitions, 734 flow [2025-03-04 02:25:39,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:25:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:25:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-03-04 02:25:39,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2025-03-04 02:25:39,082 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 429 flow. Second operand 10 states and 114 transitions. [2025-03-04 02:25:39,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 86 transitions, 734 flow [2025-03-04 02:25:39,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 656 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-04 02:25:39,085 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 452 flow [2025-03-04 02:25:39,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=452, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2025-03-04 02:25:39,086 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 48 predicate places. [2025-03-04 02:25:39,086 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 452 flow [2025-03-04 02:25:39,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:39,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:39,086 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] [2025-03-04 02:25:39,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:25:39,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:39,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:39,087 INFO L85 PathProgramCache]: Analyzing trace with hash 314086886, now seen corresponding path program 7 times [2025-03-04 02:25:39,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:39,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175301374] [2025-03-04 02:25:39,087 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:25:39,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:39,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:25:39,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:25:39,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:39,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:39,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:39,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175301374] [2025-03-04 02:25:39,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175301374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:39,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:39,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:39,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397264639] [2025-03-04 02:25:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:39,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:25:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:39,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:25:39,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:25:39,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:25:39,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 452 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:39,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:39,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:25:39,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:39,480 INFO L124 PetriNetUnfolderBase]: 214/436 cut-off events. [2025-03-04 02:25:39,480 INFO L125 PetriNetUnfolderBase]: For 1521/1521 co-relation queries the response was YES. [2025-03-04 02:25:39,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1756 conditions, 436 events. 214/436 cut-off events. For 1521/1521 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1925 event pairs, 22 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 1732. Up to 291 conditions per place. [2025-03-04 02:25:39,483 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 49 selfloop transitions, 22 changer transitions 8/82 dead transitions. [2025-03-04 02:25:39,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 713 flow [2025-03-04 02:25:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:25:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:25:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2025-03-04 02:25:39,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3892857142857143 [2025-03-04 02:25:39,485 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 452 flow. Second operand 10 states and 109 transitions. [2025-03-04 02:25:39,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 713 flow [2025-03-04 02:25:39,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 82 transitions, 656 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-04 02:25:39,490 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 448 flow [2025-03-04 02:25:39,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=448, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2025-03-04 02:25:39,490 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 51 predicate places. [2025-03-04 02:25:39,491 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 448 flow [2025-03-04 02:25:39,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:39,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:39,491 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] [2025-03-04 02:25:39,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:25:39,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:39,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash 80856994, now seen corresponding path program 8 times [2025-03-04 02:25:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963598902] [2025-03-04 02:25:39,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:39,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:25:39,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-04 02:25:39,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:25:39,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:39,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:39,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963598902] [2025-03-04 02:25:39,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963598902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:39,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:39,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:39,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330456594] [2025-03-04 02:25:39,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:39,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:25:39,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:39,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:25:39,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:25:39,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:25:39,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 448 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:39,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:39,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:25:39,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:39,944 INFO L124 PetriNetUnfolderBase]: 223/461 cut-off events. [2025-03-04 02:25:39,944 INFO L125 PetriNetUnfolderBase]: For 1710/1718 co-relation queries the response was YES. [2025-03-04 02:25:39,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 461 events. 223/461 cut-off events. For 1710/1718 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2083 event pairs, 35 based on Foata normal form. 3/464 useless extension candidates. Maximal degree in co-relation 1827. Up to 297 conditions per place. [2025-03-04 02:25:39,948 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 58 selfloop transitions, 23 changer transitions 5/89 dead transitions. [2025-03-04 02:25:39,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 788 flow [2025-03-04 02:25:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:25:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:25:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2025-03-04 02:25:39,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2025-03-04 02:25:39,949 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 448 flow. Second operand 10 states and 116 transitions. [2025-03-04 02:25:39,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 788 flow [2025-03-04 02:25:39,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 89 transitions, 734 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-04 02:25:39,957 INFO L231 Difference]: Finished difference. Result has 81 places, 62 transitions, 491 flow [2025-03-04 02:25:39,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=491, PETRI_PLACES=81, PETRI_TRANSITIONS=62} [2025-03-04 02:25:39,960 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 53 predicate places. [2025-03-04 02:25:39,960 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 62 transitions, 491 flow [2025-03-04 02:25:39,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:39,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:39,960 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] [2025-03-04 02:25:39,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:25:39,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:39,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash 847976418, now seen corresponding path program 9 times [2025-03-04 02:25:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:39,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426052431] [2025-03-04 02:25:39,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:39,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:25:39,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-03-04 02:25:39,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:25:39,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:40,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426052431] [2025-03-04 02:25:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426052431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:40,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:40,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:40,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113639131] [2025-03-04 02:25:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:40,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:25:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:40,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:25:40,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:25:40,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:25:40,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 62 transitions, 491 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:40,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:40,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:25:40,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:40,345 INFO L124 PetriNetUnfolderBase]: 219/448 cut-off events. [2025-03-04 02:25:40,346 INFO L125 PetriNetUnfolderBase]: For 2218/2226 co-relation queries the response was YES. [2025-03-04 02:25:40,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 448 events. 219/448 cut-off events. For 2218/2226 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2008 event pairs, 35 based on Foata normal form. 3/451 useless extension candidates. Maximal degree in co-relation 1891. Up to 301 conditions per place. [2025-03-04 02:25:40,349 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 52 selfloop transitions, 22 changer transitions 8/85 dead transitions. [2025-03-04 02:25:40,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 793 flow [2025-03-04 02:25:40,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:25:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:25:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2025-03-04 02:25:40,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3964285714285714 [2025-03-04 02:25:40,350 INFO L175 Difference]: Start difference. First operand has 81 places, 62 transitions, 491 flow. Second operand 10 states and 111 transitions. [2025-03-04 02:25:40,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 793 flow [2025-03-04 02:25:40,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 85 transitions, 726 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-04 02:25:40,355 INFO L231 Difference]: Finished difference. Result has 84 places, 62 transitions, 479 flow [2025-03-04 02:25:40,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=479, PETRI_PLACES=84, PETRI_TRANSITIONS=62} [2025-03-04 02:25:40,356 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 56 predicate places. [2025-03-04 02:25:40,356 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 62 transitions, 479 flow [2025-03-04 02:25:40,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:40,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:40,356 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] [2025-03-04 02:25:40,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:25:40,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:40,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1418424208, now seen corresponding path program 10 times [2025-03-04 02:25:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:40,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196896039] [2025-03-04 02:25:40,357 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:25:40,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:40,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:25:40,370 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:25:40,371 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:25:40,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:40,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:40,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196896039] [2025-03-04 02:25:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196896039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:40,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:40,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:40,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131437756] [2025-03-04 02:25:40,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:40,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:25:40,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:40,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:25:40,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:25:40,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:25:40,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 62 transitions, 479 flow. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:40,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:40,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:25:40,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:40,790 INFO L124 PetriNetUnfolderBase]: 260/516 cut-off events. [2025-03-04 02:25:40,790 INFO L125 PetriNetUnfolderBase]: For 2645/2645 co-relation queries the response was YES. [2025-03-04 02:25:40,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 516 events. 260/516 cut-off events. For 2645/2645 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2261 event pairs, 49 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 2159. Up to 339 conditions per place. [2025-03-04 02:25:40,794 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 67 selfloop transitions, 23 changer transitions 5/97 dead transitions. [2025-03-04 02:25:40,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 97 transitions, 877 flow [2025-03-04 02:25:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:25:40,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:25:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-03-04 02:25:40,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2025-03-04 02:25:40,797 INFO L175 Difference]: Start difference. First operand has 84 places, 62 transitions, 479 flow. Second operand 10 states and 114 transitions. [2025-03-04 02:25:40,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 97 transitions, 877 flow [2025-03-04 02:25:40,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 97 transitions, 821 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 02:25:40,803 INFO L231 Difference]: Finished difference. Result has 87 places, 66 transitions, 546 flow [2025-03-04 02:25:40,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=546, PETRI_PLACES=87, PETRI_TRANSITIONS=66} [2025-03-04 02:25:40,804 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 59 predicate places. [2025-03-04 02:25:40,804 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 66 transitions, 546 flow [2025-03-04 02:25:40,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:40,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:40,804 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] [2025-03-04 02:25:40,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:25:40,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:40,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:40,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2109423664, now seen corresponding path program 11 times [2025-03-04 02:25:40,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:40,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629029481] [2025-03-04 02:25:40,805 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:25:40,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:40,809 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 02:25:40,814 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:25:40,814 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:40,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:41,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:41,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629029481] [2025-03-04 02:25:41,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629029481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:41,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:41,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:25:41,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038736594] [2025-03-04 02:25:41,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:41,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:25:41,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:41,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:25:41,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:25:41,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-03-04 02:25:41,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 66 transitions, 546 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:41,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:41,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-03-04 02:25:41,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:41,229 INFO L124 PetriNetUnfolderBase]: 229/465 cut-off events. [2025-03-04 02:25:41,229 INFO L125 PetriNetUnfolderBase]: For 3200/3208 co-relation queries the response was YES. [2025-03-04 02:25:41,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 465 events. 229/465 cut-off events. For 3200/3208 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2041 event pairs, 30 based on Foata normal form. 3/467 useless extension candidates. Maximal degree in co-relation 2086. Up to 316 conditions per place. [2025-03-04 02:25:41,233 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 56 selfloop transitions, 21 changer transitions 8/88 dead transitions. [2025-03-04 02:25:41,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 857 flow [2025-03-04 02:25:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:25:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:25:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-03-04 02:25:41,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 02:25:41,235 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 546 flow. Second operand 10 states and 112 transitions. [2025-03-04 02:25:41,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 857 flow [2025-03-04 02:25:41,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 780 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-03-04 02:25:41,242 INFO L231 Difference]: Finished difference. Result has 91 places, 66 transitions, 524 flow [2025-03-04 02:25:41,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=524, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2025-03-04 02:25:41,243 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 63 predicate places. [2025-03-04 02:25:41,243 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 524 flow [2025-03-04 02:25:41,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:41,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:41,243 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:41,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:25:41,243 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:41,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1237710065, now seen corresponding path program 1 times [2025-03-04 02:25:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:41,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011053670] [2025-03-04 02:25:41,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:41,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:25:41,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:25:41,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:41,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:41,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011053670] [2025-03-04 02:25:41,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011053670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:41,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328528737] [2025-03-04 02:25:41,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:41,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:41,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:41,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:25:41,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:25:41,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:25:41,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:41,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:41,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:25:41,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:41,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:25:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328528737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:41,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:25:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-04 02:25:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213541504] [2025-03-04 02:25:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:41,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:25:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:41,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:25:41,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:25:41,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-04 02:25:41,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 66 transitions, 524 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:41,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:41,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-04 02:25:41,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:41,515 INFO L124 PetriNetUnfolderBase]: 281/615 cut-off events. [2025-03-04 02:25:41,516 INFO L125 PetriNetUnfolderBase]: For 5498/5616 co-relation queries the response was YES. [2025-03-04 02:25:41,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2707 conditions, 615 events. 281/615 cut-off events. For 5498/5616 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3049 event pairs, 68 based on Foata normal form. 40/654 useless extension candidates. Maximal degree in co-relation 2675. Up to 205 conditions per place. [2025-03-04 02:25:41,519 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 54 selfloop transitions, 7 changer transitions 24/89 dead transitions. [2025-03-04 02:25:41,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 89 transitions, 845 flow [2025-03-04 02:25:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:25:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:25:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-03-04 02:25:41,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2025-03-04 02:25:41,520 INFO L175 Difference]: Start difference. First operand has 91 places, 66 transitions, 524 flow. Second operand 4 states and 74 transitions. [2025-03-04 02:25:41,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 89 transitions, 845 flow [2025-03-04 02:25:41,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 89 transitions, 772 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-03-04 02:25:41,528 INFO L231 Difference]: Finished difference. Result has 82 places, 39 transitions, 290 flow [2025-03-04 02:25:41,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=82, PETRI_TRANSITIONS=39} [2025-03-04 02:25:41,529 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 54 predicate places. [2025-03-04 02:25:41,529 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 39 transitions, 290 flow [2025-03-04 02:25:41,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:41,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:41,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:41,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:25:41,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 02:25:41,736 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:41,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1277056949, now seen corresponding path program 1 times [2025-03-04 02:25:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:41,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541568663] [2025-03-04 02:25:41,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:41,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:25:41,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:25:41,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:41,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:41,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541568663] [2025-03-04 02:25:41,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541568663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:41,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157598561] [2025-03-04 02:25:41,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:41,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:41,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:41,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:41,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:25:41,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:25:41,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:25:41,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:41,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:41,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:25:41,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:41,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:41,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157598561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:41,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:41,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 02:25:41,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459560803] [2025-03-04 02:25:41,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:41,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:25:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:41,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:25:41,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:25:41,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-03-04 02:25:41,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 39 transitions, 290 flow. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:41,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:41,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-03-04 02:25:41,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:42,127 INFO L124 PetriNetUnfolderBase]: 281/588 cut-off events. [2025-03-04 02:25:42,128 INFO L125 PetriNetUnfolderBase]: For 5231/5352 co-relation queries the response was YES. [2025-03-04 02:25:42,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 588 events. 281/588 cut-off events. For 5231/5352 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2635 event pairs, 173 based on Foata normal form. 24/611 useless extension candidates. Maximal degree in co-relation 2629. Up to 396 conditions per place. [2025-03-04 02:25:42,131 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 3 changer transitions 25/65 dead transitions. [2025-03-04 02:25:42,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 593 flow [2025-03-04 02:25:42,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:25:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:25:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2025-03-04 02:25:42,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-04 02:25:42,132 INFO L175 Difference]: Start difference. First operand has 82 places, 39 transitions, 290 flow. Second operand 6 states and 77 transitions. [2025-03-04 02:25:42,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 593 flow [2025-03-04 02:25:42,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 468 flow, removed 51 selfloop flow, removed 18 redundant places. [2025-03-04 02:25:42,137 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 232 flow [2025-03-04 02:25:42,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2025-03-04 02:25:42,137 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 25 predicate places. [2025-03-04 02:25:42,137 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 232 flow [2025-03-04 02:25:42,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:42,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:42,137 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:42,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:42,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 02:25:42,342 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:42,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2064889113, now seen corresponding path program 2 times [2025-03-04 02:25:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:42,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583163493] [2025-03-04 02:25:42,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:42,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:25:42,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-03-04 02:25:42,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:25:42,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583163493] [2025-03-04 02:25:42,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583163493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:25:42,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:25:42,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:25:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756889112] [2025-03-04 02:25:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:25:42,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:25:42,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:42,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:25:42,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:25:42,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-03-04 02:25:42,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:42,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:42,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-03-04 02:25:42,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:42,523 INFO L124 PetriNetUnfolderBase]: 408/735 cut-off events. [2025-03-04 02:25:42,523 INFO L125 PetriNetUnfolderBase]: For 970/970 co-relation queries the response was YES. [2025-03-04 02:25:42,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 735 events. 408/735 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2837 event pairs, 64 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 2320. Up to 320 conditions per place. [2025-03-04 02:25:42,527 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 60 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2025-03-04 02:25:42,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 532 flow [2025-03-04 02:25:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:25:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:25:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-03-04 02:25:42,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2025-03-04 02:25:42,529 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 232 flow. Second operand 6 states and 69 transitions. [2025-03-04 02:25:42,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 532 flow [2025-03-04 02:25:42,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 502 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-03-04 02:25:42,532 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 263 flow [2025-03-04 02:25:42,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2025-03-04 02:25:42,532 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 26 predicate places. [2025-03-04 02:25:42,532 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 263 flow [2025-03-04 02:25:42,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:42,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:42,533 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:42,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:25:42,534 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:42,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash -561088610, now seen corresponding path program 1 times [2025-03-04 02:25:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:42,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132615312] [2025-03-04 02:25:42,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:42,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:25:42,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:25:42,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:42,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:43,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:43,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132615312] [2025-03-04 02:25:43,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132615312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:43,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809733170] [2025-03-04 02:25:43,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:25:43,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:43,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:43,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:43,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:25:43,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:25:43,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:25:43,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:25:43,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:43,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:25:43,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:25:44,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:44,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:44,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2025-03-04 02:25:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:25:44,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809733170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:44,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:44,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 13] total 44 [2025-03-04 02:25:44,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707951873] [2025-03-04 02:25:44,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:44,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 02:25:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:44,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 02:25:44,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1836, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 02:25:44,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:25:44,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 263 flow. Second operand has 45 states, 45 states have (on average 4.711111111111111) internal successors, (212), 45 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:44,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:44,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:25:44,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:46,528 INFO L124 PetriNetUnfolderBase]: 763/1349 cut-off events. [2025-03-04 02:25:46,529 INFO L125 PetriNetUnfolderBase]: For 2595/2595 co-relation queries the response was YES. [2025-03-04 02:25:46,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 1349 events. 763/1349 cut-off events. For 2595/2595 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6142 event pairs, 109 based on Foata normal form. 1/1350 useless extension candidates. Maximal degree in co-relation 4651. Up to 776 conditions per place. [2025-03-04 02:25:46,535 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 109 selfloop transitions, 77 changer transitions 5/192 dead transitions. [2025-03-04 02:25:46,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 192 transitions, 1455 flow [2025-03-04 02:25:46,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:25:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:25:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 257 transitions. [2025-03-04 02:25:46,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2699579831932773 [2025-03-04 02:25:46,538 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 263 flow. Second operand 34 states and 257 transitions. [2025-03-04 02:25:46,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 192 transitions, 1455 flow [2025-03-04 02:25:46,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 192 transitions, 1429 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 02:25:46,544 INFO L231 Difference]: Finished difference. Result has 93 places, 113 transitions, 1061 flow [2025-03-04 02:25:46,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1061, PETRI_PLACES=93, PETRI_TRANSITIONS=113} [2025-03-04 02:25:46,544 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 65 predicate places. [2025-03-04 02:25:46,544 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 113 transitions, 1061 flow [2025-03-04 02:25:46,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.711111111111111) internal successors, (212), 45 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:46,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:46,545 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:46,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 02:25:46,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:46,749 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:46,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:46,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1848454432, now seen corresponding path program 2 times [2025-03-04 02:25:46,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:46,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027194911] [2025-03-04 02:25:46,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:46,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:46,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:25:46,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:25:46,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:46,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:47,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:47,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027194911] [2025-03-04 02:25:47,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027194911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:47,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32672362] [2025-03-04 02:25:47,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:25:47,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:47,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:47,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:25:47,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:25:47,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:25:47,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:25:47,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:47,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 02:25:47,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:48,264 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:25:48,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-04 02:25:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:48,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:48,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:48,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-04 02:25:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:49,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32672362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:49,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:49,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 50 [2025-03-04 02:25:49,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903051556] [2025-03-04 02:25:49,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:49,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 02:25:49,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:49,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 02:25:49,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2322, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 02:25:49,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:25:49,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 113 transitions, 1061 flow. Second operand has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:49,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:49,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:25:49,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:25:56,237 INFO L124 PetriNetUnfolderBase]: 1263/2230 cut-off events. [2025-03-04 02:25:56,237 INFO L125 PetriNetUnfolderBase]: For 6308/6308 co-relation queries the response was YES. [2025-03-04 02:25:56,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9658 conditions, 2230 events. 1263/2230 cut-off events. For 6308/6308 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11848 event pairs, 43 based on Foata normal form. 2/2232 useless extension candidates. Maximal degree in co-relation 9633. Up to 938 conditions per place. [2025-03-04 02:25:56,250 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 214 selfloop transitions, 253 changer transitions 10/478 dead transitions. [2025-03-04 02:25:56,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 478 transitions, 4360 flow [2025-03-04 02:25:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 02:25:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-03-04 02:25:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 553 transitions. [2025-03-04 02:25:56,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28214285714285714 [2025-03-04 02:25:56,254 INFO L175 Difference]: Start difference. First operand has 93 places, 113 transitions, 1061 flow. Second operand 70 states and 553 transitions. [2025-03-04 02:25:56,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 478 transitions, 4360 flow [2025-03-04 02:25:56,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 478 transitions, 4048 flow, removed 150 selfloop flow, removed 5 redundant places. [2025-03-04 02:25:56,277 INFO L231 Difference]: Finished difference. Result has 175 places, 319 transitions, 3417 flow [2025-03-04 02:25:56,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=3417, PETRI_PLACES=175, PETRI_TRANSITIONS=319} [2025-03-04 02:25:56,280 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 147 predicate places. [2025-03-04 02:25:56,280 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 319 transitions, 3417 flow [2025-03-04 02:25:56,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:56,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:25:56,280 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:25:56,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:25:56,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 02:25:56,481 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:25:56,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:25:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1413746000, now seen corresponding path program 3 times [2025-03-04 02:25:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:25:56,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509848136] [2025-03-04 02:25:56,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:25:56,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:25:56,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:25:56,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:25:56,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:57,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:25:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509848136] [2025-03-04 02:25:57,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509848136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:25:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634496473] [2025-03-04 02:25:57,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:25:57,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:25:57,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:25:57,206 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:25:57,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:25:57,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:25:57,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:25:57,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:25:57,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:25:57,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 02:25:57,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:25:57,770 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 02:25:57,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-04 02:25:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:57,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:25:58,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:25:58,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 35 [2025-03-04 02:25:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:25:58,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634496473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:25:58,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:25:58,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2025-03-04 02:25:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046099788] [2025-03-04 02:25:58,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:25:58,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-04 02:25:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:25:58,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-04 02:25:58,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2506, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 02:25:58,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:25:58,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 319 transitions, 3417 flow. Second operand has 53 states, 53 states have (on average 4.471698113207547) internal successors, (237), 53 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:25:58,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:25:58,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:25:58,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:06,044 INFO L124 PetriNetUnfolderBase]: 1459/2600 cut-off events. [2025-03-04 02:26:06,044 INFO L125 PetriNetUnfolderBase]: For 10495/10495 co-relation queries the response was YES. [2025-03-04 02:26:06,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13485 conditions, 2600 events. 1459/2600 cut-off events. For 10495/10495 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14480 event pairs, 39 based on Foata normal form. 2/2602 useless extension candidates. Maximal degree in co-relation 13443. Up to 946 conditions per place. [2025-03-04 02:26:06,067 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 243 selfloop transitions, 350 changer transitions 10/604 dead transitions. [2025-03-04 02:26:06,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 604 transitions, 6663 flow [2025-03-04 02:26:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-04 02:26:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2025-03-04 02:26:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 573 transitions. [2025-03-04 02:26:06,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28822937625754524 [2025-03-04 02:26:06,075 INFO L175 Difference]: Start difference. First operand has 175 places, 319 transitions, 3417 flow. Second operand 71 states and 573 transitions. [2025-03-04 02:26:06,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 604 transitions, 6663 flow [2025-03-04 02:26:06,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 604 transitions, 6035 flow, removed 309 selfloop flow, removed 6 redundant places. [2025-03-04 02:26:06,176 INFO L231 Difference]: Finished difference. Result has 254 places, 445 transitions, 5394 flow [2025-03-04 02:26:06,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2963, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=5394, PETRI_PLACES=254, PETRI_TRANSITIONS=445} [2025-03-04 02:26:06,176 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 226 predicate places. [2025-03-04 02:26:06,176 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 445 transitions, 5394 flow [2025-03-04 02:26:06,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.471698113207547) internal successors, (237), 53 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:06,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:06,177 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:06,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:26:06,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:06,377 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:06,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1830410998, now seen corresponding path program 4 times [2025-03-04 02:26:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:06,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352817811] [2025-03-04 02:26:06,378 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:06,384 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:06,400 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:06,400 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:06,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:06,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:06,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352817811] [2025-03-04 02:26:06,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352817811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:06,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693843724] [2025-03-04 02:26:06,990 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:26:06,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:06,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:06,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:06,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:26:07,032 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:07,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:07,053 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:26:07,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:07,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 02:26:07,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:07,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:08,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:26:08,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 35 [2025-03-04 02:26:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:08,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693843724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:08,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:08,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2025-03-04 02:26:08,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741925897] [2025-03-04 02:26:08,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:08,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-04 02:26:08,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:08,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-04 02:26:08,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2529, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 02:26:08,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:26:08,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 445 transitions, 5394 flow. Second operand has 53 states, 53 states have (on average 4.471698113207547) internal successors, (237), 53 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:08,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:08,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:26:08,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:22,520 INFO L124 PetriNetUnfolderBase]: 2233/4059 cut-off events. [2025-03-04 02:26:22,520 INFO L125 PetriNetUnfolderBase]: For 23647/23647 co-relation queries the response was YES. [2025-03-04 02:26:22,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23475 conditions, 4059 events. 2233/4059 cut-off events. For 23647/23647 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 25885 event pairs, 43 based on Foata normal form. 84/4143 useless extension candidates. Maximal degree in co-relation 23418. Up to 1302 conditions per place. [2025-03-04 02:26:22,545 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 350 selfloop transitions, 585 changer transitions 95/1031 dead transitions. [2025-03-04 02:26:22,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 1031 transitions, 12645 flow [2025-03-04 02:26:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-03-04 02:26:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2025-03-04 02:26:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 1025 transitions. [2025-03-04 02:26:22,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2815934065934066 [2025-03-04 02:26:22,548 INFO L175 Difference]: Start difference. First operand has 254 places, 445 transitions, 5394 flow. Second operand 130 states and 1025 transitions. [2025-03-04 02:26:22,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 1031 transitions, 12645 flow [2025-03-04 02:26:22,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 1031 transitions, 12172 flow, removed 160 selfloop flow, removed 23 redundant places. [2025-03-04 02:26:22,739 INFO L231 Difference]: Finished difference. Result has 398 places, 678 transitions, 9893 flow [2025-03-04 02:26:22,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4963, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=345, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=130, PETRI_FLOW=9893, PETRI_PLACES=398, PETRI_TRANSITIONS=678} [2025-03-04 02:26:22,740 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 370 predicate places. [2025-03-04 02:26:22,740 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 678 transitions, 9893 flow [2025-03-04 02:26:22,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.471698113207547) internal successors, (237), 53 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:22,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:22,740 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:22,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:26:22,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:22,941 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:22,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1945252430, now seen corresponding path program 5 times [2025-03-04 02:26:22,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:22,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985421581] [2025-03-04 02:26:22,941 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:22,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:22,961 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:22,961 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:22,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:23,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:23,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985421581] [2025-03-04 02:26:23,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985421581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:23,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438767815] [2025-03-04 02:26:23,623 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:26:23,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:23,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:23,625 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:23,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:26:23,667 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:23,696 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:23,696 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:23,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:23,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:26:23,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:24,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:24,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:26:24,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-04 02:26:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:26:24,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438767815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:24,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:24,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 13] total 44 [2025-03-04 02:26:24,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588297720] [2025-03-04 02:26:24,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:24,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 02:26:24,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:24,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 02:26:24,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1827, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 02:26:24,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:26:24,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 678 transitions, 9893 flow. Second operand has 45 states, 45 states have (on average 4.711111111111111) internal successors, (212), 45 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:24,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:24,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:26:24,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:26,303 INFO L124 PetriNetUnfolderBase]: 2297/4193 cut-off events. [2025-03-04 02:26:26,303 INFO L125 PetriNetUnfolderBase]: For 47763/47763 co-relation queries the response was YES. [2025-03-04 02:26:26,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28821 conditions, 4193 events. 2297/4193 cut-off events. For 47763/47763 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 27131 event pairs, 129 based on Foata normal form. 8/4201 useless extension candidates. Maximal degree in co-relation 28728. Up to 2364 conditions per place. [2025-03-04 02:26:26,338 INFO L140 encePairwiseOnDemand]: 13/28 looper letters, 392 selfloop transitions, 397 changer transitions 44/834 dead transitions. [2025-03-04 02:26:26,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 834 transitions, 13441 flow [2025-03-04 02:26:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 02:26:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 02:26:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 213 transitions. [2025-03-04 02:26:26,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30428571428571427 [2025-03-04 02:26:26,343 INFO L175 Difference]: Start difference. First operand has 398 places, 678 transitions, 9893 flow. Second operand 25 states and 213 transitions. [2025-03-04 02:26:26,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 834 transitions, 13441 flow [2025-03-04 02:26:26,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 834 transitions, 12268 flow, removed 521 selfloop flow, removed 26 redundant places. [2025-03-04 02:26:26,799 INFO L231 Difference]: Finished difference. Result has 380 places, 722 transitions, 11161 flow [2025-03-04 02:26:26,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=8860, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=11161, PETRI_PLACES=380, PETRI_TRANSITIONS=722} [2025-03-04 02:26:26,800 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 352 predicate places. [2025-03-04 02:26:26,800 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 722 transitions, 11161 flow [2025-03-04 02:26:26,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.711111111111111) internal successors, (212), 45 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:26,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:26,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:26,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:26:27,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:27,001 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:27,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash 829784114, now seen corresponding path program 6 times [2025-03-04 02:26:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:27,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543325209] [2025-03-04 02:26:27,001 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:26:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:27,005 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:27,014 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:27,014 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:26:27,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:27,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:27,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543325209] [2025-03-04 02:26:27,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543325209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:27,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118889531] [2025-03-04 02:26:27,751 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:26:27,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:27,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:27,752 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:27,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 02:26:27,787 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:27,817 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:27,817 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:26:27,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:27,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 02:26:27,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:28,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:28,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:26:28,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2025-03-04 02:26:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:29,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118889531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:29,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:29,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 50 [2025-03-04 02:26:29,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812655789] [2025-03-04 02:26:29,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:29,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 02:26:29,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:29,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 02:26:29,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2309, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 02:26:29,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:26:29,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 722 transitions, 11161 flow. Second operand has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:29,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:29,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:26:29,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:33,199 INFO L124 PetriNetUnfolderBase]: 2277/4140 cut-off events. [2025-03-04 02:26:33,199 INFO L125 PetriNetUnfolderBase]: For 49537/49537 co-relation queries the response was YES. [2025-03-04 02:26:33,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29676 conditions, 4140 events. 2277/4140 cut-off events. For 49537/49537 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 26576 event pairs, 123 based on Foata normal form. 3/4143 useless extension candidates. Maximal degree in co-relation 29577. Up to 1674 conditions per place. [2025-03-04 02:26:33,238 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 429 selfloop transitions, 455 changer transitions 10/895 dead transitions. [2025-03-04 02:26:33,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 895 transitions, 14331 flow [2025-03-04 02:26:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-04 02:26:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-04 02:26:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 460 transitions. [2025-03-04 02:26:33,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2882205513784461 [2025-03-04 02:26:33,240 INFO L175 Difference]: Start difference. First operand has 380 places, 722 transitions, 11161 flow. Second operand 57 states and 460 transitions. [2025-03-04 02:26:33,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 895 transitions, 14331 flow [2025-03-04 02:26:33,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 895 transitions, 14122 flow, removed 93 selfloop flow, removed 8 redundant places. [2025-03-04 02:26:33,754 INFO L231 Difference]: Finished difference. Result has 429 places, 758 transitions, 12826 flow [2025-03-04 02:26:33,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=11008, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=425, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=12826, PETRI_PLACES=429, PETRI_TRANSITIONS=758} [2025-03-04 02:26:33,755 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 401 predicate places. [2025-03-04 02:26:33,755 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 758 transitions, 12826 flow [2025-03-04 02:26:33,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:33,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:33,755 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:33,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 02:26:33,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 02:26:33,956 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:33,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1596903538, now seen corresponding path program 7 times [2025-03-04 02:26:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568575569] [2025-03-04 02:26:33,957 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:33,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:33,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:26:33,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:33,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:33,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:34,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:34,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568575569] [2025-03-04 02:26:34,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568575569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:34,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398003385] [2025-03-04 02:26:34,614 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:26:34,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:34,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:34,615 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:34,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 02:26:34,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:26:34,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:34,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:26:34,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:34,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 02:26:34,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:26:35,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:35,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:26:35,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-03-04 02:26:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:26:35,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398003385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:35,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:35,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 12] total 43 [2025-03-04 02:26:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130025442] [2025-03-04 02:26:35,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:35,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 02:26:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:35,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 02:26:35,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1752, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 02:26:35,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:26:35,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 758 transitions, 12826 flow. Second operand has 44 states, 44 states have (on average 4.75) internal successors, (209), 44 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:35,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:35,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:26:35,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:37,775 INFO L124 PetriNetUnfolderBase]: 2297/4178 cut-off events. [2025-03-04 02:26:37,776 INFO L125 PetriNetUnfolderBase]: For 58345/58345 co-relation queries the response was YES. [2025-03-04 02:26:37,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31631 conditions, 4178 events. 2297/4178 cut-off events. For 58345/58345 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 26851 event pairs, 109 based on Foata normal form. 5/4183 useless extension candidates. Maximal degree in co-relation 31527. Up to 2488 conditions per place. [2025-03-04 02:26:37,812 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 402 selfloop transitions, 414 changer transitions 45/862 dead transitions. [2025-03-04 02:26:37,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 862 transitions, 15406 flow [2025-03-04 02:26:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 02:26:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 02:26:37,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 275 transitions. [2025-03-04 02:26:37,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2976190476190476 [2025-03-04 02:26:37,813 INFO L175 Difference]: Start difference. First operand has 429 places, 758 transitions, 12826 flow. Second operand 33 states and 275 transitions. [2025-03-04 02:26:37,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 862 transitions, 15406 flow [2025-03-04 02:26:38,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 862 transitions, 14865 flow, removed 153 selfloop flow, removed 29 redundant places. [2025-03-04 02:26:38,396 INFO L231 Difference]: Finished difference. Result has 435 places, 744 transitions, 13616 flow [2025-03-04 02:26:38,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12365, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=13616, PETRI_PLACES=435, PETRI_TRANSITIONS=744} [2025-03-04 02:26:38,397 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 407 predicate places. [2025-03-04 02:26:38,397 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 744 transitions, 13616 flow [2025-03-04 02:26:38,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.75) internal successors, (209), 44 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:38,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:38,397 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:38,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 02:26:38,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:38,598 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:38,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash -700855458, now seen corresponding path program 8 times [2025-03-04 02:26:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:38,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500310760] [2025-03-04 02:26:38,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:38,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:38,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:38,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:38,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:38,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:39,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500310760] [2025-03-04 02:26:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500310760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871295367] [2025-03-04 02:26:39,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:26:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:39,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:39,151 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:39,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 02:26:39,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:39,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:39,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:26:39,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:39,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 02:26:39,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:39,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:26:39,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-03-04 02:26:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:39,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:40,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:26:40,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-03-04 02:26:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:40,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871295367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:40,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:40,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 50 [2025-03-04 02:26:40,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169412348] [2025-03-04 02:26:40,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:40,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 02:26:40,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:40,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 02:26:40,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2310, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 02:26:40,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:26:40,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 744 transitions, 13616 flow. Second operand has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:40,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:40,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:26:40,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:26:54,235 INFO L124 PetriNetUnfolderBase]: 4534/8174 cut-off events. [2025-03-04 02:26:54,235 INFO L125 PetriNetUnfolderBase]: For 174306/174306 co-relation queries the response was YES. [2025-03-04 02:26:54,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68279 conditions, 8174 events. 4534/8174 cut-off events. For 174306/174306 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 57583 event pairs, 147 based on Foata normal form. 140/8314 useless extension candidates. Maximal degree in co-relation 68170. Up to 2373 conditions per place. [2025-03-04 02:26:54,302 INFO L140 encePairwiseOnDemand]: 11/28 looper letters, 645 selfloop transitions, 934 changer transitions 346/1926 dead transitions. [2025-03-04 02:26:54,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 1926 transitions, 36468 flow [2025-03-04 02:26:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2025-03-04 02:26:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2025-03-04 02:26:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 1289 transitions. [2025-03-04 02:26:54,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30896452540747843 [2025-03-04 02:26:54,305 INFO L175 Difference]: Start difference. First operand has 435 places, 744 transitions, 13616 flow. Second operand 149 states and 1289 transitions. [2025-03-04 02:26:54,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 1926 transitions, 36468 flow [2025-03-04 02:26:55,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 1926 transitions, 35494 flow, removed 172 selfloop flow, removed 31 redundant places. [2025-03-04 02:26:55,587 INFO L231 Difference]: Finished difference. Result has 592 places, 1286 transitions, 29473 flow [2025-03-04 02:26:55,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=12853, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=427, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=149, PETRI_FLOW=29473, PETRI_PLACES=592, PETRI_TRANSITIONS=1286} [2025-03-04 02:26:55,588 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 564 predicate places. [2025-03-04 02:26:55,588 INFO L471 AbstractCegarLoop]: Abstraction has has 592 places, 1286 transitions, 29473 flow [2025-03-04 02:26:55,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:55,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:26:55,588 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:26:55,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 02:26:55,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 02:26:55,789 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:26:55,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:26:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2109022512, now seen corresponding path program 9 times [2025-03-04 02:26:55,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:26:55,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801398600] [2025-03-04 02:26:55,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:55,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:26:55,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:55,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:55,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:55,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:56,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:26:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801398600] [2025-03-04 02:26:56,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801398600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:26:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837576481] [2025-03-04 02:26:56,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:26:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:26:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:26:56,396 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:26:56,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 02:26:56,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:26:56,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:26:56,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:26:56,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:26:56,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 02:26:56,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:26:56,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-04 02:26:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:56,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:26:57,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:26:57,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2025-03-04 02:26:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:26:57,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837576481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:26:57,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:26:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 50 [2025-03-04 02:26:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726934721] [2025-03-04 02:26:57,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:26:57,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 02:26:57,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:26:57,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 02:26:57,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2337, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 02:26:57,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-03-04 02:26:57,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 1286 transitions, 29473 flow. Second operand has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:26:57,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:26:57,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-03-04 02:26:57,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:02,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []