./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:26:41,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:26:41,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:26:41,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:26:41,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:26:41,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:26:41,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:26:41,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:26:41,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:26:41,732 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:26:41,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:26:41,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:26:41,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:26:41,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:26:41,733 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:26:41,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:26:41,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:26:41,735 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:26:41,735 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:26:41,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:26:41,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:26:41,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:26:41,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:26:41,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:26:41,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:26:41,736 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:26:41,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:26:41,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:26:41,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:26:41,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:26:41,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:26:41,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:26:41,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:26:41,736 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2025-02-06 04:26:42,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:26:42,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:26:42,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:26:42,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:26:42,116 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:26:42,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-02-06 04:26:43,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/064f809e2/69edf540ea1843c4ad4658a8691c1421/FLAGce4cd633d [2025-02-06 04:26:43,584 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:26:43,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-02-06 04:26:43,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/064f809e2/69edf540ea1843c4ad4658a8691c1421/FLAGce4cd633d [2025-02-06 04:26:43,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/064f809e2/69edf540ea1843c4ad4658a8691c1421 [2025-02-06 04:26:43,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:26:43,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:26:43,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:26:43,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:26:43,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:26:43,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:26:43" (1/1) ... [2025-02-06 04:26:43,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3527605f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:43, skipping insertion in model container [2025-02-06 04:26:43,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:26:43" (1/1) ... [2025-02-06 04:26:43,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:26:43,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[186294,186307] [2025-02-06 04:26:43,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:26:43,971 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:26:44,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[186294,186307] [2025-02-06 04:26:44,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:26:44,061 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:26:44,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44 WrapperNode [2025-02-06 04:26:44,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:26:44,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:26:44,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:26:44,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:26:44,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,108 INFO L138 Inliner]: procedures = 246, calls = 43, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2025-02-06 04:26:44,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:26:44,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:26:44,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:26:44,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:26:44,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,143 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 6, 2]. [2025-02-06 04:26:44,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:26:44,180 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:26:44,181 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:26:44,181 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:26:44,181 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (1/1) ... [2025-02-06 04:26:44,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:26:44,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:26:44,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:26:44,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:26:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-02-06 04:26:44,232 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-02-06 04:26:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:26:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 04:26:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 04:26:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:26:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:26:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:26:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:26:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:26:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:26:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:26:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:26:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 04:26:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 04:26:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 04:26:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:26:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:26:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:26:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:26:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:26:44,235 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:26:44,469 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:26:44,470 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:26:44,700 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:26:44,700 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:26:44,821 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:26:44,822 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:26:44,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:26:44 BoogieIcfgContainer [2025-02-06 04:26:44,823 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:26:44,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:26:44,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:26:44,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:26:44,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:26:43" (1/3) ... [2025-02-06 04:26:44,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23633f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:26:44, skipping insertion in model container [2025-02-06 04:26:44,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:26:44" (2/3) ... [2025-02-06 04:26:44,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23633f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:26:44, skipping insertion in model container [2025-02-06 04:26:44,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:26:44" (3/3) ... [2025-02-06 04:26:44,832 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2025-02-06 04:26:44,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:26:44,844 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 46 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-02-06 04:26:44,846 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:26:44,904 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:26:44,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2025-02-06 04:26:44,984 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2025-02-06 04:26:44,989 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:26:44,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 10/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 141 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2025-02-06 04:26:44,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2025-02-06 04:26:44,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2025-02-06 04:26:45,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:26:45,013 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;@3f9f38e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:26:45,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 04:26:45,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:26:45,017 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-06 04:26:45,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:26:45,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:45,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 04:26:45,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:45,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 11343283, now seen corresponding path program 1 times [2025-02-06 04:26:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:45,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725057243] [2025-02-06 04:26:45,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:45,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:45,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 04:26:45,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 04:26:45,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:45,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:45,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725057243] [2025-02-06 04:26:45,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725057243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:45,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:45,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:26:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324095779] [2025-02-06 04:26:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:45,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:26:45,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:45,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:26:45,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:26:45,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-02-06 04:26:45,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 04:26:45,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:45,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-02-06 04:26:45,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:45,777 INFO L124 PetriNetUnfolderBase]: 466/828 cut-off events. [2025-02-06 04:26:45,777 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-06 04:26:45,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 828 events. 466/828 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3481 event pairs, 345 based on Foata normal form. 3/827 useless extension candidates. Maximal degree in co-relation 1543. Up to 602 conditions per place. [2025-02-06 04:26:45,786 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2025-02-06 04:26:45,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2025-02-06 04:26:45,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:26:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:26:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-02-06 04:26:45,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-02-06 04:26:45,798 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2025-02-06 04:26:45,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2025-02-06 04:26:45,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:26:45,804 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2025-02-06 04:26:45,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-02-06 04:26:45,811 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2025-02-06 04:26:45,811 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2025-02-06 04:26:45,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 04:26:45,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:45,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 04:26:45,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:26:45,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:45,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1983944321, now seen corresponding path program 1 times [2025-02-06 04:26:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:45,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479022078] [2025-02-06 04:26:45,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:45,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:45,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 04:26:45,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 04:26:45,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:45,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:45,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:45,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479022078] [2025-02-06 04:26:45,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479022078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:45,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:26:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583265215] [2025-02-06 04:26:45,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:45,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:26:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:45,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:26:45,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:26:45,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-02-06 04:26:45,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:45,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:45,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-02-06 04:26:45,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:46,175 INFO L124 PetriNetUnfolderBase]: 466/811 cut-off events. [2025-02-06 04:26:46,176 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-02-06 04:26:46,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 811 events. 466/811 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3337 event pairs, 199 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 813. Up to 578 conditions per place. [2025-02-06 04:26:46,182 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 45 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2025-02-06 04:26:46,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 257 flow [2025-02-06 04:26:46,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:26:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:26:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-02-06 04:26:46,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3566666666666667 [2025-02-06 04:26:46,185 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 107 transitions. [2025-02-06 04:26:46,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 257 flow [2025-02-06 04:26:46,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:26:46,187 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2025-02-06 04:26:46,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-02-06 04:26:46,189 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-02-06 04:26:46,189 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2025-02-06 04:26:46,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:26:46,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:46,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:46,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:26:46,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:46,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:46,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1123451577, now seen corresponding path program 1 times [2025-02-06 04:26:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:46,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443374143] [2025-02-06 04:26:46,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:46,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:26:46,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:26:46,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:46,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:46,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:46,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443374143] [2025-02-06 04:26:46,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443374143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:46,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:46,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:26:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137228930] [2025-02-06 04:26:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:46,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:26:46,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:46,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:26:46,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:26:46,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-02-06 04:26:46,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 04:26:46,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:46,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-02-06 04:26:46,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:46,628 INFO L124 PetriNetUnfolderBase]: 602/1097 cut-off events. [2025-02-06 04:26:46,629 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-02-06 04:26:46,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2458 conditions, 1097 events. 602/1097 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5273 event pairs, 251 based on Foata normal form. 69/1165 useless extension candidates. Maximal degree in co-relation 298. Up to 575 conditions per place. [2025-02-06 04:26:46,634 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 47 selfloop transitions, 12 changer transitions 4/67 dead transitions. [2025-02-06 04:26:46,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2025-02-06 04:26:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:26:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:26:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-02-06 04:26:46,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-02-06 04:26:46,635 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2025-02-06 04:26:46,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2025-02-06 04:26:46,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:26:46,638 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 166 flow [2025-02-06 04:26:46,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-02-06 04:26:46,638 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-02-06 04:26:46,638 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 166 flow [2025-02-06 04:26:46,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-06 04:26:46,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:46,639 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:46,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:26:46,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:46,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1634670058, now seen corresponding path program 1 times [2025-02-06 04:26:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:46,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950709513] [2025-02-06 04:26:46,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:46,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:46,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:26:46,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:26:46,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:46,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:46,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:46,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950709513] [2025-02-06 04:26:46,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950709513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:46,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:46,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:26:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799705424] [2025-02-06 04:26:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:46,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:26:46,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:46,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:26:46,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:26:46,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-02-06 04:26:46,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 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-02-06 04:26:46,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:46,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-02-06 04:26:46,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:46,856 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2025-02-06 04:26:46,857 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-02-06 04:26:46,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 408 events. 225/408 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1459 event pairs, 31 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 983. Up to 217 conditions per place. [2025-02-06 04:26:46,859 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-02-06 04:26:46,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 290 flow [2025-02-06 04:26:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:26:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:26:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-02-06 04:26:46,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2025-02-06 04:26:46,863 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 166 flow. Second operand 4 states and 131 transitions. [2025-02-06 04:26:46,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 290 flow [2025-02-06 04:26:46,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:26:46,865 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 104 flow [2025-02-06 04:26:46,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-02-06 04:26:46,866 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2025-02-06 04:26:46,866 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 104 flow [2025-02-06 04:26:46,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 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-02-06 04:26:46,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:46,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:46,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:26:46,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2127056017, now seen corresponding path program 1 times [2025-02-06 04:26:46,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838378616] [2025-02-06 04:26:46,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:46,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:46,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:26:46,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:26:46,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:46,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:47,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:47,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838378616] [2025-02-06 04:26:47,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838378616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:47,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:47,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:26:47,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535742013] [2025-02-06 04:26:47,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:47,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:26:47,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:47,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:26:47,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:26:47,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-02-06 04:26:47,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-02-06 04:26:47,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:47,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-02-06 04:26:47,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:47,809 INFO L124 PetriNetUnfolderBase]: 263/492 cut-off events. [2025-02-06 04:26:47,809 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2025-02-06 04:26:47,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 492 events. 263/492 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1834 event pairs, 19 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 280. Up to 147 conditions per place. [2025-02-06 04:26:47,811 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 64 selfloop transitions, 21 changer transitions 0/87 dead transitions. [2025-02-06 04:26:47,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 429 flow [2025-02-06 04:26:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:26:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:26:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2025-02-06 04:26:47,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28194444444444444 [2025-02-06 04:26:47,813 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 104 flow. Second operand 12 states and 203 transitions. [2025-02-06 04:26:47,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 429 flow [2025-02-06 04:26:47,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:26:47,814 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 207 flow [2025-02-06 04:26:47,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=207, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2025-02-06 04:26:47,815 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-02-06 04:26:47,815 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 207 flow [2025-02-06 04:26:47,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-02-06 04:26:47,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:47,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:47,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:26:47,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:47,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1177956561, now seen corresponding path program 2 times [2025-02-06 04:26:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:47,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832073786] [2025-02-06 04:26:47,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:26:47,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:47,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:26:47,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:26:47,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:26:47,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:48,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832073786] [2025-02-06 04:26:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832073786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:48,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:48,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 04:26:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753459356] [2025-02-06 04:26:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:48,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 04:26:48,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:48,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 04:26:48,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:26:48,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-02-06 04:26:48,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 207 flow. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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-02-06 04:26:48,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:48,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-02-06 04:26:48,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:49,016 INFO L124 PetriNetUnfolderBase]: 447/860 cut-off events. [2025-02-06 04:26:49,017 INFO L125 PetriNetUnfolderBase]: For 945/945 co-relation queries the response was YES. [2025-02-06 04:26:49,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 860 events. 447/860 cut-off events. For 945/945 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4124 event pairs, 33 based on Foata normal form. 2/862 useless extension candidates. Maximal degree in co-relation 2452. Up to 186 conditions per place. [2025-02-06 04:26:49,021 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 91 selfloop transitions, 36 changer transitions 0/129 dead transitions. [2025-02-06 04:26:49,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 129 transitions, 807 flow [2025-02-06 04:26:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:26:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 04:26:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 260 transitions. [2025-02-06 04:26:49,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2025-02-06 04:26:49,023 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 207 flow. Second operand 15 states and 260 transitions. [2025-02-06 04:26:49,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 129 transitions, 807 flow [2025-02-06 04:26:49,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 129 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:26:49,029 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 451 flow [2025-02-06 04:26:49,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=451, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2025-02-06 04:26:49,030 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2025-02-06 04:26:49,030 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 451 flow [2025-02-06 04:26:49,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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-02-06 04:26:49,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:49,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:49,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:26:49,031 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:49,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2093148743, now seen corresponding path program 3 times [2025-02-06 04:26:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:49,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038916049] [2025-02-06 04:26:49,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:26:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:49,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-02-06 04:26:49,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:26:49,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:26:49,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:49,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038916049] [2025-02-06 04:26:49,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038916049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:49,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:49,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:26:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665028515] [2025-02-06 04:26:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:49,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:26:49,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:49,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:26:49,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:26:49,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-02-06 04:26:49,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 451 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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-02-06 04:26:49,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:49,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-02-06 04:26:49,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:50,098 INFO L124 PetriNetUnfolderBase]: 662/1279 cut-off events. [2025-02-06 04:26:50,098 INFO L125 PetriNetUnfolderBase]: For 2915/2915 co-relation queries the response was YES. [2025-02-06 04:26:50,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 1279 events. 662/1279 cut-off events. For 2915/2915 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6775 event pairs, 53 based on Foata normal form. 1/1280 useless extension candidates. Maximal degree in co-relation 4209. Up to 277 conditions per place. [2025-02-06 04:26:50,106 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 104 selfloop transitions, 54 changer transitions 0/160 dead transitions. [2025-02-06 04:26:50,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1242 flow [2025-02-06 04:26:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 04:26:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 04:26:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 292 transitions. [2025-02-06 04:26:50,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28627450980392155 [2025-02-06 04:26:50,107 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 451 flow. Second operand 17 states and 292 transitions. [2025-02-06 04:26:50,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1242 flow [2025-02-06 04:26:50,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 160 transitions, 1233 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:26:50,120 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 813 flow [2025-02-06 04:26:50,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=813, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2025-02-06 04:26:50,121 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2025-02-06 04:26:50,121 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 813 flow [2025-02-06 04:26:50,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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-02-06 04:26:50,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:50,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:50,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:26:50,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:50,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1118241439, now seen corresponding path program 4 times [2025-02-06 04:26:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:50,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746892482] [2025-02-06 04:26:50,122 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:26:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:50,140 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-06 04:26:50,150 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 04:26:50,150 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:26:50,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:50,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:50,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746892482] [2025-02-06 04:26:50,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746892482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:50,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:50,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:26:50,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138862957] [2025-02-06 04:26:50,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:50,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:26:50,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:50,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:26:50,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:26:50,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-02-06 04:26:50,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 813 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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-02-06 04:26:50,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:50,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-02-06 04:26:50,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:51,102 INFO L124 PetriNetUnfolderBase]: 662/1277 cut-off events. [2025-02-06 04:26:51,102 INFO L125 PetriNetUnfolderBase]: For 5047/5047 co-relation queries the response was YES. [2025-02-06 04:26:51,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4726 conditions, 1277 events. 662/1277 cut-off events. For 5047/5047 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6778 event pairs, 83 based on Foata normal form. 1/1278 useless extension candidates. Maximal degree in co-relation 4663. Up to 417 conditions per place. [2025-02-06 04:26:51,110 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 102 selfloop transitions, 58 changer transitions 0/161 dead transitions. [2025-02-06 04:26:51,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 161 transitions, 1455 flow [2025-02-06 04:26:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 04:26:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 04:26:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 291 transitions. [2025-02-06 04:26:51,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2852941176470588 [2025-02-06 04:26:51,112 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 813 flow. Second operand 17 states and 291 transitions. [2025-02-06 04:26:51,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 161 transitions, 1455 flow [2025-02-06 04:26:51,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 161 transitions, 1411 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-02-06 04:26:51,131 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 1007 flow [2025-02-06 04:26:51,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1007, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2025-02-06 04:26:51,132 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2025-02-06 04:26:51,132 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 1007 flow [2025-02-06 04:26:51,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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-02-06 04:26:51,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:51,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:51,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:26:51,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:51,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:51,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1650064025, now seen corresponding path program 1 times [2025-02-06 04:26:51,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:51,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93327257] [2025-02-06 04:26:51,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:26:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:51,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:26:51,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:26:51,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:51,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93327257] [2025-02-06 04:26:51,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93327257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:51,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:51,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:26:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193635210] [2025-02-06 04:26:51,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:51,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:26:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:51,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:26:51,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:26:51,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-02-06 04:26:51,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 1007 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-06 04:26:51,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:51,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-02-06 04:26:51,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:52,723 INFO L124 PetriNetUnfolderBase]: 826/1579 cut-off events. [2025-02-06 04:26:52,723 INFO L125 PetriNetUnfolderBase]: For 8525/8525 co-relation queries the response was YES. [2025-02-06 04:26:52,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6317 conditions, 1579 events. 826/1579 cut-off events. For 8525/8525 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8780 event pairs, 258 based on Foata normal form. 1/1580 useless extension candidates. Maximal degree in co-relation 5535. Up to 966 conditions per place. [2025-02-06 04:26:52,733 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 97 selfloop transitions, 71 changer transitions 33/202 dead transitions. [2025-02-06 04:26:52,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 202 transitions, 2318 flow [2025-02-06 04:26:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 04:26:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 04:26:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 305 transitions. [2025-02-06 04:26:52,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2675438596491228 [2025-02-06 04:26:52,736 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 1007 flow. Second operand 19 states and 305 transitions. [2025-02-06 04:26:52,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 202 transitions, 2318 flow [2025-02-06 04:26:52,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 202 transitions, 2254 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-02-06 04:26:52,763 INFO L231 Difference]: Finished difference. Result has 117 places, 135 transitions, 1639 flow [2025-02-06 04:26:52,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1639, PETRI_PLACES=117, PETRI_TRANSITIONS=135} [2025-02-06 04:26:52,764 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2025-02-06 04:26:52,765 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 135 transitions, 1639 flow [2025-02-06 04:26:52,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-06 04:26:52,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:52,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:52,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:26:52,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:52,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash -120075223, now seen corresponding path program 2 times [2025-02-06 04:26:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:52,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979143975] [2025-02-06 04:26:52,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:26:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:52,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:26:52,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:26:52,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:26:52,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:53,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:53,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979143975] [2025-02-06 04:26:53,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979143975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:53,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:53,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:26:53,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275613556] [2025-02-06 04:26:53,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:53,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:26:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:53,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:26:53,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:26:53,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-02-06 04:26:53,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 135 transitions, 1639 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-06 04:26:53,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:53,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-02-06 04:26:53,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:54,420 INFO L124 PetriNetUnfolderBase]: 935/1824 cut-off events. [2025-02-06 04:26:54,420 INFO L125 PetriNetUnfolderBase]: For 11964/11964 co-relation queries the response was YES. [2025-02-06 04:26:54,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 1824 events. 935/1824 cut-off events. For 11964/11964 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10829 event pairs, 326 based on Foata normal form. 2/1826 useless extension candidates. Maximal degree in co-relation 8081. Up to 1234 conditions per place. [2025-02-06 04:26:54,432 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 121 selfloop transitions, 88 changer transitions 32/242 dead transitions. [2025-02-06 04:26:54,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 242 transitions, 3006 flow [2025-02-06 04:26:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 04:26:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 04:26:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 355 transitions. [2025-02-06 04:26:54,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2689393939393939 [2025-02-06 04:26:54,434 INFO L175 Difference]: Start difference. First operand has 117 places, 135 transitions, 1639 flow. Second operand 22 states and 355 transitions. [2025-02-06 04:26:54,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 242 transitions, 3006 flow [2025-02-06 04:26:54,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 242 transitions, 2758 flow, removed 105 selfloop flow, removed 7 redundant places. [2025-02-06 04:26:54,467 INFO L231 Difference]: Finished difference. Result has 137 places, 170 transitions, 2184 flow [2025-02-06 04:26:54,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2184, PETRI_PLACES=137, PETRI_TRANSITIONS=170} [2025-02-06 04:26:54,469 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 84 predicate places. [2025-02-06 04:26:54,469 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 170 transitions, 2184 flow [2025-02-06 04:26:54,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-06 04:26:54,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:54,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:54,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:26:54,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:54,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:54,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1697035707, now seen corresponding path program 3 times [2025-02-06 04:26:54,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:54,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723376674] [2025-02-06 04:26:54,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:26:54,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:54,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:26:54,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:26:54,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:26:54,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:26:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:26:55,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:26:55,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723376674] [2025-02-06 04:26:55,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723376674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:26:55,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:26:55,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:26:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944586767] [2025-02-06 04:26:55,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:26:55,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:26:55,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:26:55,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:26:55,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:26:55,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-02-06 04:26:55,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 170 transitions, 2184 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-06 04:26:55,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:26:55,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-02-06 04:26:55,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:26:56,047 INFO L124 PetriNetUnfolderBase]: 887/1770 cut-off events. [2025-02-06 04:26:56,047 INFO L125 PetriNetUnfolderBase]: For 12463/12463 co-relation queries the response was YES. [2025-02-06 04:26:56,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8156 conditions, 1770 events. 887/1770 cut-off events. For 12463/12463 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10547 event pairs, 293 based on Foata normal form. 2/1772 useless extension candidates. Maximal degree in co-relation 8099. Up to 1002 conditions per place. [2025-02-06 04:26:56,061 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 136 selfloop transitions, 90 changer transitions 31/258 dead transitions. [2025-02-06 04:26:56,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 258 transitions, 3395 flow [2025-02-06 04:26:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 04:26:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-06 04:26:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 370 transitions. [2025-02-06 04:26:56,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26811594202898553 [2025-02-06 04:26:56,063 INFO L175 Difference]: Start difference. First operand has 137 places, 170 transitions, 2184 flow. Second operand 23 states and 370 transitions. [2025-02-06 04:26:56,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 258 transitions, 3395 flow [2025-02-06 04:26:56,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 258 transitions, 3178 flow, removed 51 selfloop flow, removed 12 redundant places. [2025-02-06 04:26:56,116 INFO L231 Difference]: Finished difference. Result has 151 places, 177 transitions, 2403 flow [2025-02-06 04:26:56,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2403, PETRI_PLACES=151, PETRI_TRANSITIONS=177} [2025-02-06 04:26:56,118 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 98 predicate places. [2025-02-06 04:26:56,118 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 177 transitions, 2403 flow [2025-02-06 04:26:56,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-02-06 04:26:56,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:26:56,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:26:56,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:26:56,118 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:26:56,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:26:56,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1217318661, now seen corresponding path program 4 times [2025-02-06 04:26:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:26:56,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244779814] [2025-02-06 04:26:56,119 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 04:26:56,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:26:56,137 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-06 04:26:56,149 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:26:56,149 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 04:26:56,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:26:56,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:26:56,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 04:26:56,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 04:26:56,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:26:56,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:26:56,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:26:56,196 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:26:56,197 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-02-06 04:26:56,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-02-06 04:26:56,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-02-06 04:26:56,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-02-06 04:26:56,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-02-06 04:26:56,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-02-06 04:26:56,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-02-06 04:26:56,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-02-06 04:26:56,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:26:56,200 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1] [2025-02-06 04:26:56,248 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:26:56,249 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:26:56,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:26:56 BasicIcfg [2025-02-06 04:26:56,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:26:56,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:26:56,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:26:56,256 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:26:56,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:26:44" (3/4) ... [2025-02-06 04:26:56,257 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:26:56,317 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 21. [2025-02-06 04:26:56,364 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:26:56,365 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:26:56,365 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:26:56,365 INFO L158 Benchmark]: Toolchain (without parser) took 12716.16ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 120.1MB in the beginning and 248.5MB in the end (delta: -128.3MB). Peak memory consumption was 226.7MB. Max. memory is 16.1GB. [2025-02-06 04:26:56,365 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:26:56,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.53ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 89.3MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:26:56,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.33ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 87.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:26:56,366 INFO L158 Benchmark]: Boogie Preprocessor took 70.27ms. Allocated memory is still 167.8MB. Free memory was 87.3MB in the beginning and 84.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:26:56,366 INFO L158 Benchmark]: IcfgBuilder took 642.94ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 46.1MB in the end (delta: 38.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:26:56,366 INFO L158 Benchmark]: TraceAbstraction took 11429.77ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 46.1MB in the beginning and 261.1MB in the end (delta: -214.9MB). Peak memory consumption was 134.4MB. Max. memory is 16.1GB. [2025-02-06 04:26:56,367 INFO L158 Benchmark]: Witness Printer took 108.81ms. Allocated memory is still 520.1MB. Free memory was 261.1MB in the beginning and 248.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:26:56,367 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.53ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 89.3MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.33ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 87.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.27ms. Allocated memory is still 167.8MB. Free memory was 87.3MB in the beginning and 84.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 642.94ms. Allocated memory is still 167.8MB. Free memory was 84.1MB in the beginning and 46.1MB in the end (delta: 38.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11429.77ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 46.1MB in the beginning and 261.1MB in the end (delta: -214.9MB). Peak memory consumption was 134.4MB. Max. memory is 16.1GB. * Witness Printer took 108.81ms. Allocated memory is still 520.1MB. Free memory was 261.1MB in the beginning and 248.5MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3901] 0 struct device *my_dev; [L3953] CALL, EXPR 0 my_drv_init() [L3947] 0 return 0; [L3953] RET, EXPR 0 my_drv_init() [L3953] 0 int ret = my_drv_init(); [L3954] COND TRUE 0 ret==0 [L3955] 0 int probe_ret; [L3956] 0 struct my_data data; [L3957] CALL, EXPR 0 my_drv_probe(&data) [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] EXPR 0 data->shared.a [L3925] CALL 0 ldv_assert(data->shared.a==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1=0, t2=0] [L3925] RET 0 ldv_assert(data->shared.a==0) [L3926] EXPR 0 data->shared.b [L3926] CALL 0 ldv_assert(data->shared.b==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1=0, t2=0] [L3926] RET 0 ldv_assert(data->shared.b==0) [L3927] 0 int res = __VERIFIER_nondet_int(); [L3928] COND FALSE 0 !(\read(res)) [L3931] 0 my_dev = &data->dev [L3933] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [\old(arg)={0:0}, \old(data)={5:0}, data={5:0}, my_dev={5:24}, res=0, t1=-1, t2=0] [L3934] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [\old(arg)={0:0}, \old(data)={5:0}, data={5:0}, my_dev={5:24}, res=0, t1=-1, t2=0] [L3935] 0 return 0; VAL [\old(arg)={0:0}, \old(data)={5:0}, \result=0, data={5:0}, my_dev={5:24}, res=0, t1=-1, t2=0] [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1=-1, t2=0] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-1, t2=0] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-1, t2=0] [L3917] 1 return 0; [L3957] RET, EXPR 0 my_drv_probe(&data) [L3957] 0 probe_ret = my_drv_probe(&data) [L3958] COND TRUE 0 probe_ret==0 [L3959] CALL 0 my_drv_disconnect(&data) [L3941] 0 void *status; VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-1, t2=0] [L3942] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-1, t2=0] [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-1, t2=0] [L3917] 2 return 0; [L3943] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={0:0}, \old(data)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-1, t2=0] [L3959] RET 0 my_drv_disconnect(&data) [L3960] EXPR 0 data.shared.a [L3960] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={0:0}, \old(expression)=1, \result={0:0}, arg={0:0}, data={5:0}, expression=1, lb=0, my_dev={5:24}, t1=-1, t2=0] [L3960] RET 0 ldv_assert(data.shared.a==1) [L3961] EXPR 0 data.shared.b [L3961] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:24}, t1=-1, t2=0] [L3887] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:24}, t1=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3933]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3934]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 60 locations, 8 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: 11.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1353 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1273 mSDsluCounter, 1253 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1220 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4239 IncrementalHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 33 mSDtfsCounter, 4239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2403occurred in iteration=11, InterpolantAutomatonStates: 141, 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.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 2690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-06 04:26:56,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE