./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:54:46,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:54:46,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:54:46,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:54:46,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:54:46,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:54:46,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:54:46,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:54:46,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:54:46,419 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:54:46,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:54:46,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:54:46,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:54:46,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:54:46,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:46,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:54:46,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:54:46,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:54:46,422 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2025-03-14 00:54:46,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:54:46,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:54:46,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:54:46,682 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:54:46,682 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:54:46,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-03-14 00:54:47,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48631c003/325217406b024cc195c9ca2bbf2b1506/FLAGdf845d12b [2025-03-14 00:54:48,315 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:54:48,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-03-14 00:54:48,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48631c003/325217406b024cc195c9ca2bbf2b1506/FLAGdf845d12b [2025-03-14 00:54:48,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48631c003/325217406b024cc195c9ca2bbf2b1506 [2025-03-14 00:54:48,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:54:48,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:54:48,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:48,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:54:48,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:54:48,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3dee82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48, skipping insertion in model container [2025-03-14 00:54:48,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:54:48,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[186287,186300] [2025-03-14 00:54:48,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:48,746 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:54:48,786 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[186287,186300] [2025-03-14 00:54:48,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:48,840 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:54:48,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48 WrapperNode [2025-03-14 00:54:48,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:48,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:48,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:54:48,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:54:48,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,896 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2025-03-14 00:54:48,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:48,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:54:48,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:54:48,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:54:48,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,928 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 73 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-03-14 00:54:48,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:54:48,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:54:48,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:54:48,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:54:48,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:54:48,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:54:48,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:54:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-14 00:54:49,014 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-14 00:54:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 00:54:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 00:54:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 00:54:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 00:54:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:54:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:54:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:54:49,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:54:49,017 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:54:49,227 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:54:49,228 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:54:49,432 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:54:49,434 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:54:49,435 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:54:49,545 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:54:49,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:49 BoogieIcfgContainer [2025-03-14 00:54:49,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:54:49,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:54:49,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:54:49,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:54:49,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:54:48" (1/3) ... [2025-03-14 00:54:49,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df6893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:49, skipping insertion in model container [2025-03-14 00:54:49,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (2/3) ... [2025-03-14 00:54:49,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df6893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:49, skipping insertion in model container [2025-03-14 00:54:49,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:49" (3/3) ... [2025-03-14 00:54:49,555 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2025-03-14 00:54:49,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:54:49,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_2-container_of.i that has 2 procedures, 38 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-14 00:54:49,567 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:54:49,616 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 00:54:49,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 114 flow [2025-03-14 00:54:49,663 INFO L124 PetriNetUnfolderBase]: 8/63 cut-off events. [2025-03-14 00:54:49,664 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:54:49,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 63 events. 8/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2025-03-14 00:54:49,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 114 flow [2025-03-14 00:54:49,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 98 flow [2025-03-14 00:54:49,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:54:49,689 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;@350e71ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:54:49,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 00:54:49,696 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:54:49,699 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-14 00:54:49,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:49,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:49,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:49,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:49,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:49,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1381462125, now seen corresponding path program 1 times [2025-03-14 00:54:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:49,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170970187] [2025-03-14 00:54:49,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:49,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:54:49,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:54:49,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:49,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:50,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:50,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170970187] [2025-03-14 00:54:50,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170970187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:50,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:50,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:54:50,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780728758] [2025-03-14 00:54:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:50,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:54:50,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:50,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:54:50,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:54:50,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:54:50,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:50,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:50,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:54:50,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:50,640 INFO L124 PetriNetUnfolderBase]: 466/817 cut-off events. [2025-03-14 00:54:50,640 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 00:54:50,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 817 events. 466/817 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3413 event pairs, 345 based on Foata normal form. 2/816 useless extension candidates. Maximal degree in co-relation 1538. Up to 600 conditions per place. [2025-03-14 00:54:50,665 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2025-03-14 00:54:50,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2025-03-14 00:54:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:54:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:54:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-14 00:54:50,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-03-14 00:54:50,676 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 3 states and 71 transitions. [2025-03-14 00:54:50,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2025-03-14 00:54:50,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:50,682 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 92 flow [2025-03-14 00:54:50,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-03-14 00:54:50,686 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-03-14 00:54:50,687 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 92 flow [2025-03-14 00:54:50,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:50,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:50,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:50,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:54:50,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash -440158717, now seen corresponding path program 1 times [2025-03-14 00:54:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502564336] [2025-03-14 00:54:50,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:50,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-14 00:54:50,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-14 00:54:50,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:50,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502564336] [2025-03-14 00:54:50,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502564336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:50,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:50,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:50,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660870464] [2025-03-14 00:54:50,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:50,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:50,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:50,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:50,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:50,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:54:50,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:50,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:50,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:54:50,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:51,207 INFO L124 PetriNetUnfolderBase]: 602/1092 cut-off events. [2025-03-14 00:54:51,207 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-14 00:54:51,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1092 events. 602/1092 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5236 event pairs, 289 based on Foata normal form. 69/1160 useless extension candidates. Maximal degree in co-relation 816. Up to 574 conditions per place. [2025-03-14 00:54:51,217 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 44 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2025-03-14 00:54:51,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 250 flow [2025-03-14 00:54:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:54:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:54:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-03-14 00:54:51,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-14 00:54:51,220 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 92 flow. Second operand 4 states and 90 transitions. [2025-03-14 00:54:51,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 250 flow [2025-03-14 00:54:51,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:54:51,223 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 122 flow [2025-03-14 00:54:51,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-03-14 00:54:51,226 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2025-03-14 00:54:51,226 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 122 flow [2025-03-14 00:54:51,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:51,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:51,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:51,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:54:51,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:51,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1632078642, now seen corresponding path program 1 times [2025-03-14 00:54:51,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:51,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120297447] [2025-03-14 00:54:51,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:51,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:51,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:54:51,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:54:51,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:51,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:51,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:51,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120297447] [2025-03-14 00:54:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120297447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:51,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:51,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:54:51,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596448943] [2025-03-14 00:54:51,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:51,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:54:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:51,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:54:51,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:54:51,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:54:51,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:51,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:51,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:54:51,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:52,161 INFO L124 PetriNetUnfolderBase]: 557/1040 cut-off events. [2025-03-14 00:54:52,161 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2025-03-14 00:54:52,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2505 conditions, 1040 events. 557/1040 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5171 event pairs, 37 based on Foata normal form. 32/1072 useless extension candidates. Maximal degree in co-relation 1270. Up to 327 conditions per place. [2025-03-14 00:54:52,167 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 71 selfloop transitions, 22 changer transitions 1/98 dead transitions. [2025-03-14 00:54:52,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 98 transitions, 482 flow [2025-03-14 00:54:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 00:54:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 00:54:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2025-03-14 00:54:52,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3290909090909091 [2025-03-14 00:54:52,169 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 122 flow. Second operand 11 states and 181 transitions. [2025-03-14 00:54:52,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 98 transitions, 482 flow [2025-03-14 00:54:52,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 98 transitions, 460 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-14 00:54:52,177 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 218 flow [2025-03-14 00:54:52,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=218, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-14 00:54:52,177 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2025-03-14 00:54:52,177 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 218 flow [2025-03-14 00:54:52,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:52,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:52,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:52,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:54:52,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:52,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:52,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1008544854, now seen corresponding path program 1 times [2025-03-14 00:54:52,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:52,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738355963] [2025-03-14 00:54:52,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:52,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:52,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 00:54:52,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 00:54:52,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:52,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738355963] [2025-03-14 00:54:52,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738355963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:52,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:52,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:54:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105459295] [2025-03-14 00:54:52,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:52,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:54:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:52,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:54:52,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:54:52,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:54:52,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 218 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:52,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:52,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:54:52,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:53,026 INFO L124 PetriNetUnfolderBase]: 561/1048 cut-off events. [2025-03-14 00:54:53,027 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2025-03-14 00:54:53,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 1048 events. 561/1048 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5144 event pairs, 38 based on Foata normal form. 32/1080 useless extension candidates. Maximal degree in co-relation 1664. Up to 309 conditions per place. [2025-03-14 00:54:53,035 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 81 selfloop transitions, 28 changer transitions 4/117 dead transitions. [2025-03-14 00:54:53,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 117 transitions, 697 flow [2025-03-14 00:54:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 00:54:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 00:54:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2025-03-14 00:54:53,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3381818181818182 [2025-03-14 00:54:53,041 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 218 flow. Second operand 11 states and 186 transitions. [2025-03-14 00:54:53,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 117 transitions, 697 flow [2025-03-14 00:54:53,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 117 transitions, 648 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-14 00:54:53,048 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 334 flow [2025-03-14 00:54:53,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=334, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2025-03-14 00:54:53,049 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2025-03-14 00:54:53,049 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 334 flow [2025-03-14 00:54:53,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:53,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:53,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:53,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:54:53,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:53,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:53,051 INFO L85 PathProgramCache]: Analyzing trace with hash 751798221, now seen corresponding path program 1 times [2025-03-14 00:54:53,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:53,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36265991] [2025-03-14 00:54:53,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:53,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:53,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-14 00:54:53,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-14 00:54:53,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:53,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:53,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:53,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36265991] [2025-03-14 00:54:53,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36265991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:53,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:53,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:53,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245601695] [2025-03-14 00:54:53,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:53,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:53,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:53,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:53,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2025-03-14 00:54:53,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:53,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:53,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2025-03-14 00:54:53,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:53,289 INFO L124 PetriNetUnfolderBase]: 225/404 cut-off events. [2025-03-14 00:54:53,290 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2025-03-14 00:54:53,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 404 events. 225/404 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1472 event pairs, 35 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 1196. Up to 217 conditions per place. [2025-03-14 00:54:53,292 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 42 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2025-03-14 00:54:53,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 301 flow [2025-03-14 00:54:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:54:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:54:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-03-14 00:54:53,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-14 00:54:53,294 INFO L175 Difference]: Start difference. First operand has 60 places, 63 transitions, 334 flow. Second operand 4 states and 105 transitions. [2025-03-14 00:54:53,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 301 flow [2025-03-14 00:54:53,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 242 flow, removed 18 selfloop flow, removed 10 redundant places. [2025-03-14 00:54:53,295 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 104 flow [2025-03-14 00:54:53,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-03-14 00:54:53,296 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2025-03-14 00:54:53,296 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 104 flow [2025-03-14 00:54:53,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:53,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:53,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:53,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:54:53,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:53,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 104128071, now seen corresponding path program 1 times [2025-03-14 00:54:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280514648] [2025-03-14 00:54:53,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:53,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:54:53,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:54:53,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:53,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:54,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280514648] [2025-03-14 00:54:54,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280514648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:54,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:54,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 00:54:54,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150333113] [2025-03-14 00:54:54,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:54,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 00:54:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:54,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 00:54:54,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-14 00:54:54,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:54:54,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 104 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:54,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:54,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:54:54,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:54,668 INFO L124 PetriNetUnfolderBase]: 401/718 cut-off events. [2025-03-14 00:54:54,668 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2025-03-14 00:54:54,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 718 events. 401/718 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3145 event pairs, 5 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 365. Up to 221 conditions per place. [2025-03-14 00:54:54,672 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 83 selfloop transitions, 19 changer transitions 0/104 dead transitions. [2025-03-14 00:54:54,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 104 transitions, 520 flow [2025-03-14 00:54:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:54:54,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:54:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2025-03-14 00:54:54,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2025-03-14 00:54:54,675 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 104 flow. Second operand 13 states and 205 transitions. [2025-03-14 00:54:54,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 104 transitions, 520 flow [2025-03-14 00:54:54,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 104 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:54:54,677 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 218 flow [2025-03-14 00:54:54,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=218, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2025-03-14 00:54:54,679 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2025-03-14 00:54:54,679 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 218 flow [2025-03-14 00:54:54,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:54,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:54,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:54,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:54:54,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:54,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1786758473, now seen corresponding path program 2 times [2025-03-14 00:54:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615049192] [2025-03-14 00:54:54,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:54:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:54,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:54:54,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:54:54,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:54:54,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:55,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:55,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615049192] [2025-03-14 00:54:55,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615049192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:55,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:55,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:54:55,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267681933] [2025-03-14 00:54:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:55,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:54:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:55,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:54:55,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:54:55,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:54:55,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 218 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:55,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:55,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:54:55,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:55,505 INFO L124 PetriNetUnfolderBase]: 469/870 cut-off events. [2025-03-14 00:54:55,505 INFO L125 PetriNetUnfolderBase]: For 1191/1191 co-relation queries the response was YES. [2025-03-14 00:54:55,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2443 conditions, 870 events. 469/870 cut-off events. For 1191/1191 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4137 event pairs, 18 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 2400. Up to 302 conditions per place. [2025-03-14 00:54:55,515 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 75 selfloop transitions, 28 changer transitions 0/105 dead transitions. [2025-03-14 00:54:55,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 105 transitions, 683 flow [2025-03-14 00:54:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 00:54:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 00:54:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2025-03-14 00:54:55,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30727272727272725 [2025-03-14 00:54:55,520 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 218 flow. Second operand 11 states and 169 transitions. [2025-03-14 00:54:55,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 105 transitions, 683 flow [2025-03-14 00:54:55,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 666 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:54:55,527 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 393 flow [2025-03-14 00:54:55,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=393, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2025-03-14 00:54:55,528 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-03-14 00:54:55,528 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 393 flow [2025-03-14 00:54:55,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:55,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:55,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:55,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:54:55,528 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:55,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash -663545671, now seen corresponding path program 3 times [2025-03-14 00:54:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:55,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910644443] [2025-03-14 00:54:55,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:54:55,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:55,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:54:55,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:54:55,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:54:55,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910644443] [2025-03-14 00:54:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910644443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:56,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 00:54:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524220449] [2025-03-14 00:54:56,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:56,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 00:54:56,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:56,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 00:54:56,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-14 00:54:56,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:54:56,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 393 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:56,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:56,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:54:56,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:57,070 INFO L124 PetriNetUnfolderBase]: 646/1205 cut-off events. [2025-03-14 00:54:57,071 INFO L125 PetriNetUnfolderBase]: For 2458/2458 co-relation queries the response was YES. [2025-03-14 00:54:57,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3826 conditions, 1205 events. 646/1205 cut-off events. For 2458/2458 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6149 event pairs, 50 based on Foata normal form. 1/1206 useless extension candidates. Maximal degree in co-relation 3768. Up to 441 conditions per place. [2025-03-14 00:54:57,089 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 85 selfloop transitions, 39 changer transitions 0/126 dead transitions. [2025-03-14 00:54:57,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 126 transitions, 949 flow [2025-03-14 00:54:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:54:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:54:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 207 transitions. [2025-03-14 00:54:57,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2957142857142857 [2025-03-14 00:54:57,095 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 393 flow. Second operand 14 states and 207 transitions. [2025-03-14 00:54:57,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 126 transitions, 949 flow [2025-03-14 00:54:57,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 126 transitions, 936 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:57,107 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 628 flow [2025-03-14 00:54:57,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=628, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2025-03-14 00:54:57,110 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2025-03-14 00:54:57,110 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 628 flow [2025-03-14 00:54:57,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:57,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:57,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:57,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:54:57,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:57,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:57,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1880017939, now seen corresponding path program 4 times [2025-03-14 00:54:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:57,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863604488] [2025-03-14 00:54:57,113 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:54:57,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:57,137 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-14 00:54:57,160 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:54:57,160 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:54:57,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:57,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-03-14 00:54:57,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863604488] [2025-03-14 00:54:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863604488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:57,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:57,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:54:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248193394] [2025-03-14 00:54:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:57,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:54:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:57,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:54:57,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:54:57,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:54:57,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 628 flow. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:57,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:57,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:54:57,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:57,840 INFO L124 PetriNetUnfolderBase]: 760/1457 cut-off events. [2025-03-14 00:54:57,840 INFO L125 PetriNetUnfolderBase]: For 5089/5089 co-relation queries the response was YES. [2025-03-14 00:54:57,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 1457 events. 760/1457 cut-off events. For 5089/5089 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8013 event pairs, 36 based on Foata normal form. 1/1458 useless extension candidates. Maximal degree in co-relation 4908. Up to 441 conditions per place. [2025-03-14 00:54:57,852 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 81 selfloop transitions, 54 changer transitions 0/137 dead transitions. [2025-03-14 00:54:57,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 137 transitions, 1313 flow [2025-03-14 00:54:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 00:54:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 00:54:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2025-03-14 00:54:57,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31272727272727274 [2025-03-14 00:54:57,854 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 628 flow. Second operand 11 states and 172 transitions. [2025-03-14 00:54:57,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 137 transitions, 1313 flow [2025-03-14 00:54:57,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 1247 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-14 00:54:57,866 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 973 flow [2025-03-14 00:54:57,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=973, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2025-03-14 00:54:57,867 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2025-03-14 00:54:57,867 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 973 flow [2025-03-14 00:54:57,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:57,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:57,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:57,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:54:57,868 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:57,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1931457231, now seen corresponding path program 5 times [2025-03-14 00:54:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:57,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345542870] [2025-03-14 00:54:57,869 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:54:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:57,885 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-14 00:54:57,892 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 00:54:57,892 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:54:57,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:58,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:58,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345542870] [2025-03-14 00:54:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345542870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:58,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:58,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 00:54:58,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473946009] [2025-03-14 00:54:58,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:58,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 00:54:58,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:58,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 00:54:58,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-14 00:54:58,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:54:58,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 973 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:58,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:58,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:54:58,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:58,958 INFO L124 PetriNetUnfolderBase]: 760/1455 cut-off events. [2025-03-14 00:54:58,958 INFO L125 PetriNetUnfolderBase]: For 6460/6460 co-relation queries the response was YES. [2025-03-14 00:54:58,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 1455 events. 760/1455 cut-off events. For 6460/6460 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7986 event pairs, 149 based on Foata normal form. 1/1456 useless extension candidates. Maximal degree in co-relation 5449. Up to 335 conditions per place. [2025-03-14 00:54:58,979 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 111 selfloop transitions, 55 changer transitions 0/167 dead transitions. [2025-03-14 00:54:58,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 167 transitions, 1701 flow [2025-03-14 00:54:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 00:54:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 00:54:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2025-03-14 00:54:58,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30533333333333335 [2025-03-14 00:54:58,984 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 973 flow. Second operand 15 states and 229 transitions. [2025-03-14 00:54:58,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 167 transitions, 1701 flow [2025-03-14 00:54:59,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 167 transitions, 1643 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-14 00:54:59,004 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 1160 flow [2025-03-14 00:54:59,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1160, PETRI_PLACES=100, PETRI_TRANSITIONS=97} [2025-03-14 00:54:59,005 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2025-03-14 00:54:59,005 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 1160 flow [2025-03-14 00:54:59,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:59,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:59,005 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] [2025-03-14 00:54:59,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:54:59,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:54:59,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:59,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1487149528, now seen corresponding path program 1 times [2025-03-14 00:54:59,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621323321] [2025-03-14 00:54:59,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:59,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:59,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 00:54:59,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 00:54:59,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:59,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:59,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-03-14 00:54:59,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:59,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621323321] [2025-03-14 00:54:59,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621323321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:59,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:59,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:54:59,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037018649] [2025-03-14 00:54:59,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:59,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:54:59,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:59,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:54:59,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:54:59,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:54:59,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 1160 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:59,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:59,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:54:59,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:00,681 INFO L124 PetriNetUnfolderBase]: 948/1803 cut-off events. [2025-03-14 00:55:00,682 INFO L125 PetriNetUnfolderBase]: For 11201/11201 co-relation queries the response was YES. [2025-03-14 00:55:00,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7377 conditions, 1803 events. 948/1803 cut-off events. For 11201/11201 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10360 event pairs, 290 based on Foata normal form. 1/1804 useless extension candidates. Maximal degree in co-relation 7021. Up to 1266 conditions per place. [2025-03-14 00:55:00,690 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 84 selfloop transitions, 73 changer transitions 45/203 dead transitions. [2025-03-14 00:55:00,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 2608 flow [2025-03-14 00:55:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 00:55:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 00:55:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 250 transitions. [2025-03-14 00:55:00,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2025-03-14 00:55:00,692 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 1160 flow. Second operand 18 states and 250 transitions. [2025-03-14 00:55:00,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 2608 flow [2025-03-14 00:55:00,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 203 transitions, 2510 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-03-14 00:55:00,708 INFO L231 Difference]: Finished difference. Result has 123 places, 137 transitions, 2018 flow [2025-03-14 00:55:00,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2018, PETRI_PLACES=123, PETRI_TRANSITIONS=137} [2025-03-14 00:55:00,709 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 78 predicate places. [2025-03-14 00:55:00,709 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 137 transitions, 2018 flow [2025-03-14 00:55:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:00,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:00,709 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] [2025-03-14 00:55:00,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 00:55:00,710 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:55:00,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:00,710 INFO L85 PathProgramCache]: Analyzing trace with hash -326901184, now seen corresponding path program 2 times [2025-03-14 00:55:00,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:00,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832879646] [2025-03-14 00:55:00,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:55:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:00,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-14 00:55:00,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 00:55:00,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:55:00,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:01,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:01,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832879646] [2025-03-14 00:55:01,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832879646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:01,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:01,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:55:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590797269] [2025-03-14 00:55:01,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:01,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:55:01,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:01,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:55:01,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:55:01,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:55:01,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 137 transitions, 2018 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:01,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:01,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:55:01,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:02,183 INFO L124 PetriNetUnfolderBase]: 1079/2082 cut-off events. [2025-03-14 00:55:02,184 INFO L125 PetriNetUnfolderBase]: For 14542/14542 co-relation queries the response was YES. [2025-03-14 00:55:02,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9617 conditions, 2082 events. 1079/2082 cut-off events. For 14542/14542 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12696 event pairs, 387 based on Foata normal form. 2/2084 useless extension candidates. Maximal degree in co-relation 9535. Up to 1470 conditions per place. [2025-03-14 00:55:02,200 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 139 selfloop transitions, 83 changer transitions 35/258 dead transitions. [2025-03-14 00:55:02,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 258 transitions, 3696 flow [2025-03-14 00:55:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 00:55:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 00:55:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 277 transitions. [2025-03-14 00:55:02,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29157894736842105 [2025-03-14 00:55:02,202 INFO L175 Difference]: Start difference. First operand has 123 places, 137 transitions, 2018 flow. Second operand 19 states and 277 transitions. [2025-03-14 00:55:02,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 258 transitions, 3696 flow [2025-03-14 00:55:02,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 258 transitions, 3552 flow, removed 58 selfloop flow, removed 10 redundant places. [2025-03-14 00:55:02,234 INFO L231 Difference]: Finished difference. Result has 129 places, 172 transitions, 2591 flow [2025-03-14 00:55:02,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2591, PETRI_PLACES=129, PETRI_TRANSITIONS=172} [2025-03-14 00:55:02,235 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 84 predicate places. [2025-03-14 00:55:02,235 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 172 transitions, 2591 flow [2025-03-14 00:55:02,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:02,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:02,235 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] [2025-03-14 00:55:02,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 00:55:02,236 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:55:02,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:02,236 INFO L85 PathProgramCache]: Analyzing trace with hash -485444358, now seen corresponding path program 3 times [2025-03-14 00:55:02,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:02,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432634135] [2025-03-14 00:55:02,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:55:02,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:02,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-03-14 00:55:02,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 00:55:02,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:55:02,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:03,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:03,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432634135] [2025-03-14 00:55:03,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432634135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:03,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:03,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 00:55:03,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583059188] [2025-03-14 00:55:03,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:03,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 00:55:03,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:03,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 00:55:03,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-14 00:55:03,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:55:03,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 172 transitions, 2591 flow. Second operand has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 14 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-03-14 00:55:03,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:03,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:55:03,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:04,301 INFO L124 PetriNetUnfolderBase]: 1199/2352 cut-off events. [2025-03-14 00:55:04,301 INFO L125 PetriNetUnfolderBase]: For 16858/16858 co-relation queries the response was YES. [2025-03-14 00:55:04,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11136 conditions, 2352 events. 1199/2352 cut-off events. For 16858/16858 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14867 event pairs, 360 based on Foata normal form. 2/2354 useless extension candidates. Maximal degree in co-relation 11042. Up to 1604 conditions per place. [2025-03-14 00:55:04,327 INFO L140 encePairwiseOnDemand]: 34/50 looper letters, 156 selfloop transitions, 110 changer transitions 36/303 dead transitions. [2025-03-14 00:55:04,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 303 transitions, 4381 flow [2025-03-14 00:55:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 00:55:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-14 00:55:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 338 transitions. [2025-03-14 00:55:04,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2816666666666667 [2025-03-14 00:55:04,330 INFO L175 Difference]: Start difference. First operand has 129 places, 172 transitions, 2591 flow. Second operand 24 states and 338 transitions. [2025-03-14 00:55:04,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 303 transitions, 4381 flow [2025-03-14 00:55:04,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 303 transitions, 4228 flow, removed 43 selfloop flow, removed 6 redundant places. [2025-03-14 00:55:04,370 INFO L231 Difference]: Finished difference. Result has 159 places, 213 transitions, 3524 flow [2025-03-14 00:55:04,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2479, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3524, PETRI_PLACES=159, PETRI_TRANSITIONS=213} [2025-03-14 00:55:04,371 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 114 predicate places. [2025-03-14 00:55:04,372 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 213 transitions, 3524 flow [2025-03-14 00:55:04,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 14 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-03-14 00:55:04,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:04,372 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] [2025-03-14 00:55:04,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 00:55:04,372 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:55:04,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:04,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1248543576, now seen corresponding path program 4 times [2025-03-14 00:55:04,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:04,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975472989] [2025-03-14 00:55:04,373 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:55:04,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:04,385 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-14 00:55:04,393 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 00:55:04,394 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:55:04,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:04,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:04,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975472989] [2025-03-14 00:55:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975472989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:04,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:04,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:55:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815658280] [2025-03-14 00:55:04,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:04,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:55:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:04,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:55:04,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:55:04,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-14 00:55:04,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 213 transitions, 3524 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:04,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:04,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-14 00:55:04,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:05,707 INFO L124 PetriNetUnfolderBase]: 1203/2418 cut-off events. [2025-03-14 00:55:05,707 INFO L125 PetriNetUnfolderBase]: For 20011/20011 co-relation queries the response was YES. [2025-03-14 00:55:05,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12225 conditions, 2418 events. 1203/2418 cut-off events. For 20011/20011 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15853 event pairs, 476 based on Foata normal form. 1/2419 useless extension candidates. Maximal degree in co-relation 12114. Up to 1716 conditions per place. [2025-03-14 00:55:05,723 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 168 selfloop transitions, 96 changer transitions 35/300 dead transitions. [2025-03-14 00:55:05,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 300 transitions, 4861 flow [2025-03-14 00:55:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 00:55:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 00:55:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 265 transitions. [2025-03-14 00:55:05,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2025-03-14 00:55:05,728 INFO L175 Difference]: Start difference. First operand has 159 places, 213 transitions, 3524 flow. Second operand 18 states and 265 transitions. [2025-03-14 00:55:05,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 300 transitions, 4861 flow [2025-03-14 00:55:05,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 300 transitions, 4768 flow, removed 31 selfloop flow, removed 7 redundant places. [2025-03-14 00:55:05,788 INFO L231 Difference]: Finished difference. Result has 172 places, 229 transitions, 3958 flow [2025-03-14 00:55:05,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3446, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3958, PETRI_PLACES=172, PETRI_TRANSITIONS=229} [2025-03-14 00:55:05,789 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 127 predicate places. [2025-03-14 00:55:05,789 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 229 transitions, 3958 flow [2025-03-14 00:55:05,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:05,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:05,789 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] [2025-03-14 00:55:05,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 00:55:05,789 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-14 00:55:05,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1526275524, now seen corresponding path program 5 times [2025-03-14 00:55:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:05,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227642981] [2025-03-14 00:55:05,790 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:55:05,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:05,801 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-14 00:55:05,809 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 00:55:05,809 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:55:05,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:55:05,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:55:05,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 00:55:05,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 00:55:05,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:55:05,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:55:05,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:55:05,853 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:55:05,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-14 00:55:05,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-14 00:55:05,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-14 00:55:05,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-14 00:55:05,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-14 00:55:05,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-14 00:55:05,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 00:55:05,859 INFO L422 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1] [2025-03-14 00:55:05,904 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:55:05,905 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:55:05,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:55:05 BasicIcfg [2025-03-14 00:55:05,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:55:05,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:55:05,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:55:05,915 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:55:05,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:49" (3/4) ... [2025-03-14 00:55:05,916 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 00:55:05,971 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 15. [2025-03-14 00:55:06,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:55:06,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:55:06,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:55:06,012 INFO L158 Benchmark]: Toolchain (without parser) took 17642.36ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 109.8MB in the beginning and 453.3MB in the end (delta: -343.5MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,013 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:55:06,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.64ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 79.2MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.60ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 76.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:55:06,013 INFO L158 Benchmark]: Boogie Preprocessor took 54.12ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 73.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,013 INFO L158 Benchmark]: IcfgBuilder took 595.58ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 101.6MB in the end (delta: -27.8MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,014 INFO L158 Benchmark]: TraceAbstraction took 16362.41ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 100.8MB in the beginning and 466.3MB in the end (delta: -365.5MB). Peak memory consumption was 296.5MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,014 INFO L158 Benchmark]: Witness Printer took 99.72ms. Allocated memory is still 511.7MB. Free memory was 466.3MB in the beginning and 453.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,015 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.84ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.64ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 79.2MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.60ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 76.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.12ms. Allocated memory is still 142.6MB. Free memory was 76.8MB in the beginning and 73.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 595.58ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 101.6MB in the end (delta: -27.8MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16362.41ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 100.8MB in the beginning and 466.3MB in the end (delta: -365.5MB). Peak memory consumption was 296.5MB. Max. memory is 16.1GB. * Witness Printer took 99.72ms. Allocated memory is still 511.7MB. Free memory was 466.3MB in the beginning and 453.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. 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; [L3950] CALL, EXPR 0 my_drv_init() [L3944] 0 return 0; [L3950] RET, EXPR 0 my_drv_init() [L3950] 0 int ret = my_drv_init(); [L3951] COND TRUE 0 ret==0 [L3952] 0 int probe_ret; [L3953] 0 struct my_data data; [L3954] CALL, EXPR 0 my_drv_probe(&data) [L3920] 0 struct device *d = &data->dev; [L3924] 0 data->shared.a = 0 [L3925] 0 data->shared.b = 0 [L3926] 0 int res = __VERIFIER_nondet_int(); [L3927] COND FALSE 0 !(\read(res)) [L3930] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, d={5:24}, data={5:0}, res=0, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0] [L3931] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1=-1, t2=0] [L3932] 0 return 0; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result=0, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3917] 1 return 0; [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3917] 2 return 0; [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={5:24}, \old(expression)=1, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=1, lb=0, t1=-1, t2=0] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b [L3958] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-1, t2=0] [L3887] 0 reach_error() VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, 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: 3930]: 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: 3931]: 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, 52 locations, 6 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: 16.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1476 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1407 mSDsluCounter, 1240 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1141 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5612 IncrementalHoareTripleChecker+Invalid, 5803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 99 mSDtfsCounter, 5612 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3958occurred in iteration=14, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 3224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-03-14 00:55:06,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE