./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-simple-array-sum.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-simple-array-sum.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 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:27:22,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:27:22,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:27:22,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:27:22,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:27:22,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:27:22,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:27:22,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:27:22,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:27:22,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:27:22,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:27:22,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:27:22,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:27:22,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:27:22,291 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:27:22,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:27:22,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:27:22,292 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:27:22,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:27:22,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:27:22,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:27:22,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:27:22,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:27:22,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:27:22,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:27:22,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:27:22,293 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:27:22,293 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:27:22,293 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:27:22,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:27:22,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:27:22,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:27:22,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:27:22,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:27:22,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:27:22,294 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:27:22,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:27:22,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:27:22,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:27:22,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:27:22,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:27:22,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:27:22,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:27:22,295 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 -> 0c7c5c48eda3eba87519854c38b7495ee97c35417d2a6e287791b53fe49d6c07 [2025-03-04 02:27:22,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:27:22,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:27:22,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:27:22,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:27:22,561 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:27:22,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-03-04 02:27:23,797 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c839c36/ce97046d58144beeb5f831422a9ce004/FLAGe39aa558b [2025-03-04 02:27:24,012 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:27:24,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2025-03-04 02:27:24,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c839c36/ce97046d58144beeb5f831422a9ce004/FLAGe39aa558b [2025-03-04 02:27:24,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c839c36/ce97046d58144beeb5f831422a9ce004 [2025-03-04 02:27:24,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:27:24,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:27:24,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:27:24,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:27:24,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:27:24,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405d5fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24, skipping insertion in model container [2025-03-04 02:27:24,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:27:24,204 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-simple-array-sum.wvr.c[2429,2442] [2025-03-04 02:27:24,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:27:24,221 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:27:24,241 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-simple-array-sum.wvr.c[2429,2442] [2025-03-04 02:27:24,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:27:24,258 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:27:24,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24 WrapperNode [2025-03-04 02:27:24,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:27:24,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:27:24,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:27:24,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:27:24,267 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:27:24" (1/1) ... [2025-03-04 02:27:24,275 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:27:24" (1/1) ... [2025-03-04 02:27:24,287 INFO L138 Inliner]: procedures = 23, calls = 20, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 103 [2025-03-04 02:27:24,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:27:24,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:27:24,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:27:24,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:27:24,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,315 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 02:27:24,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:27:24,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:27:24,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:27:24,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:27:24,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (1/1) ... [2025-03-04 02:27:24,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:27:24,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:24,361 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:27:24,366 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:27:24,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:27:24,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:27:24,381 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:27:24,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:27:24,381 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:27:24,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:27:24,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:27:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:27:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:27:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:27:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:27:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:27:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:27:24,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:27:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:27:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:27:24,383 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:27:24,458 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:27:24,460 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:27:24,678 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:27:24,679 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:27:24,823 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:27:24,823 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:27:24,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:27:24 BoogieIcfgContainer [2025-03-04 02:27:24,823 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:27:24,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:27:24,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:27:24,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:27:24,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:27:24" (1/3) ... [2025-03-04 02:27:24,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db77111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:27:24, skipping insertion in model container [2025-03-04 02:27:24,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:27:24" (2/3) ... [2025-03-04 02:27:24,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db77111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:27:24, skipping insertion in model container [2025-03-04 02:27:24,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:27:24" (3/3) ... [2025-03-04 02:27:24,831 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-03-04 02:27:24,842 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:27:24,843 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-array-sum.wvr.c that has 4 procedures, 36 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-04 02:27:24,844 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:27:24,887 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:27:24,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 103 flow [2025-03-04 02:27:24,949 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-03-04 02:27:24,951 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:27:24,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 6/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2025-03-04 02:27:24,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 103 flow [2025-03-04 02:27:24,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 37 transitions, 92 flow [2025-03-04 02:27:24,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:27:24,979 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;@893a8f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:27:24,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:27:24,991 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:27:24,991 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-03-04 02:27:24,991 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:27:24,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:24,992 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:27:24,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:24,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1990313920, now seen corresponding path program 1 times [2025-03-04 02:27:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:25,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372615441] [2025-03-04 02:27:25,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:25,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:25,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:27:25,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:27:25,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:25,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:25,724 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:27:25,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:25,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372615441] [2025-03-04 02:27:25,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372615441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:25,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:25,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:27:25,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578045357] [2025-03-04 02:27:25,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:25,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:27:25,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:25,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:27:25,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:27:25,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 02:27:25,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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:27:25,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:25,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 02:27:25,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:26,130 INFO L124 PetriNetUnfolderBase]: 1474/2293 cut-off events. [2025-03-04 02:27:26,131 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-03-04 02:27:26,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4505 conditions, 2293 events. 1474/2293 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11683 event pairs, 952 based on Foata normal form. 1/2175 useless extension candidates. Maximal degree in co-relation 2189. Up to 1226 conditions per place. [2025-03-04 02:27:26,153 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 50 selfloop transitions, 6 changer transitions 1/64 dead transitions. [2025-03-04 02:27:26,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 278 flow [2025-03-04 02:27:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:27:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:27:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-04 02:27:26,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.526829268292683 [2025-03-04 02:27:26,168 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 92 flow. Second operand 5 states and 108 transitions. [2025-03-04 02:27:26,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 278 flow [2025-03-04 02:27:26,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:27:26,182 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 122 flow [2025-03-04 02:27:26,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-03-04 02:27:26,186 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-03-04 02:27:26,186 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 122 flow [2025-03-04 02:27:26,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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:27:26,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:26,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:26,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:27:26,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:26,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash 801851109, now seen corresponding path program 1 times [2025-03-04 02:27:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680765517] [2025-03-04 02:27:26,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:26,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:27:26,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:26,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:26,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:26,346 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:27:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:26,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680765517] [2025-03-04 02:27:26,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680765517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:26,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348942485] [2025-03-04 02:27:26,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:26,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:26,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:26,349 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:27:26,352 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:27:26,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:27:26,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:27:26,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:26,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:26,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:27:26,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:26,511 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:27:26,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348942485] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:26,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:27:26,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2025-03-04 02:27:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695502473] [2025-03-04 02:27:26,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:26,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:27:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:26,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:27:26,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:27:26,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 02:27:26,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:27:26,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:26,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 02:27:26,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:27,013 INFO L124 PetriNetUnfolderBase]: 2892/4504 cut-off events. [2025-03-04 02:27:27,013 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2025-03-04 02:27:27,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9321 conditions, 4504 events. 2892/4504 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 25951 event pairs, 2113 based on Foata normal form. 1/4278 useless extension candidates. Maximal degree in co-relation 7180. Up to 2025 conditions per place. [2025-03-04 02:27:27,044 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 59 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2025-03-04 02:27:27,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 72 transitions, 334 flow [2025-03-04 02:27:27,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:27:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:27:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-04 02:27:27,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5414634146341464 [2025-03-04 02:27:27,047 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 122 flow. Second operand 5 states and 111 transitions. [2025-03-04 02:27:27,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 72 transitions, 334 flow [2025-03-04 02:27:27,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 326 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:27,050 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 150 flow [2025-03-04 02:27:27,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2025-03-04 02:27:27,050 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2025-03-04 02:27:27,050 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 150 flow [2025-03-04 02:27:27,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:27:27,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:27,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:27,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:27:27,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:27,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:27,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2032431742, now seen corresponding path program 1 times [2025-03-04 02:27:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:27,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803634706] [2025-03-04 02:27:27,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:27,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:27:27,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:27:27,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:27,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:27,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:27,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803634706] [2025-03-04 02:27:27,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803634706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:27,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042147126] [2025-03-04 02:27:27,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:27,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:27,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:27,388 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:27:27,389 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:27:27,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:27:27,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:27:27,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:27,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:27,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:27:27,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:27,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:27,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042147126] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:27,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:27:27,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-04 02:27:27,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548569221] [2025-03-04 02:27:27,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:27,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:27:27,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:27,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:27:27,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:27:27,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:27:27,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:27,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:27,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:27:27,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:27,965 INFO L124 PetriNetUnfolderBase]: 3466/5174 cut-off events. [2025-03-04 02:27:27,965 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2025-03-04 02:27:27,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10717 conditions, 5174 events. 3466/5174 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29081 event pairs, 1260 based on Foata normal form. 0/4782 useless extension candidates. Maximal degree in co-relation 8856. Up to 1478 conditions per place. [2025-03-04 02:27:27,992 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 91 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2025-03-04 02:27:27,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 108 transitions, 508 flow [2025-03-04 02:27:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:27:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:27:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-03-04 02:27:27,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6056910569105691 [2025-03-04 02:27:27,996 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 150 flow. Second operand 6 states and 149 transitions. [2025-03-04 02:27:27,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 108 transitions, 508 flow [2025-03-04 02:27:27,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 504 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:28,000 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 198 flow [2025-03-04 02:27:28,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-04 02:27:28,002 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2025-03-04 02:27:28,002 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 198 flow [2025-03-04 02:27:28,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:28,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:28,002 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:27:28,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:27:28,207 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,SelfDestructingSolverStorable2 [2025-03-04 02:27:28,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:28,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash -729988007, now seen corresponding path program 1 times [2025-03-04 02:27:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:28,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903976178] [2025-03-04 02:27:28,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:28,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:27:28,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:27:28,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:28,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:28,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:28,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903976178] [2025-03-04 02:27:28,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903976178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:28,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:28,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:27:28,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512756387] [2025-03-04 02:27:28,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:28,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:27:28,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:28,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:27:28,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:27:28,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:27:28,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:27:28,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:28,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:27:28,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:28,561 INFO L124 PetriNetUnfolderBase]: 2011/3148 cut-off events. [2025-03-04 02:27:28,562 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-04 02:27:28,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7089 conditions, 3148 events. 2011/3148 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16391 event pairs, 1344 based on Foata normal form. 111/3131 useless extension candidates. Maximal degree in co-relation 4209. Up to 1609 conditions per place. [2025-03-04 02:27:28,579 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 69 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2025-03-04 02:27:28,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 408 flow [2025-03-04 02:27:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:27:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:27:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-03-04 02:27:28,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2025-03-04 02:27:28,580 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 198 flow. Second operand 6 states and 130 transitions. [2025-03-04 02:27:28,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 408 flow [2025-03-04 02:27:28,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 397 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:27:28,584 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 171 flow [2025-03-04 02:27:28,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-03-04 02:27:28,585 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-03-04 02:27:28,585 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 171 flow [2025-03-04 02:27:28,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:27:28,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:28,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:28,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:27:28,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:28,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:28,586 INFO L85 PathProgramCache]: Analyzing trace with hash -910070085, now seen corresponding path program 1 times [2025-03-04 02:27:28,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:28,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237424334] [2025-03-04 02:27:28,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:28,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:28,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:27:28,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:27:28,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:28,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237424334] [2025-03-04 02:27:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237424334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558068616] [2025-03-04 02:27:28,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:28,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:28,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:28,675 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:27:28,677 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:27:28,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:27:28,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:27:28,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:28,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:28,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:27:28,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:28,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:28,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558068616] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:28,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:27:28,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-04 02:27:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177677415] [2025-03-04 02:27:28,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:28,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:27:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:28,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:27:28,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:27:28,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:27:28,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:28,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:28,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:27:28,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:29,118 INFO L124 PetriNetUnfolderBase]: 2240/3476 cut-off events. [2025-03-04 02:27:29,118 INFO L125 PetriNetUnfolderBase]: For 2479/2479 co-relation queries the response was YES. [2025-03-04 02:27:29,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8282 conditions, 3476 events. 2240/3476 cut-off events. For 2479/2479 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17979 event pairs, 717 based on Foata normal form. 0/3246 useless extension candidates. Maximal degree in co-relation 4551. Up to 1165 conditions per place. [2025-03-04 02:27:29,129 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 78 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-03-04 02:27:29,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 483 flow [2025-03-04 02:27:29,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:27:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:27:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-04 02:27:29,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-03-04 02:27:29,130 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 171 flow. Second operand 6 states and 138 transitions. [2025-03-04 02:27:29,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 483 flow [2025-03-04 02:27:29,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 458 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 02:27:29,133 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 189 flow [2025-03-04 02:27:29,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2025-03-04 02:27:29,134 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2025-03-04 02:27:29,134 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 189 flow [2025-03-04 02:27:29,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:29,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:29,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:29,140 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:27:29,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:29,335 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:29,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash 389556408, now seen corresponding path program 1 times [2025-03-04 02:27:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:29,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505374007] [2025-03-04 02:27:29,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:29,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:27:29,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:27:29,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:29,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:29,391 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:27:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505374007] [2025-03-04 02:27:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505374007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:29,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:29,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:27:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104953404] [2025-03-04 02:27:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:29,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:27:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:29,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:27:29,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:27:29,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:27:29,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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:27:29,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:29,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:27:29,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:29,645 INFO L124 PetriNetUnfolderBase]: 2461/3908 cut-off events. [2025-03-04 02:27:29,645 INFO L125 PetriNetUnfolderBase]: For 2022/2022 co-relation queries the response was YES. [2025-03-04 02:27:29,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9359 conditions, 3908 events. 2461/3908 cut-off events. For 2022/2022 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 20177 event pairs, 536 based on Foata normal form. 80/3980 useless extension candidates. Maximal degree in co-relation 5114. Up to 2578 conditions per place. [2025-03-04 02:27:29,663 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 65 selfloop transitions, 4 changer transitions 4/82 dead transitions. [2025-03-04 02:27:29,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 453 flow [2025-03-04 02:27:29,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:27:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:27:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-04 02:27:29,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-03-04 02:27:29,664 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 189 flow. Second operand 4 states and 96 transitions. [2025-03-04 02:27:29,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 453 flow [2025-03-04 02:27:29,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:27:29,668 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 211 flow [2025-03-04 02:27:29,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-03-04 02:27:29,669 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2025-03-04 02:27:29,669 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 211 flow [2025-03-04 02:27:29,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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:27:29,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:29,670 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] [2025-03-04 02:27:29,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:27:29,670 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:29,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash 134948914, now seen corresponding path program 1 times [2025-03-04 02:27:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:29,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29914390] [2025-03-04 02:27:29,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:29,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:29,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:27:29,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:27:29,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:29,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:29,750 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:27:29,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:29,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29914390] [2025-03-04 02:27:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29914390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:29,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:29,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:27:29,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522549128] [2025-03-04 02:27:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:29,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:27:29,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:29,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:27:29,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:27:29,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:27:29,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:29,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:29,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:27:29,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:30,220 INFO L124 PetriNetUnfolderBase]: 3531/5766 cut-off events. [2025-03-04 02:27:30,221 INFO L125 PetriNetUnfolderBase]: For 3995/4031 co-relation queries the response was YES. [2025-03-04 02:27:30,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14884 conditions, 5766 events. 3531/5766 cut-off events. For 3995/4031 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 34162 event pairs, 1205 based on Foata normal form. 128/5872 useless extension candidates. Maximal degree in co-relation 8432. Up to 3056 conditions per place. [2025-03-04 02:27:30,246 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 98 selfloop transitions, 15 changer transitions 0/122 dead transitions. [2025-03-04 02:27:30,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 122 transitions, 705 flow [2025-03-04 02:27:30,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:27:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:27:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-03-04 02:27:30,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-03-04 02:27:30,251 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 211 flow. Second operand 6 states and 144 transitions. [2025-03-04 02:27:30,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 122 transitions, 705 flow [2025-03-04 02:27:30,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 122 transitions, 705 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:27:30,259 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 343 flow [2025-03-04 02:27:30,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2025-03-04 02:27:30,259 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2025-03-04 02:27:30,259 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 343 flow [2025-03-04 02:27:30,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:30,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:30,261 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] [2025-03-04 02:27:30,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:27:30,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:30,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash 590096366, now seen corresponding path program 2 times [2025-03-04 02:27:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:30,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218771753] [2025-03-04 02:27:30,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:30,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:27:30,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:27:30,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:30,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:27:30,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:30,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218771753] [2025-03-04 02:27:30,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218771753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:30,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:30,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:27:30,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865728944] [2025-03-04 02:27:30,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:30,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:27:30,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:30,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:27:30,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:27:30,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:27:30,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 343 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:30,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:30,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:27:30,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:30,917 INFO L124 PetriNetUnfolderBase]: 4662/7456 cut-off events. [2025-03-04 02:27:30,918 INFO L125 PetriNetUnfolderBase]: For 10097/10149 co-relation queries the response was YES. [2025-03-04 02:27:30,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22015 conditions, 7456 events. 4662/7456 cut-off events. For 10097/10149 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 43666 event pairs, 1629 based on Foata normal form. 140/7588 useless extension candidates. Maximal degree in co-relation 13850. Up to 2886 conditions per place. [2025-03-04 02:27:30,949 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 105 selfloop transitions, 13 changer transitions 1/128 dead transitions. [2025-03-04 02:27:30,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 128 transitions, 860 flow [2025-03-04 02:27:30,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:27:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:27:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-03-04 02:27:30,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2025-03-04 02:27:30,950 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 343 flow. Second operand 6 states and 140 transitions. [2025-03-04 02:27:30,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 128 transitions, 860 flow [2025-03-04 02:27:30,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 128 transitions, 858 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 02:27:30,962 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 441 flow [2025-03-04 02:27:30,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-03-04 02:27:30,963 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2025-03-04 02:27:30,963 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 441 flow [2025-03-04 02:27:30,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:30,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:30,963 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] [2025-03-04 02:27:30,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:27:30,964 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:30,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash -280730008, now seen corresponding path program 3 times [2025-03-04 02:27:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758019417] [2025-03-04 02:27:30,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:27:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:30,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:27:30,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 31 statements. [2025-03-04 02:27:30,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:27:30,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:31,053 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:27:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758019417] [2025-03-04 02:27:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758019417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:31,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:31,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:27:31,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825996648] [2025-03-04 02:27:31,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:31,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:27:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:31,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:27:31,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:27:31,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:27:31,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 441 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:31,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:31,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:27:31,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:31,514 INFO L124 PetriNetUnfolderBase]: 3378/5300 cut-off events. [2025-03-04 02:27:31,514 INFO L125 PetriNetUnfolderBase]: For 10037/10037 co-relation queries the response was YES. [2025-03-04 02:27:31,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16579 conditions, 5300 events. 3378/5300 cut-off events. For 10037/10037 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 27353 event pairs, 2471 based on Foata normal form. 41/5335 useless extension candidates. Maximal degree in co-relation 15736. Up to 4525 conditions per place. [2025-03-04 02:27:31,549 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 45 selfloop transitions, 4 changer transitions 27/83 dead transitions. [2025-03-04 02:27:31,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 616 flow [2025-03-04 02:27:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:27:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:27:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-03-04 02:27:31,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2025-03-04 02:27:31,552 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 441 flow. Second operand 6 states and 113 transitions. [2025-03-04 02:27:31,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 616 flow [2025-03-04 02:27:31,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 83 transitions, 600 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 02:27:31,568 INFO L231 Difference]: Finished difference. Result has 80 places, 56 transitions, 327 flow [2025-03-04 02:27:31,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=327, PETRI_PLACES=80, PETRI_TRANSITIONS=56} [2025-03-04 02:27:31,569 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2025-03-04 02:27:31,570 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 56 transitions, 327 flow [2025-03-04 02:27:31,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:31,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:31,571 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] [2025-03-04 02:27:31,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:27:31,571 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:31,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:31,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1159447761, now seen corresponding path program 1 times [2025-03-04 02:27:31,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241115075] [2025-03-04 02:27:31,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:31,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:27:31,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:27:31,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:31,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:31,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241115075] [2025-03-04 02:27:31,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241115075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215826669] [2025-03-04 02:27:31,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:31,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:31,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:31,702 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:27:31,706 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:27:31,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:27:31,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:27:31,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:31,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:31,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 02:27:31,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:31,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:27:31,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215826669] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:31,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:27:31,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-04 02:27:31,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378006959] [2025-03-04 02:27:31,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:31,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:27:31,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:31,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:27:31,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:27:31,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:27:31,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 56 transitions, 327 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:31,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:31,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:27:31,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:32,290 INFO L124 PetriNetUnfolderBase]: 2917/4545 cut-off events. [2025-03-04 02:27:32,290 INFO L125 PetriNetUnfolderBase]: For 8392/8412 co-relation queries the response was YES. [2025-03-04 02:27:32,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14207 conditions, 4545 events. 2917/4545 cut-off events. For 8392/8412 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 23464 event pairs, 677 based on Foata normal form. 20/4489 useless extension candidates. Maximal degree in co-relation 14166. Up to 2865 conditions per place. [2025-03-04 02:27:32,327 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 52 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2025-03-04 02:27:32,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 520 flow [2025-03-04 02:27:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:27:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:27:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-03-04 02:27:32,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2025-03-04 02:27:32,329 INFO L175 Difference]: Start difference. First operand has 80 places, 56 transitions, 327 flow. Second operand 5 states and 92 transitions. [2025-03-04 02:27:32,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 520 flow [2025-03-04 02:27:32,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 493 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 02:27:32,343 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 347 flow [2025-03-04 02:27:32,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2025-03-04 02:27:32,344 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2025-03-04 02:27:32,344 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 347 flow [2025-03-04 02:27:32,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:27:32,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:32,344 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] [2025-03-04 02:27:32,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:27:32,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:32,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:32,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash -362069113, now seen corresponding path program 1 times [2025-03-04 02:27:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:32,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171019743] [2025-03-04 02:27:32,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:27:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:32,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 02:27:32,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 02:27:32,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:27:32,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:27:32,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:32,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171019743] [2025-03-04 02:27:32,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171019743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:32,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:32,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:27:32,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788620080] [2025-03-04 02:27:32,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:32,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:27:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:32,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:27:32,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:27:32,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 02:27:32,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:27:32,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:32,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 02:27:32,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:33,050 INFO L124 PetriNetUnfolderBase]: 2404/3895 cut-off events. [2025-03-04 02:27:33,050 INFO L125 PetriNetUnfolderBase]: For 9535/9557 co-relation queries the response was YES. [2025-03-04 02:27:33,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12552 conditions, 3895 events. 2404/3895 cut-off events. For 9535/9557 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 19424 event pairs, 508 based on Foata normal form. 78/3964 useless extension candidates. Maximal degree in co-relation 12513. Up to 2127 conditions per place. [2025-03-04 02:27:33,076 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 73 selfloop transitions, 15 changer transitions 2/99 dead transitions. [2025-03-04 02:27:33,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 683 flow [2025-03-04 02:27:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:27:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:27:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-03-04 02:27:33,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2025-03-04 02:27:33,077 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 347 flow. Second operand 6 states and 136 transitions. [2025-03-04 02:27:33,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 683 flow [2025-03-04 02:27:33,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 672 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:27:33,087 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 411 flow [2025-03-04 02:27:33,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2025-03-04 02:27:33,088 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2025-03-04 02:27:33,088 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 411 flow [2025-03-04 02:27:33,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:27:33,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:33,088 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:33,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:27:33,088 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:33,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:33,089 INFO L85 PathProgramCache]: Analyzing trace with hash 233877883, now seen corresponding path program 2 times [2025-03-04 02:27:33,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:33,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165854893] [2025-03-04 02:27:33,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:33,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:27:33,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:27:33,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:33,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:27:33,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:33,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165854893] [2025-03-04 02:27:33,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165854893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:27:33,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520372473] [2025-03-04 02:27:33,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:27:33,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:27:33,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:27:33,207 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:27:33,208 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:27:33,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:27:33,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:27:33,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:27:33,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:33,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:27:33,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:27:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:27:33,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:27:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 02:27:33,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520372473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:27:33,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:27:33,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-03-04 02:27:33,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139985196] [2025-03-04 02:27:33,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:27:33,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:27:33,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:33,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:27:33,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:27:33,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2025-03-04 02:27:33,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 411 flow. Second operand has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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:27:33,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:33,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2025-03-04 02:27:33,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:36,095 INFO L124 PetriNetUnfolderBase]: 17380/25154 cut-off events. [2025-03-04 02:27:36,096 INFO L125 PetriNetUnfolderBase]: For 71442/71442 co-relation queries the response was YES. [2025-03-04 02:27:36,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82464 conditions, 25154 events. 17380/25154 cut-off events. For 71442/71442 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 141972 event pairs, 3071 based on Foata normal form. 381/25535 useless extension candidates. Maximal degree in co-relation 82422. Up to 5637 conditions per place. [2025-03-04 02:27:36,279 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 403 selfloop transitions, 98 changer transitions 41/544 dead transitions. [2025-03-04 02:27:36,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 544 transitions, 4513 flow [2025-03-04 02:27:36,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 02:27:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 02:27:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 579 transitions. [2025-03-04 02:27:36,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.415351506456241 [2025-03-04 02:27:36,282 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 411 flow. Second operand 34 states and 579 transitions. [2025-03-04 02:27:36,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 544 transitions, 4513 flow [2025-03-04 02:27:36,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 544 transitions, 4309 flow, removed 49 selfloop flow, removed 3 redundant places. [2025-03-04 02:27:36,332 INFO L231 Difference]: Finished difference. Result has 136 places, 174 transitions, 1771 flow [2025-03-04 02:27:36,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1771, PETRI_PLACES=136, PETRI_TRANSITIONS=174} [2025-03-04 02:27:36,332 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 95 predicate places. [2025-03-04 02:27:36,332 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 174 transitions, 1771 flow [2025-03-04 02:27:36,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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:27:36,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:27:36,333 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:36,339 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:27:36,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 02:27:36,533 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 02:27:36,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:27:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash -439520653, now seen corresponding path program 3 times [2025-03-04 02:27:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:27:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446346749] [2025-03-04 02:27:36,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:27:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:27:36,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-03-04 02:27:36,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:27:36,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:27:36,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:27:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 02:27:36,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:27:36,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446346749] [2025-03-04 02:27:36,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446346749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:27:36,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:27:36,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:27:36,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83961904] [2025-03-04 02:27:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:27:36,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:27:36,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:27:36,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:27:36,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:27:36,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2025-03-04 02:27:36,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 174 transitions, 1771 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:27:36,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:27:36,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2025-03-04 02:27:36,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:27:38,609 INFO L124 PetriNetUnfolderBase]: 13476/19808 cut-off events. [2025-03-04 02:27:38,609 INFO L125 PetriNetUnfolderBase]: For 164762/164762 co-relation queries the response was YES. [2025-03-04 02:27:38,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91714 conditions, 19808 events. 13476/19808 cut-off events. For 164762/164762 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 113065 event pairs, 750 based on Foata normal form. 169/19974 useless extension candidates. Maximal degree in co-relation 91646. Up to 7798 conditions per place. [2025-03-04 02:27:38,721 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 0 selfloop transitions, 0 changer transitions 307/307 dead transitions. [2025-03-04 02:27:38,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 307 transitions, 3566 flow [2025-03-04 02:27:38,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:27:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:27:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 198 transitions. [2025-03-04 02:27:38,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2025-03-04 02:27:38,722 INFO L175 Difference]: Start difference. First operand has 136 places, 174 transitions, 1771 flow. Second operand 11 states and 198 transitions. [2025-03-04 02:27:38,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 307 transitions, 3566 flow [2025-03-04 02:27:39,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 307 transitions, 3317 flow, removed 98 selfloop flow, removed 11 redundant places. [2025-03-04 02:27:39,097 INFO L231 Difference]: Finished difference. Result has 115 places, 0 transitions, 0 flow [2025-03-04 02:27:39,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=115, PETRI_TRANSITIONS=0} [2025-03-04 02:27:39,098 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2025-03-04 02:27:39,098 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 0 transitions, 0 flow [2025-03-04 02:27:39,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:27:39,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-04 02:27:39,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-04 02:27:39,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-04 02:27:39,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-04 02:27:39,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:27:39,101 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:27:39,103 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:27:39,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:27:39,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:27:39 BasicIcfg [2025-03-04 02:27:39,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:27:39,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:27:39,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:27:39,107 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:27:39,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:27:24" (3/4) ... [2025-03-04 02:27:39,108 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:27:39,110 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 02:27:39,110 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 02:27:39,110 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 02:27:39,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 85 nodes and edges [2025-03-04 02:27:39,115 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-03-04 02:27:39,115 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 02:27:39,115 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 02:27:39,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:27:39,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:27:39,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:27:39,173 INFO L158 Benchmark]: Toolchain (without parser) took 15139.55ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 906.0MB). Free memory was 129.3MB in the beginning and 234.9MB in the end (delta: -105.6MB). Peak memory consumption was 795.7MB. Max. memory is 16.1GB. [2025-03-04 02:27:39,173 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:27:39,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.29ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 117.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:27:39,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.26ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 115.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:27:39,174 INFO L158 Benchmark]: Boogie Preprocessor took 37.91ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 114.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:27:39,174 INFO L158 Benchmark]: IcfgBuilder took 496.82ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 76.5MB in the end (delta: 37.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 02:27:39,174 INFO L158 Benchmark]: TraceAbstraction took 14280.82ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 906.0MB). Free memory was 76.1MB in the beginning and 239.1MB in the end (delta: -163.0MB). Peak memory consumption was 846.0MB. Max. memory is 16.1GB. [2025-03-04 02:27:39,174 INFO L158 Benchmark]: Witness Printer took 66.47ms. Allocated memory is still 1.1GB. Free memory was 239.1MB in the beginning and 234.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:27:39,175 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.29ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 117.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.26ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 115.8MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.91ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 114.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 496.82ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 76.5MB in the end (delta: 37.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14280.82ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 906.0MB). Free memory was 76.1MB in the beginning and 239.1MB in the end (delta: -163.0MB). Peak memory consumption was 846.0MB. Max. memory is 16.1GB. * Witness Printer took 66.47ms. Allocated memory is still 1.1GB. Free memory was 239.1MB in the beginning and 234.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 59 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.2s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 878 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 811 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3869 IncrementalHoareTripleChecker+Invalid, 3907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 16 mSDtfsCounter, 3869 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 276 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1771occurred in iteration=12, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 521 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 1821 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1073 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 23 InterpolantComputations, 12 PerfectInterpolantSequences, 34/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:27:39,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE