./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-easy10.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-easy10.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24421fae56d27ddfd314bb85e4431c40a1e6738a845aa97472d8668d2b4dde52 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:49:08,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:49:09,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:49:09,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:49:09,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:49:09,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:49:09,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:49:09,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:49:09,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:49:09,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:49:09,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:49:09,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:49:09,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:49:09,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:49:09,059 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:49:09,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:49:09,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:49:09,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:49:09,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:49:09,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:49:09,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:49:09,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:49:09,060 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:09,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:09,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:49:09,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:49:09,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:49:09,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:49:09,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:49:09,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:49:09,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:49:09,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:49:09,062 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 24421fae56d27ddfd314bb85e4431c40a1e6738a845aa97472d8668d2b4dde52 [2025-01-09 16:49:09,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:49:09,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:49:09,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:49:09,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:49:09,291 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:49:09,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy10.wvr.c [2025-01-09 16:49:10,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0892e7db7/0c41e7619aeb49dea00def2e66898f47/FLAG529ed9bea [2025-01-09 16:49:10,767 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:49:10,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-easy10.wvr.c [2025-01-09 16:49:10,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0892e7db7/0c41e7619aeb49dea00def2e66898f47/FLAG529ed9bea [2025-01-09 16:49:10,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0892e7db7/0c41e7619aeb49dea00def2e66898f47 [2025-01-09 16:49:10,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:49:10,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:49:10,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:49:10,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:49:10,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:49:10,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:49:10" (1/1) ... [2025-01-09 16:49:10,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42401383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:10, skipping insertion in model container [2025-01-09 16:49:10,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:49:10" (1/1) ... [2025-01-09 16:49:10,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:49:11,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-easy10.wvr.c[2547,2560] [2025-01-09 16:49:11,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:49:11,082 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:49:11,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-easy10.wvr.c[2547,2560] [2025-01-09 16:49:11,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:49:11,112 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:49:11,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11 WrapperNode [2025-01-09 16:49:11,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:49:11,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:49:11,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:49:11,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:49:11,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,143 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-01-09 16:49:11,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:49:11,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:49:11,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:49:11,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:49:11,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,172 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:49:11,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:49:11,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:49:11,190 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:49:11,190 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:49:11,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (1/1) ... [2025-01-09 16:49:11,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:49:11,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:49:11,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:49:11,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:49:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:49:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:49:11,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:49:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:49:11,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:49:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:49:11,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:49:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:49:11,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:49:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:49:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:49:11,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:49:11,242 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:49:11,300 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:49:11,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:49:11,471 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:49:11,471 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:49:11,584 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:49:11,584 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:49:11,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:11 BoogieIcfgContainer [2025-01-09 16:49:11,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:49:11,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:49:11,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:49:11,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:49:11,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:49:10" (1/3) ... [2025-01-09 16:49:11,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ba131d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:49:11, skipping insertion in model container [2025-01-09 16:49:11,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:11" (2/3) ... [2025-01-09 16:49:11,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ba131d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:49:11, skipping insertion in model container [2025-01-09 16:49:11,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:11" (3/3) ... [2025-01-09 16:49:11,591 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2025-01-09 16:49:11,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:49:11,603 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy10.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 16:49:11,603 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:49:11,658 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:49:11,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 60 transitions, 148 flow [2025-01-09 16:49:11,729 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2025-01-09 16:49:11,730 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:49:11,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 56 events. 0/56 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-01-09 16:49:11,732 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 60 transitions, 148 flow [2025-01-09 16:49:11,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 55 transitions, 134 flow [2025-01-09 16:49:11,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:49:11,750 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;@4f9e1426, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:49:11,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:49:11,764 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:49:11,764 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-01-09 16:49:11,765 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:49:11,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:11,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:11,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1956989108, now seen corresponding path program 1 times [2025-01-09 16:49:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550123961] [2025-01-09 16:49:11,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:49:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:11,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 16:49:11,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 16:49:11,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:11,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:12,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:12,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550123961] [2025-01-09 16:49:12,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550123961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:12,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:12,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:49:12,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054615687] [2025-01-09 16:49:12,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:12,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:49:12,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:12,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:49:12,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:49:12,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-01-09 16:49:12,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:12,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:12,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-01-09 16:49:12,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:12,490 INFO L124 PetriNetUnfolderBase]: 597/1149 cut-off events. [2025-01-09 16:49:12,490 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-09 16:49:12,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 1149 events. 597/1149 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7045 event pairs, 142 based on Foata normal form. 25/1126 useless extension candidates. Maximal degree in co-relation 2084. Up to 853 conditions per place. [2025-01-09 16:49:12,501 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 34 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-01-09 16:49:12,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 230 flow [2025-01-09 16:49:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:49:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:49:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2025-01-09 16:49:12,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7388888888888889 [2025-01-09 16:49:12,512 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 134 flow. Second operand 3 states and 133 transitions. [2025-01-09 16:49:12,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 230 flow [2025-01-09 16:49:12,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 210 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:49:12,524 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 126 flow [2025-01-09 16:49:12,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-01-09 16:49:12,529 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2025-01-09 16:49:12,530 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 126 flow [2025-01-09 16:49:12,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:12,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:12,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:12,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:49:12,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -211321158, now seen corresponding path program 2 times [2025-01-09 16:49:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:12,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848031285] [2025-01-09 16:49:12,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:49:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:12,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-01-09 16:49:12,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 16:49:12,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:49:12,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:12,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848031285] [2025-01-09 16:49:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848031285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:49:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42487569] [2025-01-09 16:49:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:49:12,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:12,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:49:12,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:49:12,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-01-09 16:49:12,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:12,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:12,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-01-09 16:49:12,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:12,908 INFO L124 PetriNetUnfolderBase]: 507/1023 cut-off events. [2025-01-09 16:49:12,908 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-01-09 16:49:12,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 1023 events. 507/1023 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5972 event pairs, 156 based on Foata normal form. 25/1007 useless extension candidates. Maximal degree in co-relation 1864. Up to 645 conditions per place. [2025-01-09 16:49:12,914 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-01-09 16:49:12,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 212 flow [2025-01-09 16:49:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:49:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:49:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-01-09 16:49:12,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7277777777777777 [2025-01-09 16:49:12,916 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 126 flow. Second operand 3 states and 131 transitions. [2025-01-09 16:49:12,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 212 flow [2025-01-09 16:49:12,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:49:12,917 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 130 flow [2025-01-09 16:49:12,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-01-09 16:49:12,918 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2025-01-09 16:49:12,918 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 130 flow [2025-01-09 16:49:12,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:12,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:12,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:12,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:49:12,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:12,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash -214292212, now seen corresponding path program 3 times [2025-01-09 16:49:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:12,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555834217] [2025-01-09 16:49:12,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:49:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:12,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 1 equivalence classes. [2025-01-09 16:49:12,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 16:49:12,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:49:12,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:13,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:13,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555834217] [2025-01-09 16:49:13,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555834217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:13,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:13,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:49:13,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597682036] [2025-01-09 16:49:13,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:13,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:49:13,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:13,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:49:13,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:49:13,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-01-09 16:49:13,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:13,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:13,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-01-09 16:49:13,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:13,196 INFO L124 PetriNetUnfolderBase]: 507/985 cut-off events. [2025-01-09 16:49:13,197 INFO L125 PetriNetUnfolderBase]: For 117/121 co-relation queries the response was YES. [2025-01-09 16:49:13,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1932 conditions, 985 events. 507/985 cut-off events. For 117/121 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5680 event pairs, 122 based on Foata normal form. 20/977 useless extension candidates. Maximal degree in co-relation 1641. Up to 733 conditions per place. [2025-01-09 16:49:13,205 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 36 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-01-09 16:49:13,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 233 flow [2025-01-09 16:49:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:49:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:49:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2025-01-09 16:49:13,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-01-09 16:49:13,208 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 130 flow. Second operand 3 states and 135 transitions. [2025-01-09 16:49:13,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 233 flow [2025-01-09 16:49:13,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:49:13,211 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 134 flow [2025-01-09 16:49:13,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2025-01-09 16:49:13,212 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2025-01-09 16:49:13,212 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 134 flow [2025-01-09 16:49:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:13,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:13,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:13,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:49:13,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:13,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2104338960, now seen corresponding path program 4 times [2025-01-09 16:49:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:13,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552098060] [2025-01-09 16:49:13,214 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:49:13,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:13,226 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-09 16:49:13,236 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 16:49:13,236 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:49:13,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:13,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552098060] [2025-01-09 16:49:13,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552098060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:13,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:49:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408695126] [2025-01-09 16:49:13,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:49:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:13,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:49:13,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:49:13,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-01-09 16:49:13,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:13,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:13,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-01-09 16:49:13,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:13,458 INFO L124 PetriNetUnfolderBase]: 549/1083 cut-off events. [2025-01-09 16:49:13,459 INFO L125 PetriNetUnfolderBase]: For 251/269 co-relation queries the response was YES. [2025-01-09 16:49:13,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 1083 events. 549/1083 cut-off events. For 251/269 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6281 event pairs, 156 based on Foata normal form. 14/1046 useless extension candidates. Maximal degree in co-relation 2164. Up to 705 conditions per place. [2025-01-09 16:49:13,463 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 34 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-01-09 16:49:13,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 231 flow [2025-01-09 16:49:13,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:49:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:49:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2025-01-09 16:49:13,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7388888888888889 [2025-01-09 16:49:13,465 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 134 flow. Second operand 3 states and 133 transitions. [2025-01-09 16:49:13,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 231 flow [2025-01-09 16:49:13,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 227 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:49:13,466 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 138 flow [2025-01-09 16:49:13,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2025-01-09 16:49:13,467 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-01-09 16:49:13,467 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 138 flow [2025-01-09 16:49:13,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:13,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:13,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:13,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:49:13,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:13,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1404001800, now seen corresponding path program 5 times [2025-01-09 16:49:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:13,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422066396] [2025-01-09 16:49:13,468 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:49:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:13,477 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-01-09 16:49:13,577 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 16:49:13,577 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:49:13,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422066396] [2025-01-09 16:49:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422066396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:14,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:49:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049024617] [2025-01-09 16:49:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:14,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:49:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:14,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:49:14,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:49:15,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-09 16:49:15,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 138 flow. Second operand has 14 states, 14 states have (on average 16.285714285714285) internal successors, (228), 14 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:15,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:15,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-09 16:49:15,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:17,581 INFO L124 PetriNetUnfolderBase]: 15512/22322 cut-off events. [2025-01-09 16:49:17,581 INFO L125 PetriNetUnfolderBase]: For 3889/3889 co-relation queries the response was YES. [2025-01-09 16:49:17,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48416 conditions, 22322 events. 15512/22322 cut-off events. For 3889/3889 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 131223 event pairs, 2112 based on Foata normal form. 1/22315 useless extension candidates. Maximal degree in co-relation 20942. Up to 6001 conditions per place. [2025-01-09 16:49:17,687 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 214 selfloop transitions, 15 changer transitions 18/256 dead transitions. [2025-01-09 16:49:17,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 256 transitions, 1119 flow [2025-01-09 16:49:17,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:49:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:49:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 443 transitions. [2025-01-09 16:49:17,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4922222222222222 [2025-01-09 16:49:17,689 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 138 flow. Second operand 15 states and 443 transitions. [2025-01-09 16:49:17,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 256 transitions, 1119 flow [2025-01-09 16:49:17,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 256 transitions, 1115 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:49:17,694 INFO L231 Difference]: Finished difference. Result has 89 places, 66 transitions, 235 flow [2025-01-09 16:49:17,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=235, PETRI_PLACES=89, PETRI_TRANSITIONS=66} [2025-01-09 16:49:17,694 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 21 predicate places. [2025-01-09 16:49:17,695 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 66 transitions, 235 flow [2025-01-09 16:49:17,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.285714285714285) internal successors, (228), 14 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:17,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:17,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:17,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:49:17,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:17,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1577836536, now seen corresponding path program 6 times [2025-01-09 16:49:17,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:17,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599981800] [2025-01-09 16:49:17,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:49:17,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:17,703 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 1 equivalence classes. [2025-01-09 16:49:17,747 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 16:49:17,747 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:49:17,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:19,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:19,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599981800] [2025-01-09 16:49:19,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599981800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:19,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:19,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:49:19,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994589191] [2025-01-09 16:49:19,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:19,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:49:19,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:19,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:49:19,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:49:19,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-09 16:49:19,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 66 transitions, 235 flow. Second operand has 14 states, 14 states have (on average 16.285714285714285) internal successors, (228), 14 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:19,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:19,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-09 16:49:19,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:23,987 INFO L124 PetriNetUnfolderBase]: 44972/65046 cut-off events. [2025-01-09 16:49:23,987 INFO L125 PetriNetUnfolderBase]: For 46767/46767 co-relation queries the response was YES. [2025-01-09 16:49:24,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174370 conditions, 65046 events. 44972/65046 cut-off events. For 46767/46767 co-relation queries the response was YES. Maximal size of possible extension queue 1922. Compared 446513 event pairs, 7165 based on Foata normal form. 1/65040 useless extension candidates. Maximal degree in co-relation 174188. Up to 16978 conditions per place. [2025-01-09 16:49:24,494 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 264 selfloop transitions, 27 changer transitions 10/310 dead transitions. [2025-01-09 16:49:24,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 310 transitions, 1737 flow [2025-01-09 16:49:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:49:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:49:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 448 transitions. [2025-01-09 16:49:24,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49777777777777776 [2025-01-09 16:49:24,498 INFO L175 Difference]: Start difference. First operand has 89 places, 66 transitions, 235 flow. Second operand 15 states and 448 transitions. [2025-01-09 16:49:24,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 310 transitions, 1737 flow [2025-01-09 16:49:25,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 310 transitions, 1695 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-01-09 16:49:25,076 INFO L231 Difference]: Finished difference. Result has 109 places, 86 transitions, 469 flow [2025-01-09 16:49:25,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=469, PETRI_PLACES=109, PETRI_TRANSITIONS=86} [2025-01-09 16:49:25,077 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 41 predicate places. [2025-01-09 16:49:25,078 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 86 transitions, 469 flow [2025-01-09 16:49:25,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.285714285714285) internal successors, (228), 14 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:25,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:25,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:25,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:49:25,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:25,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1144622834, now seen corresponding path program 7 times [2025-01-09 16:49:25,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:25,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202182544] [2025-01-09 16:49:25,079 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:49:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:25,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 16:49:25,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 16:49:25,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:25,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202182544] [2025-01-09 16:49:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202182544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:49:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665175914] [2025-01-09 16:49:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:26,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:49:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:26,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:49:26,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:49:26,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-09 16:49:26,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 86 transitions, 469 flow. Second operand has 14 states, 14 states have (on average 16.285714285714285) internal successors, (228), 14 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:26,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:26,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-09 16:49:26,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:49:35,243 INFO L124 PetriNetUnfolderBase]: 82077/119021 cut-off events. [2025-01-09 16:49:35,244 INFO L125 PetriNetUnfolderBase]: For 206087/206087 co-relation queries the response was YES. [2025-01-09 16:49:35,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369923 conditions, 119021 events. 82077/119021 cut-off events. For 206087/206087 co-relation queries the response was YES. Maximal size of possible extension queue 3719. Compared 890610 event pairs, 15472 based on Foata normal form. 1/119016 useless extension candidates. Maximal degree in co-relation 369503. Up to 31426 conditions per place. [2025-01-09 16:49:35,996 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 303 selfloop transitions, 41 changer transitions 10/363 dead transitions. [2025-01-09 16:49:35,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 363 transitions, 2556 flow [2025-01-09 16:49:35,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:49:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:49:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 454 transitions. [2025-01-09 16:49:35,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5044444444444445 [2025-01-09 16:49:35,998 INFO L175 Difference]: Start difference. First operand has 109 places, 86 transitions, 469 flow. Second operand 15 states and 454 transitions. [2025-01-09 16:49:35,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 363 transitions, 2556 flow [2025-01-09 16:49:39,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 363 transitions, 2498 flow, removed 23 selfloop flow, removed 3 redundant places. [2025-01-09 16:49:39,288 INFO L231 Difference]: Finished difference. Result has 131 places, 119 transitions, 940 flow [2025-01-09 16:49:39,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=940, PETRI_PLACES=131, PETRI_TRANSITIONS=119} [2025-01-09 16:49:39,288 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 63 predicate places. [2025-01-09 16:49:39,289 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 119 transitions, 940 flow [2025-01-09 16:49:39,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.285714285714285) internal successors, (228), 14 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:39,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:49:39,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:49:39,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:49:39,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:49:39,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:49:39,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1333237722, now seen corresponding path program 8 times [2025-01-09 16:49:39,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:49:39,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469096131] [2025-01-09 16:49:39,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:49:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:49:39,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-01-09 16:49:39,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 16:49:39,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:49:39,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:49:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:49:40,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469096131] [2025-01-09 16:49:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469096131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:49:40,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:49:40,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:49:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731257535] [2025-01-09 16:49:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:49:40,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:49:40,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:40,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:49:40,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:49:40,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-01-09 16:49:40,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 119 transitions, 940 flow. Second operand has 14 states, 14 states have (on average 16.285714285714285) internal successors, (228), 14 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:49:40,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:49:40,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-01-09 16:49:40,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand