./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -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 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:25:07,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:25:08,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:25:08,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:25:08,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:25:08,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:25:08,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:25:08,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:25:08,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:25:08,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:25:08,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:25:08,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:25:08,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:25:08,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:25:08,031 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:25:08,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:25:08,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:25:08,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:25:08,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:25:08,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:25:08,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:25:08,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:25:08,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:25:08,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:25:08,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:25:08,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:25:08,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:25:08,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:25:08,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:25:08,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:25:08,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:25:08,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:25:08,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:25:08,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:25:08,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:25:08,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:25:08,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:25:08,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:25:08,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:25:08,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:25:08,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:25:08,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:25:08,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:25:08,034 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-03-08 17:25:08,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:25:08,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:25:08,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:25:08,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:25:08,297 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:25:08,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-08 17:25:09,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3471526/907bca511f324e46914603ae391fc1d5/FLAG48ed67836 [2025-03-08 17:25:09,705 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:25:09,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-08 17:25:09,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3471526/907bca511f324e46914603ae391fc1d5/FLAG48ed67836 [2025-03-08 17:25:09,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3471526/907bca511f324e46914603ae391fc1d5 [2025-03-08 17:25:09,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:25:09,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:25:09,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:25:09,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:25:09,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:25:09,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:09" (1/1) ... [2025-03-08 17:25:09,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd39b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:09, skipping insertion in model container [2025-03-08 17:25:09,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:09" (1/1) ... [2025-03-08 17:25:09,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:25:09,881 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-03-08 17:25:09,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:25:09,987 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:25:09,994 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-03-08 17:25:10,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:25:10,061 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:25:10,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10 WrapperNode [2025-03-08 17:25:10,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:25:10,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:25:10,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:25:10,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:25:10,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,102 INFO L138 Inliner]: procedures = 165, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-03-08 17:25:10,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:25:10,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:25:10,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:25:10,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:25:10,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,131 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-03-08 17:25:10,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:25:10,141 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:25:10,141 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:25:10,141 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:25:10,142 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (1/1) ... [2025-03-08 17:25:10,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:25:10,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:25:10,168 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-08 17:25:10,176 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-08 17:25:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:25:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:25:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-08 17:25:10,189 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-08 17:25:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:25:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:25:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:25:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:25:10,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:25:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:25:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:25:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:25:10,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:25:10,191 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:25:10,277 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:25:10,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:25:10,480 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:25:10,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:25:10,596 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:25:10,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:25:10,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:10 BoogieIcfgContainer [2025-03-08 17:25:10,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:25:10,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:25:10,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:25:10,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:25:10,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:25:09" (1/3) ... [2025-03-08 17:25:10,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecc9231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:10, skipping insertion in model container [2025-03-08 17:25:10,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:10" (2/3) ... [2025-03-08 17:25:10,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecc9231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:10, skipping insertion in model container [2025-03-08 17:25:10,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:10" (3/3) ... [2025-03-08 17:25:10,605 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-08 17:25:10,618 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:25:10,619 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 31 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-08 17:25:10,619 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:25:10,663 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 17:25:10,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 78 flow [2025-03-08 17:25:10,713 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-03-08 17:25:10,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:25:10,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 7/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-08 17:25:10,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 78 flow [2025-03-08 17:25:10,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 36 transitions, 75 flow [2025-03-08 17:25:10,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:25:10,741 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;@49d716ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:25:10,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-08 17:25:10,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:25:10,748 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-03-08 17:25:10,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:25:10,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:10,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:10,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:10,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2102816857, now seen corresponding path program 1 times [2025-03-08 17:25:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:10,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147277587] [2025-03-08 17:25:10,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:10,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:25:10,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:25:10,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:10,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:11,169 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-08 17:25:11,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:11,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147277587] [2025-03-08 17:25:11,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147277587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:11,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:11,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:25:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187908667] [2025-03-08 17:25:11,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:11,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:25:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:11,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:25:11,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:25:11,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-08 17:25:11,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-08 17:25:11,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:11,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-08 17:25:11,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:11,454 INFO L124 PetriNetUnfolderBase]: 218/450 cut-off events. [2025-03-08 17:25:11,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:25:11,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 450 events. 218/450 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1930 event pairs, 20 based on Foata normal form. 37/407 useless extension candidates. Maximal degree in co-relation 851. Up to 241 conditions per place. [2025-03-08 17:25:11,461 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 47 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2025-03-08 17:25:11,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 69 transitions, 265 flow [2025-03-08 17:25:11,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:25:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:25:11,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-03-08 17:25:11,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536036036036036 [2025-03-08 17:25:11,473 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 75 flow. Second operand 6 states and 119 transitions. [2025-03-08 17:25:11,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 69 transitions, 265 flow [2025-03-08 17:25:11,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 69 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:25:11,480 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 168 flow [2025-03-08 17:25:11,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2025-03-08 17:25:11,484 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-08 17:25:11,485 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 168 flow [2025-03-08 17:25:11,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-08 17:25:11,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:11,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:11,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:25:11,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:11,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash 762782622, now seen corresponding path program 1 times [2025-03-08 17:25:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47145291] [2025-03-08 17:25:11,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:11,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:25:11,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:25:11,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:11,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:11,605 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-08 17:25:11,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:11,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47145291] [2025-03-08 17:25:11,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47145291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:11,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:11,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:25:11,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735159849] [2025-03-08 17:25:11,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:11,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:25:11,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:11,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:25:11,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:25:11,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-08 17:25:11,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-08 17:25:11,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:11,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-08 17:25:11,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:11,793 INFO L124 PetriNetUnfolderBase]: 279/560 cut-off events. [2025-03-08 17:25:11,793 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2025-03-08 17:25:11,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 560 events. 279/560 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2496 event pairs, 55 based on Foata normal form. 20/539 useless extension candidates. Maximal degree in co-relation 1387. Up to 304 conditions per place. [2025-03-08 17:25:11,797 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 58 selfloop transitions, 25 changer transitions 0/89 dead transitions. [2025-03-08 17:25:11,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 89 transitions, 474 flow [2025-03-08 17:25:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:25:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:25:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-08 17:25:11,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-03-08 17:25:11,798 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 168 flow. Second operand 6 states and 108 transitions. [2025-03-08 17:25:11,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 89 transitions, 474 flow [2025-03-08 17:25:11,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 89 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:25:11,803 INFO L231 Difference]: Finished difference. Result has 51 places, 60 transitions, 366 flow [2025-03-08 17:25:11,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=51, PETRI_TRANSITIONS=60} [2025-03-08 17:25:11,804 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2025-03-08 17:25:11,804 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 366 flow [2025-03-08 17:25:11,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-08 17:25:11,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:11,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:11,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:25:11,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:11,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:11,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1739179151, now seen corresponding path program 1 times [2025-03-08 17:25:11,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:11,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173937090] [2025-03-08 17:25:11,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:11,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:11,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:25:11,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:25:11,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:11,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:12,027 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-08 17:25:12,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:12,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173937090] [2025-03-08 17:25:12,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173937090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:12,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:12,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:25:12,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624851563] [2025-03-08 17:25:12,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:12,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:25:12,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:12,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:25:12,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:25:12,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-08 17:25:12,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 60 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-08 17:25:12,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:12,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-08 17:25:12,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:12,307 INFO L124 PetriNetUnfolderBase]: 399/859 cut-off events. [2025-03-08 17:25:12,307 INFO L125 PetriNetUnfolderBase]: For 1252/1269 co-relation queries the response was YES. [2025-03-08 17:25:12,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 859 events. 399/859 cut-off events. For 1252/1269 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4770 event pairs, 87 based on Foata normal form. 16/820 useless extension candidates. Maximal degree in co-relation 2722. Up to 360 conditions per place. [2025-03-08 17:25:12,313 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 87 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2025-03-08 17:25:12,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 127 transitions, 942 flow [2025-03-08 17:25:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:25:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:25:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2025-03-08 17:25:12,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6138996138996139 [2025-03-08 17:25:12,315 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 366 flow. Second operand 7 states and 159 transitions. [2025-03-08 17:25:12,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 127 transitions, 942 flow [2025-03-08 17:25:12,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:25:12,324 INFO L231 Difference]: Finished difference. Result has 60 places, 76 transitions, 588 flow [2025-03-08 17:25:12,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=60, PETRI_TRANSITIONS=76} [2025-03-08 17:25:12,325 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2025-03-08 17:25:12,325 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 76 transitions, 588 flow [2025-03-08 17:25:12,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-08 17:25:12,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:12,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:12,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:25:12,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:12,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2038094019, now seen corresponding path program 2 times [2025-03-08 17:25:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064087696] [2025-03-08 17:25:12,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:25:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:12,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:25:12,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:25:12,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:25:12,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:12,490 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-08 17:25:12,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064087696] [2025-03-08 17:25:12,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064087696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:12,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:25:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665541467] [2025-03-08 17:25:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:12,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:25:12,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:12,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:25:12,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:25:12,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-08 17:25:12,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 76 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:25:12,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:12,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-08 17:25:12,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:12,703 INFO L124 PetriNetUnfolderBase]: 430/919 cut-off events. [2025-03-08 17:25:12,704 INFO L125 PetriNetUnfolderBase]: For 2139/2183 co-relation queries the response was YES. [2025-03-08 17:25:12,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3353 conditions, 919 events. 430/919 cut-off events. For 2139/2183 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4983 event pairs, 48 based on Foata normal form. 34/953 useless extension candidates. Maximal degree in co-relation 3328. Up to 311 conditions per place. [2025-03-08 17:25:12,711 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 131 selfloop transitions, 10 changer transitions 0/156 dead transitions. [2025-03-08 17:25:12,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 156 transitions, 1540 flow [2025-03-08 17:25:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:25:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:25:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-08 17:25:12,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-08 17:25:12,713 INFO L175 Difference]: Start difference. First operand has 60 places, 76 transitions, 588 flow. Second operand 5 states and 110 transitions. [2025-03-08 17:25:12,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 156 transitions, 1540 flow [2025-03-08 17:25:12,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 156 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:25:12,722 INFO L231 Difference]: Finished difference. Result has 64 places, 82 transitions, 630 flow [2025-03-08 17:25:12,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=630, PETRI_PLACES=64, PETRI_TRANSITIONS=82} [2025-03-08 17:25:12,723 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2025-03-08 17:25:12,724 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 82 transitions, 630 flow [2025-03-08 17:25:12,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:25:12,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:12,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:12,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:25:12,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:12,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1142161717, now seen corresponding path program 3 times [2025-03-08 17:25:12,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:12,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029408060] [2025-03-08 17:25:12,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:25:12,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:12,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:25:12,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:25:12,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:25:12,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:12,905 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-08 17:25:12,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:12,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029408060] [2025-03-08 17:25:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029408060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:12,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:12,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:25:12,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247126189] [2025-03-08 17:25:12,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:12,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:25:12,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:12,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:25:12,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:25:12,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-08 17:25:12,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 82 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-08 17:25:12,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:12,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-08 17:25:12,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:13,150 INFO L124 PetriNetUnfolderBase]: 559/1195 cut-off events. [2025-03-08 17:25:13,151 INFO L125 PetriNetUnfolderBase]: For 2941/2991 co-relation queries the response was YES. [2025-03-08 17:25:13,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 1195 events. 559/1195 cut-off events. For 2941/2991 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7139 event pairs, 24 based on Foata normal form. 50/1241 useless extension candidates. Maximal degree in co-relation 4773. Up to 597 conditions per place. [2025-03-08 17:25:13,160 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 106 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2025-03-08 17:25:13,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 1316 flow [2025-03-08 17:25:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:25:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:25:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-08 17:25:13,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-03-08 17:25:13,163 INFO L175 Difference]: Start difference. First operand has 64 places, 82 transitions, 630 flow. Second operand 6 states and 126 transitions. [2025-03-08 17:25:13,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 1316 flow [2025-03-08 17:25:13,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 143 transitions, 1308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:25:13,172 INFO L231 Difference]: Finished difference. Result has 70 places, 92 transitions, 748 flow [2025-03-08 17:25:13,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=748, PETRI_PLACES=70, PETRI_TRANSITIONS=92} [2025-03-08 17:25:13,173 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2025-03-08 17:25:13,173 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 92 transitions, 748 flow [2025-03-08 17:25:13,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-08 17:25:13,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:13,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:13,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:25:13,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:13,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:13,174 INFO L85 PathProgramCache]: Analyzing trace with hash 364367759, now seen corresponding path program 4 times [2025-03-08 17:25:13,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:13,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603809198] [2025-03-08 17:25:13,174 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:25:13,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:13,183 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-03-08 17:25:13,186 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 14 statements. [2025-03-08 17:25:13,186 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 17:25:13,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:13,249 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-08 17:25:13,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:13,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603809198] [2025-03-08 17:25:13,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603809198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:13,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:13,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:25:13,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010466062] [2025-03-08 17:25:13,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:13,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:25:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:13,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:25:13,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:25:13,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-08 17:25:13,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 92 transitions, 748 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:25:13,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:13,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-08 17:25:13,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:13,504 INFO L124 PetriNetUnfolderBase]: 591/1283 cut-off events. [2025-03-08 17:25:13,504 INFO L125 PetriNetUnfolderBase]: For 4024/4088 co-relation queries the response was YES. [2025-03-08 17:25:13,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5541 conditions, 1283 events. 591/1283 cut-off events. For 4024/4088 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7491 event pairs, 19 based on Foata normal form. 57/1339 useless extension candidates. Maximal degree in co-relation 5512. Up to 435 conditions per place. [2025-03-08 17:25:13,514 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 163 selfloop transitions, 35 changer transitions 0/213 dead transitions. [2025-03-08 17:25:13,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 213 transitions, 2122 flow [2025-03-08 17:25:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:25:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:25:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2025-03-08 17:25:13,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6640926640926641 [2025-03-08 17:25:13,515 INFO L175 Difference]: Start difference. First operand has 70 places, 92 transitions, 748 flow. Second operand 7 states and 172 transitions. [2025-03-08 17:25:13,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 213 transitions, 2122 flow [2025-03-08 17:25:13,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 213 transitions, 2094 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-08 17:25:13,527 INFO L231 Difference]: Finished difference. Result has 77 places, 111 transitions, 1016 flow [2025-03-08 17:25:13,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1016, PETRI_PLACES=77, PETRI_TRANSITIONS=111} [2025-03-08 17:25:13,531 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2025-03-08 17:25:13,531 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 1016 flow [2025-03-08 17:25:13,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:25:13,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:13,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:13,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:25:13,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:13,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:13,532 INFO L85 PathProgramCache]: Analyzing trace with hash 926405535, now seen corresponding path program 5 times [2025-03-08 17:25:13,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:13,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506113805] [2025-03-08 17:25:13,532 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:25:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:13,540 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:25:13,545 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:25:13,546 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:25:13,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:13,663 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-08 17:25:13,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:13,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506113805] [2025-03-08 17:25:13,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506113805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:13,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:13,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:25:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233376468] [2025-03-08 17:25:13,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:13,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:25:13,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:13,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:25:13,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:25:13,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-08 17:25:13,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 1016 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:25:13,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:13,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-08 17:25:13,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:13,807 INFO L124 PetriNetUnfolderBase]: 188/497 cut-off events. [2025-03-08 17:25:13,808 INFO L125 PetriNetUnfolderBase]: For 2616/2632 co-relation queries the response was YES. [2025-03-08 17:25:13,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 497 events. 188/497 cut-off events. For 2616/2632 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2539 event pairs, 9 based on Foata normal form. 27/523 useless extension candidates. Maximal degree in co-relation 2322. Up to 213 conditions per place. [2025-03-08 17:25:13,812 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 72 selfloop transitions, 38 changer transitions 0/122 dead transitions. [2025-03-08 17:25:13,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 1349 flow [2025-03-08 17:25:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:25:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:25:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-08 17:25:13,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2025-03-08 17:25:13,813 INFO L175 Difference]: Start difference. First operand has 77 places, 111 transitions, 1016 flow. Second operand 5 states and 116 transitions. [2025-03-08 17:25:13,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 1349 flow [2025-03-08 17:25:13,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 122 transitions, 1126 flow, removed 28 selfloop flow, removed 10 redundant places. [2025-03-08 17:25:13,821 INFO L231 Difference]: Finished difference. Result has 72 places, 92 transitions, 852 flow [2025-03-08 17:25:13,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=852, PETRI_PLACES=72, PETRI_TRANSITIONS=92} [2025-03-08 17:25:13,824 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 39 predicate places. [2025-03-08 17:25:13,824 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 92 transitions, 852 flow [2025-03-08 17:25:13,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:25:13,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:13,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:13,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:25:13,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:13,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1156186700, now seen corresponding path program 1 times [2025-03-08 17:25:13,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:13,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241730686] [2025-03-08 17:25:13,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:13,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:13,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:25:13,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:25:13,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:13,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:14,015 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-08 17:25:14,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:14,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241730686] [2025-03-08 17:25:14,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241730686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:14,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:25:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036866003] [2025-03-08 17:25:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:14,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:25:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:14,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:25:14,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:25:14,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-08 17:25:14,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 92 transitions, 852 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-08 17:25:14,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:14,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-08 17:25:14,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:14,273 INFO L124 PetriNetUnfolderBase]: 274/670 cut-off events. [2025-03-08 17:25:14,274 INFO L125 PetriNetUnfolderBase]: For 2893/2920 co-relation queries the response was YES. [2025-03-08 17:25:14,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3145 conditions, 670 events. 274/670 cut-off events. For 2893/2920 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3587 event pairs, 30 based on Foata normal form. 16/686 useless extension candidates. Maximal degree in co-relation 3114. Up to 359 conditions per place. [2025-03-08 17:25:14,278 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 144 selfloop transitions, 37 changer transitions 0/191 dead transitions. [2025-03-08 17:25:14,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 191 transitions, 2015 flow [2025-03-08 17:25:14,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:25:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:25:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2025-03-08 17:25:14,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885885885885885 [2025-03-08 17:25:14,279 INFO L175 Difference]: Start difference. First operand has 72 places, 92 transitions, 852 flow. Second operand 9 states and 196 transitions. [2025-03-08 17:25:14,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 191 transitions, 2015 flow [2025-03-08 17:25:14,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 191 transitions, 1886 flow, removed 29 selfloop flow, removed 2 redundant places. [2025-03-08 17:25:14,287 INFO L231 Difference]: Finished difference. Result has 84 places, 119 transitions, 1186 flow [2025-03-08 17:25:14,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1186, PETRI_PLACES=84, PETRI_TRANSITIONS=119} [2025-03-08 17:25:14,288 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 51 predicate places. [2025-03-08 17:25:14,288 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 119 transitions, 1186 flow [2025-03-08 17:25:14,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-08 17:25:14,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:14,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:14,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:25:14,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:14,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2105617716, now seen corresponding path program 2 times [2025-03-08 17:25:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260562415] [2025-03-08 17:25:14,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:25:14,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:14,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:25:14,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:25:14,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:25:14,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:14,489 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-08 17:25:14,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:14,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260562415] [2025-03-08 17:25:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260562415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:14,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:14,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:25:14,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878073752] [2025-03-08 17:25:14,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:14,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:25:14,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:14,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:25:14,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:25:14,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-08 17:25:14,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 119 transitions, 1186 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-08 17:25:14,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:14,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-08 17:25:14,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:14,811 INFO L124 PetriNetUnfolderBase]: 308/780 cut-off events. [2025-03-08 17:25:14,811 INFO L125 PetriNetUnfolderBase]: For 4024/4052 co-relation queries the response was YES. [2025-03-08 17:25:14,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 780 events. 308/780 cut-off events. For 4024/4052 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4397 event pairs, 71 based on Foata normal form. 14/794 useless extension candidates. Maximal degree in co-relation 3731. Up to 472 conditions per place. [2025-03-08 17:25:14,816 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 147 selfloop transitions, 34 changer transitions 0/191 dead transitions. [2025-03-08 17:25:14,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 191 transitions, 2129 flow [2025-03-08 17:25:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 17:25:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 17:25:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2025-03-08 17:25:14,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5855855855855856 [2025-03-08 17:25:14,818 INFO L175 Difference]: Start difference. First operand has 84 places, 119 transitions, 1186 flow. Second operand 9 states and 195 transitions. [2025-03-08 17:25:14,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 191 transitions, 2129 flow [2025-03-08 17:25:14,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 191 transitions, 2075 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-03-08 17:25:14,828 INFO L231 Difference]: Finished difference. Result has 96 places, 134 transitions, 1440 flow [2025-03-08 17:25:14,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1440, PETRI_PLACES=96, PETRI_TRANSITIONS=134} [2025-03-08 17:25:14,829 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2025-03-08 17:25:14,829 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 134 transitions, 1440 flow [2025-03-08 17:25:14,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-08 17:25:14,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:14,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:14,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:25:14,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:14,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:14,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1719994451, now seen corresponding path program 1 times [2025-03-08 17:25:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:14,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676678572] [2025-03-08 17:25:14,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:14,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 17:25:14,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 17:25:14,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:14,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:14,974 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-08 17:25:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676678572] [2025-03-08 17:25:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676678572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:25:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45637112] [2025-03-08 17:25:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:14,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:25:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:14,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:25:14,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:25:14,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-08 17:25:14,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 134 transitions, 1440 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-08 17:25:14,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:14,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-08 17:25:14,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:15,252 INFO L124 PetriNetUnfolderBase]: 367/925 cut-off events. [2025-03-08 17:25:15,252 INFO L125 PetriNetUnfolderBase]: For 5863/5889 co-relation queries the response was YES. [2025-03-08 17:25:15,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 925 events. 367/925 cut-off events. For 5863/5889 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5175 event pairs, 40 based on Foata normal form. 26/951 useless extension candidates. Maximal degree in co-relation 4672. Up to 243 conditions per place. [2025-03-08 17:25:15,258 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 155 selfloop transitions, 79 changer transitions 0/244 dead transitions. [2025-03-08 17:25:15,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 244 transitions, 2878 flow [2025-03-08 17:25:15,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:25:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:25:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2025-03-08 17:25:15,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2025-03-08 17:25:15,259 INFO L175 Difference]: Start difference. First operand has 96 places, 134 transitions, 1440 flow. Second operand 10 states and 216 transitions. [2025-03-08 17:25:15,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 244 transitions, 2878 flow [2025-03-08 17:25:15,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 244 transitions, 2738 flow, removed 53 selfloop flow, removed 3 redundant places. [2025-03-08 17:25:15,273 INFO L231 Difference]: Finished difference. Result has 108 places, 173 transitions, 2129 flow [2025-03-08 17:25:15,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2129, PETRI_PLACES=108, PETRI_TRANSITIONS=173} [2025-03-08 17:25:15,274 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 75 predicate places. [2025-03-08 17:25:15,274 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 173 transitions, 2129 flow [2025-03-08 17:25:15,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-08 17:25:15,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:15,274 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:15,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:25:15,275 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:15,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1904048939, now seen corresponding path program 1 times [2025-03-08 17:25:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:15,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123513092] [2025-03-08 17:25:15,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:15,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 17:25:15,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 17:25:15,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:15,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:25:15,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:15,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123513092] [2025-03-08 17:25:15,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123513092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:15,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:15,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:25:15,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505845748] [2025-03-08 17:25:15,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:15,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:25:15,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:15,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:25:15,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:25:15,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-08 17:25:15,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 173 transitions, 2129 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-08 17:25:15,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:15,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-08 17:25:15,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:15,486 INFO L124 PetriNetUnfolderBase]: 315/812 cut-off events. [2025-03-08 17:25:15,486 INFO L125 PetriNetUnfolderBase]: For 7297/7337 co-relation queries the response was YES. [2025-03-08 17:25:15,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4583 conditions, 812 events. 315/812 cut-off events. For 7297/7337 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4133 event pairs, 75 based on Foata normal form. 15/826 useless extension candidates. Maximal degree in co-relation 4534. Up to 657 conditions per place. [2025-03-08 17:25:15,492 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 144 selfloop transitions, 7 changer transitions 13/172 dead transitions. [2025-03-08 17:25:15,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 172 transitions, 2358 flow [2025-03-08 17:25:15,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:25:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:25:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-08 17:25:15,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-03-08 17:25:15,493 INFO L175 Difference]: Start difference. First operand has 108 places, 173 transitions, 2129 flow. Second operand 5 states and 95 transitions. [2025-03-08 17:25:15,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 172 transitions, 2358 flow [2025-03-08 17:25:15,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 172 transitions, 2179 flow, removed 80 selfloop flow, removed 3 redundant places. [2025-03-08 17:25:15,509 INFO L231 Difference]: Finished difference. Result has 111 places, 155 transitions, 1744 flow [2025-03-08 17:25:15,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1744, PETRI_PLACES=111, PETRI_TRANSITIONS=155} [2025-03-08 17:25:15,510 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 78 predicate places. [2025-03-08 17:25:15,510 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 155 transitions, 1744 flow [2025-03-08 17:25:15,510 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-08 17:25:15,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:15,510 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:25:15,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:25:15,511 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-08 17:25:15,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash 597874344, now seen corresponding path program 1 times [2025-03-08 17:25:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:15,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992043960] [2025-03-08 17:25:15,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:15,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:15,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:25:15,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:25:15,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:15,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:25:15,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:15,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992043960] [2025-03-08 17:25:15,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992043960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:25:15,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338677723] [2025-03-08 17:25:15,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:25:15,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:25:15,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:25:15,850 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-08 17:25:15,851 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-08 17:25:15,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:25:15,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:25:15,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:25:15,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:15,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-08 17:25:15,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:25:15,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 17:25:16,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-08 17:25:16,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 17:25:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:25:16,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:25:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:25:18,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338677723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:25:18,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:25:18,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 30 [2025-03-08 17:25:18,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792942789] [2025-03-08 17:25:18,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:25:18,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 17:25:18,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:18,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 17:25:18,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2025-03-08 17:25:18,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-08 17:25:18,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 155 transitions, 1744 flow. Second operand has 30 states, 30 states have (on average 9.166666666666666) internal successors, (275), 30 states have internal predecessors, (275), 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-08 17:25:18,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:18,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-08 17:25:18,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:19,381 INFO L124 PetriNetUnfolderBase]: 547/1330 cut-off events. [2025-03-08 17:25:19,381 INFO L125 PetriNetUnfolderBase]: For 11355/11369 co-relation queries the response was YES. [2025-03-08 17:25:19,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7400 conditions, 1330 events. 547/1330 cut-off events. For 11355/11369 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7349 event pairs, 46 based on Foata normal form. 40/1370 useless extension candidates. Maximal degree in co-relation 7359. Up to 241 conditions per place. [2025-03-08 17:25:19,388 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 0 selfloop transitions, 0 changer transitions 416/416 dead transitions. [2025-03-08 17:25:19,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 416 transitions, 5360 flow [2025-03-08 17:25:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 17:25:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-08 17:25:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 397 transitions. [2025-03-08 17:25:19,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34612031386224934 [2025-03-08 17:25:19,390 INFO L175 Difference]: Start difference. First operand has 111 places, 155 transitions, 1744 flow. Second operand 31 states and 397 transitions. [2025-03-08 17:25:19,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 416 transitions, 5360 flow [2025-03-08 17:25:19,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 416 transitions, 5230 flow, removed 37 selfloop flow, removed 8 redundant places. [2025-03-08 17:25:19,414 INFO L231 Difference]: Finished difference. Result has 129 places, 0 transitions, 0 flow [2025-03-08 17:25:19,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=0, PETRI_PLACES=129, PETRI_TRANSITIONS=0} [2025-03-08 17:25:19,414 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 96 predicate places. [2025-03-08 17:25:19,415 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 0 transitions, 0 flow [2025-03-08 17:25:19,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.166666666666666) internal successors, (275), 30 states have internal predecessors, (275), 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-08 17:25:19,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-08 17:25:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-08 17:25:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-08 17:25:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-08 17:25:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-08 17:25:19,428 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-08 17:25:19,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 17:25:19,622 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1] [2025-03-08 17:25:19,626 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:25:19,626 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:25:19,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:25:19 BasicIcfg [2025-03-08 17:25:19,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:25:19,632 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:25:19,632 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:25:19,632 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:25:19,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:10" (3/4) ... [2025-03-08 17:25:19,634 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:25:19,636 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure worker [2025-03-08 17:25:19,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-03-08 17:25:19,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-08 17:25:19,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-08 17:25:19,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 17:25:19,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 17:25:19,690 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:25:19,690 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:25:19,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:25:19,691 INFO L158 Benchmark]: Toolchain (without parser) took 9946.82ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 111.0MB in the beginning and 125.0MB in the end (delta: -14.0MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2025-03-08 17:25:19,693 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:25:19,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.14ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 90.8MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 17:25:19,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.97ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:25:19,694 INFO L158 Benchmark]: Boogie Preprocessor took 37.60ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:25:19,694 INFO L158 Benchmark]: IcfgBuilder took 455.62ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 55.8MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 17:25:19,694 INFO L158 Benchmark]: TraceAbstraction took 9033.58ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 54.9MB in the beginning and 131.0MB in the end (delta: -76.1MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2025-03-08 17:25:19,694 INFO L158 Benchmark]: Witness Printer took 58.33ms. Allocated memory is still 268.4MB. Free memory was 131.0MB in the beginning and 125.0MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:25:19,695 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.24ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.14ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 90.8MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.97ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.60ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 455.62ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 55.8MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9033.58ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 54.9MB in the beginning and 131.0MB in the end (delta: -76.1MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Witness Printer took 58.33ms. Allocated memory is still 268.4MB. Free memory was 131.0MB in the beginning and 125.0MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 3 procedures, 54 locations, 65 edges, 5 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: 8.9s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 810 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 789 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2933 IncrementalHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 14 mSDtfsCounter, 2933 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2129occurred in iteration=10, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 213 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 226 ConstructedInterpolants, 12 QuantifiedInterpolants, 2529 SizeOfPredicates, 24 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 5/17 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 17:25:19,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE