./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-04 02:12:03,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:12:03,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:12:03,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:12:03,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:12:03,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:12:03,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:12:03,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:12:03,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:12:03,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:12:03,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:12:03,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:12:03,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:12:03,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:12:03,103 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:12:03,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:12:03,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:12:03,104 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:12:03,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:12:03,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:12:03,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:12:03,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:12:03,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:12:03,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:12:03,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:12:03,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:12:03,105 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:12:03,105 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:12:03,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:12:03,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:12:03,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:12:03,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:12:03,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:12:03,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:12:03,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:12:03,106 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:12:03,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:12:03,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:12:03,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:12:03,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:12:03,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:12:03,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:12:03,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:12:03,106 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-04 02:12:03,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:12:03,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:12:03,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:12:03,339 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:12:03,339 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:12:03,340 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-04 02:12:04,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c514e675b/30b463895db1497baaf2f3c3f8df6fde/FLAGe10508b46 [2025-03-04 02:12:04,828 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:12:04,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-03-04 02:12:04,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c514e675b/30b463895db1497baaf2f3c3f8df6fde/FLAGe10508b46 [2025-03-04 02:12:04,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c514e675b/30b463895db1497baaf2f3c3f8df6fde [2025-03-04 02:12:04,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:12:04,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:12:04,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:12:04,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:12:04,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:12:04,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:04,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c60401a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04, skipping insertion in model container [2025-03-04 02:12:04,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:04,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:12:05,171 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-04 02:12:05,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:12:05,206 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:12:05,247 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-04 02:12:05,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:12:05,296 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:12:05,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05 WrapperNode [2025-03-04 02:12:05,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:12:05,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:12:05,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:12:05,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:12:05,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,332 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2025-03-04 02:12:05,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:12:05,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:12:05,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:12:05,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:12:05,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,354 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-04 02:12:05,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:12:05,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:12:05,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:12:05,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:12:05,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (1/1) ... [2025-03-04 02:12:05,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:12:05,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:05,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:12:05,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:12:05,428 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-04 02:12:05,428 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-04 02:12:05,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:12:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:12:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:12:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:12:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:12:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:12:05,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:12:05,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:12:05,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:12:05,432 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:12:05,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:12:05,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:12:05,805 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:12:05,805 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:12:05,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:12:05,919 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:12:05,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:12:05 BoogieIcfgContainer [2025-03-04 02:12:05,919 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:12:05,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:12:05,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:12:05,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:12:05,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:12:04" (1/3) ... [2025-03-04 02:12:05,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46954708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:12:05, skipping insertion in model container [2025-03-04 02:12:05,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:05" (2/3) ... [2025-03-04 02:12:05,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46954708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:12:05, skipping insertion in model container [2025-03-04 02:12:05,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:12:05" (3/3) ... [2025-03-04 02:12:05,933 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2025-03-04 02:12:05,942 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:12:05,943 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-04 02:12:05,944 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:12:05,984 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:12:06,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 114 flow [2025-03-04 02:12:06,057 INFO L124 PetriNetUnfolderBase]: 8/63 cut-off events. [2025-03-04 02:12:06,059 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:12:06,062 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-04 02:12:06,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 114 flow [2025-03-04 02:12:06,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 98 flow [2025-03-04 02:12:06,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:12:06,095 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;@a4f0eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:12:06,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:12:06,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:12:06,106 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-04 02:12:06,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:12:06,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:06,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:06,107 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-04 02:12:06,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1381462125, now seen corresponding path program 1 times [2025-03-04 02:12:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:06,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959043765] [2025-03-04 02:12:06,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:06,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 02:12:06,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 02:12:06,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:06,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:06,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:06,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959043765] [2025-03-04 02:12:06,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959043765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:06,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:12:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055049657] [2025-03-04 02:12:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:06,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:12:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:06,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:12:06,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:12:06,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:06,659 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-04 02:12:06,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:06,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:06,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:06,935 INFO L124 PetriNetUnfolderBase]: 466/817 cut-off events. [2025-03-04 02:12:06,935 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 02:12:06,937 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-04 02:12:06,946 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2025-03-04 02:12:06,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2025-03-04 02:12:06,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:12:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:12:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 02:12:06,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-03-04 02:12:06,964 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 3 states and 71 transitions. [2025-03-04 02:12:06,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2025-03-04 02:12:06,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:12:06,974 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 92 flow [2025-03-04 02:12:06,978 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-04 02:12:06,983 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-03-04 02:12:06,984 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 92 flow [2025-03-04 02:12:06,984 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-04 02:12:06,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:06,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:06,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:12:06,986 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-04 02:12:06,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash -440158717, now seen corresponding path program 1 times [2025-03-04 02:12:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:06,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311017108] [2025-03-04 02:12:06,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:07,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:12:07,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:12:07,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:07,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:07,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311017108] [2025-03-04 02:12:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311017108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:07,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:07,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:12:07,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148177304] [2025-03-04 02:12:07,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:07,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:12:07,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:07,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:12:07,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:12:07,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:07,219 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-04 02:12:07,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:07,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:07,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:07,422 INFO L124 PetriNetUnfolderBase]: 602/1092 cut-off events. [2025-03-04 02:12:07,422 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-04 02:12:07,425 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-04 02:12:07,428 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 44 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2025-03-04 02:12:07,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 250 flow [2025-03-04 02:12:07,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:12:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:12:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-03-04 02:12:07,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-04 02:12:07,430 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 92 flow. Second operand 4 states and 90 transitions. [2025-03-04 02:12:07,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 250 flow [2025-03-04 02:12:07,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:12:07,432 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 122 flow [2025-03-04 02:12:07,432 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-04 02:12:07,433 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2025-03-04 02:12:07,433 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 122 flow [2025-03-04 02:12:07,433 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-04 02:12:07,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:07,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:07,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:12:07,433 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-04 02:12:07,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:07,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1632078642, now seen corresponding path program 1 times [2025-03-04 02:12:07,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:07,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178036772] [2025-03-04 02:12:07,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:07,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:07,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:12:07,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:12:07,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:07,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178036772] [2025-03-04 02:12:07,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178036772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:07,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:07,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:12:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813543905] [2025-03-04 02:12:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:07,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:12:07,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:07,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:12:07,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:12:07,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2025-03-04 02:12:07,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:07,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:07,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2025-03-04 02:12:07,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:07,708 INFO L124 PetriNetUnfolderBase]: 225/404 cut-off events. [2025-03-04 02:12:07,709 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-04 02:12:07,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 404 events. 225/404 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1522 event pairs, 35 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 909. Up to 217 conditions per place. [2025-03-04 02:12:07,712 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 42 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-03-04 02:12:07,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 220 flow [2025-03-04 02:12:07,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:12:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:12:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-03-04 02:12:07,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-04 02:12:07,716 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 122 flow. Second operand 4 states and 105 transitions. [2025-03-04 02:12:07,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 220 flow [2025-03-04 02:12:07,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:12:07,719 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 74 flow [2025-03-04 02:12:07,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2025-03-04 02:12:07,720 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2025-03-04 02:12:07,721 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 74 flow [2025-03-04 02:12:07,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:07,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:07,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:07,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:12:07,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:12:07,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 104128071, now seen corresponding path program 1 times [2025-03-04 02:12:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:07,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510557871] [2025-03-04 02:12:07,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:07,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:07,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:12:07,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:12:07,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:07,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510557871] [2025-03-04 02:12:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510557871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:08,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:08,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:12:08,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276569169] [2025-03-04 02:12:08,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:08,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:12:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:08,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:12:08,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:12:08,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:08,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 74 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-04 02:12:08,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:08,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:08,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:09,337 INFO L124 PetriNetUnfolderBase]: 401/718 cut-off events. [2025-03-04 02:12:09,337 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2025-03-04 02:12:09,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 718 events. 401/718 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3151 event pairs, 5 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 327. Up to 221 conditions per place. [2025-03-04 02:12:09,348 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 83 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-03-04 02:12:09,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 102 transitions, 485 flow [2025-03-04 02:12:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:12:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:12:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2025-03-04 02:12:09,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3153846153846154 [2025-03-04 02:12:09,350 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 74 flow. Second operand 13 states and 205 transitions. [2025-03-04 02:12:09,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 102 transitions, 485 flow [2025-03-04 02:12:09,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:12:09,352 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 186 flow [2025-03-04 02:12:09,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=186, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2025-03-04 02:12:09,352 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2025-03-04 02:12:09,352 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 186 flow [2025-03-04 02:12:09,353 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-04 02:12:09,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:09,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:12:09,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:12:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1786758473, now seen corresponding path program 2 times [2025-03-04 02:12:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135666542] [2025-03-04 02:12:09,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:12:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:09,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:12:09,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:12:09,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:09,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:09,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:09,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:09,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135666542] [2025-03-04 02:12:09,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135666542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:09,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:09,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:09,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365030554] [2025-03-04 02:12:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:09,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:12:09,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:09,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:12:09,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:12:09,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:09,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 186 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-04 02:12:09,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:09,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:09,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:10,164 INFO L124 PetriNetUnfolderBase]: 469/870 cut-off events. [2025-03-04 02:12:10,164 INFO L125 PetriNetUnfolderBase]: For 732/732 co-relation queries the response was YES. [2025-03-04 02:12:10,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2449 conditions, 870 events. 469/870 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4121 event pairs, 18 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 2405. Up to 302 conditions per place. [2025-03-04 02:12:10,169 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 75 selfloop transitions, 25 changer transitions 0/102 dead transitions. [2025-03-04 02:12:10,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 637 flow [2025-03-04 02:12:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:12:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:12:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2025-03-04 02:12:10,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30727272727272725 [2025-03-04 02:12:10,171 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 186 flow. Second operand 11 states and 169 transitions. [2025-03-04 02:12:10,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 637 flow [2025-03-04 02:12:10,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:12:10,178 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 348 flow [2025-03-04 02:12:10,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=348, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2025-03-04 02:12:10,179 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2025-03-04 02:12:10,180 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 348 flow [2025-03-04 02:12:10,180 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-04 02:12:10,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:10,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:10,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:12:10,180 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-04 02:12:10,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:10,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1298106795, now seen corresponding path program 3 times [2025-03-04 02:12:10,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:10,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64417222] [2025-03-04 02:12:10,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:10,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:10,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:12:10,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:12:10,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:12:10,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:10,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:10,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64417222] [2025-03-04 02:12:10,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64417222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:10,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:10,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:12:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433698089] [2025-03-04 02:12:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:10,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:12:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:10,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:12:10,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:12:10,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:10,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 348 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-04 02:12:10,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:10,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:10,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:11,554 INFO L124 PetriNetUnfolderBase]: 646/1205 cut-off events. [2025-03-04 02:12:11,555 INFO L125 PetriNetUnfolderBase]: For 2110/2110 co-relation queries the response was YES. [2025-03-04 02:12:11,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 1205 events. 646/1205 cut-off events. For 2110/2110 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6171 event pairs, 50 based on Foata normal form. 1/1206 useless extension candidates. Maximal degree in co-relation 3788. Up to 441 conditions per place. [2025-03-04 02:12:11,563 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 85 selfloop transitions, 39 changer transitions 0/126 dead transitions. [2025-03-04 02:12:11,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 126 transitions, 943 flow [2025-03-04 02:12:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:12:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:12:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 207 transitions. [2025-03-04 02:12:11,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2957142857142857 [2025-03-04 02:12:11,565 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 348 flow. Second operand 14 states and 207 transitions. [2025-03-04 02:12:11,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 126 transitions, 943 flow [2025-03-04 02:12:11,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 126 transitions, 918 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 02:12:11,577 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 610 flow [2025-03-04 02:12:11,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=610, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2025-03-04 02:12:11,578 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2025-03-04 02:12:11,578 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 610 flow [2025-03-04 02:12:11,578 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-04 02:12:11,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:11,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:11,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:12:11,579 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-04 02:12:11,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1880017939, now seen corresponding path program 4 times [2025-03-04 02:12:11,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:11,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145258527] [2025-03-04 02:12:11,579 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:12:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:11,599 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 02:12:11,614 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:12:11,614 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:12:11,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:11,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145258527] [2025-03-04 02:12:11,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145258527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:11,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:11,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:11,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252327160] [2025-03-04 02:12:11,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:11,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:12:11,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:11,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:12:11,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:12:11,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:11,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 610 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-04 02:12:11,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:11,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:11,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:12,303 INFO L124 PetriNetUnfolderBase]: 760/1457 cut-off events. [2025-03-04 02:12:12,303 INFO L125 PetriNetUnfolderBase]: For 4365/4365 co-relation queries the response was YES. [2025-03-04 02:12:12,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 1457 events. 760/1457 cut-off events. For 4365/4365 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8033 event pairs, 36 based on Foata normal form. 1/1458 useless extension candidates. Maximal degree in co-relation 4901. Up to 441 conditions per place. [2025-03-04 02:12:12,312 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 81 selfloop transitions, 54 changer transitions 0/137 dead transitions. [2025-03-04 02:12:12,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 137 transitions, 1287 flow [2025-03-04 02:12:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:12:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:12:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2025-03-04 02:12:12,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31272727272727274 [2025-03-04 02:12:12,314 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 610 flow. Second operand 11 states and 172 transitions. [2025-03-04 02:12:12,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 137 transitions, 1287 flow [2025-03-04 02:12:12,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 1247 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 02:12:12,327 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 973 flow [2025-03-04 02:12:12,327 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-04 02:12:12,328 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2025-03-04 02:12:12,328 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 973 flow [2025-03-04 02:12:12,328 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-04 02:12:12,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:12,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:12,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:12:12,328 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-04 02:12:12,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1931457231, now seen corresponding path program 5 times [2025-03-04 02:12:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:12,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211130766] [2025-03-04 02:12:12,329 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:12:12,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:12,343 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:12:12,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:12:12,353 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:12,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:12,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:12,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211130766] [2025-03-04 02:12:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211130766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:12:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681495866] [2025-03-04 02:12:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:12,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:12:12,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:12,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:12:12,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:12:12,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:12,802 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-04 02:12:12,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:12,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:12,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:13,482 INFO L124 PetriNetUnfolderBase]: 760/1455 cut-off events. [2025-03-04 02:12:13,482 INFO L125 PetriNetUnfolderBase]: For 6452/6452 co-relation queries the response was YES. [2025-03-04 02:12:13,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 1455 events. 760/1455 cut-off events. For 6452/6452 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7975 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-04 02:12:13,489 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 111 selfloop transitions, 55 changer transitions 0/167 dead transitions. [2025-03-04 02:12:13,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 167 transitions, 1701 flow [2025-03-04 02:12:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:12:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:12:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 229 transitions. [2025-03-04 02:12:13,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30533333333333335 [2025-03-04 02:12:13,491 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 973 flow. Second operand 15 states and 229 transitions. [2025-03-04 02:12:13,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 167 transitions, 1701 flow [2025-03-04 02:12:13,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 167 transitions, 1643 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 02:12:13,512 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 1160 flow [2025-03-04 02:12:13,513 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-04 02:12:13,513 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2025-03-04 02:12:13,513 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 1160 flow [2025-03-04 02:12:13,513 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-04 02:12:13,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:13,513 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-04 02:12:13,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:12:13,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:12:13,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1487149528, now seen corresponding path program 1 times [2025-03-04 02:12:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:13,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581209809] [2025-03-04 02:12:13,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:13,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:13,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:12:13,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:12:13,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:13,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:14,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:14,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581209809] [2025-03-04 02:12:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581209809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369223747] [2025-03-04 02:12:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:14,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:14,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:14,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:14,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:14,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:14,204 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-04 02:12:14,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:14,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:14,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:14,985 INFO L124 PetriNetUnfolderBase]: 948/1803 cut-off events. [2025-03-04 02:12:14,985 INFO L125 PetriNetUnfolderBase]: For 11091/11091 co-relation queries the response was YES. [2025-03-04 02:12:14,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7377 conditions, 1803 events. 948/1803 cut-off events. For 11091/11091 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10372 event pairs, 298 based on Foata normal form. 1/1804 useless extension candidates. Maximal degree in co-relation 7021. Up to 1266 conditions per place. [2025-03-04 02:12:14,996 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 84 selfloop transitions, 73 changer transitions 45/203 dead transitions. [2025-03-04 02:12:14,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 2608 flow [2025-03-04 02:12:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:12:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:12:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 250 transitions. [2025-03-04 02:12:14,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2025-03-04 02:12:14,998 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 1160 flow. Second operand 18 states and 250 transitions. [2025-03-04 02:12:14,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 2608 flow [2025-03-04 02:12:15,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 203 transitions, 2510 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-03-04 02:12:15,046 INFO L231 Difference]: Finished difference. Result has 123 places, 137 transitions, 2018 flow [2025-03-04 02:12:15,046 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-04 02:12:15,047 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 78 predicate places. [2025-03-04 02:12:15,047 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 137 transitions, 2018 flow [2025-03-04 02:12:15,048 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-04 02:12:15,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:15,048 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-04 02:12:15,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:12:15,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:12:15,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash -326901184, now seen corresponding path program 2 times [2025-03-04 02:12:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:15,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643074606] [2025-03-04 02:12:15,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:12:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:15,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:12:15,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:12:15,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:15,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:15,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:15,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643074606] [2025-03-04 02:12:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643074606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:15,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:15,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:15,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053319085] [2025-03-04 02:12:15,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:15,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:15,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:15,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:15,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:15,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:15,968 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-04 02:12:15,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:15,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:15,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:16,845 INFO L124 PetriNetUnfolderBase]: 1079/2082 cut-off events. [2025-03-04 02:12:16,845 INFO L125 PetriNetUnfolderBase]: For 14567/14567 co-relation queries the response was YES. [2025-03-04 02:12:16,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9617 conditions, 2082 events. 1079/2082 cut-off events. For 14567/14567 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12693 event pairs, 379 based on Foata normal form. 2/2084 useless extension candidates. Maximal degree in co-relation 9535. Up to 1470 conditions per place. [2025-03-04 02:12:16,863 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 139 selfloop transitions, 83 changer transitions 35/258 dead transitions. [2025-03-04 02:12:16,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 258 transitions, 3696 flow [2025-03-04 02:12:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:12:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:12:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 277 transitions. [2025-03-04 02:12:16,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29157894736842105 [2025-03-04 02:12:16,865 INFO L175 Difference]: Start difference. First operand has 123 places, 137 transitions, 2018 flow. Second operand 19 states and 277 transitions. [2025-03-04 02:12:16,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 258 transitions, 3696 flow [2025-03-04 02:12:16,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 258 transitions, 3552 flow, removed 58 selfloop flow, removed 10 redundant places. [2025-03-04 02:12:16,938 INFO L231 Difference]: Finished difference. Result has 129 places, 172 transitions, 2591 flow [2025-03-04 02:12:16,938 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-04 02:12:16,939 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 84 predicate places. [2025-03-04 02:12:16,939 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 172 transitions, 2591 flow [2025-03-04 02:12:16,939 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-04 02:12:16,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:16,939 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-04 02:12:16,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:12:16,940 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-04 02:12:16,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash -978636602, now seen corresponding path program 3 times [2025-03-04 02:12:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:16,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929396560] [2025-03-04 02:12:16,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:16,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:16,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:12:16,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:12:16,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:12:16,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:17,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929396560] [2025-03-04 02:12:17,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929396560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:17,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:17,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:17,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826236556] [2025-03-04 02:12:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:17,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:17,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:17,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:17,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:17,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:17,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 172 transitions, 2591 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-04 02:12:17,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:17,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:17,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:18,518 INFO L124 PetriNetUnfolderBase]: 1199/2352 cut-off events. [2025-03-04 02:12:18,518 INFO L125 PetriNetUnfolderBase]: For 16830/16830 co-relation queries the response was YES. [2025-03-04 02:12:18,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11136 conditions, 2352 events. 1199/2352 cut-off events. For 16830/16830 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14852 event pairs, 397 based on Foata normal form. 2/2354 useless extension candidates. Maximal degree in co-relation 11042. Up to 1404 conditions per place. [2025-03-04 02:12:18,544 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 149 selfloop transitions, 109 changer transitions 36/295 dead transitions. [2025-03-04 02:12:18,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 295 transitions, 4270 flow [2025-03-04 02:12:18,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:12:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:12:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 325 transitions. [2025-03-04 02:12:18,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2025-03-04 02:12:18,547 INFO L175 Difference]: Start difference. First operand has 129 places, 172 transitions, 2591 flow. Second operand 23 states and 325 transitions. [2025-03-04 02:12:18,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 295 transitions, 4270 flow [2025-03-04 02:12:18,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 295 transitions, 4122 flow, removed 41 selfloop flow, removed 6 redundant places. [2025-03-04 02:12:18,654 INFO L231 Difference]: Finished difference. Result has 154 places, 202 transitions, 3286 flow [2025-03-04 02:12:18,655 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=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3286, PETRI_PLACES=154, PETRI_TRANSITIONS=202} [2025-03-04 02:12:18,655 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 109 predicate places. [2025-03-04 02:12:18,655 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 202 transitions, 3286 flow [2025-03-04 02:12:18,655 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-04 02:12:18,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:18,655 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-04 02:12:18,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:12:18,660 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-04 02:12:18,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1443238064, now seen corresponding path program 4 times [2025-03-04 02:12:18,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:18,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230411256] [2025-03-04 02:12:18,660 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:12:18,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:18,682 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:12:18,694 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:12:18,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:12:18,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:19,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:19,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230411256] [2025-03-04 02:12:19,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230411256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:19,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:19,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:19,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553984315] [2025-03-04 02:12:19,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:19,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:19,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:19,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:19,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:19,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-04 02:12:19,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 202 transitions, 3286 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-04 02:12:19,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:19,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-04 02:12:19,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:20,222 INFO L124 PetriNetUnfolderBase]: 1203/2418 cut-off events. [2025-03-04 02:12:20,223 INFO L125 PetriNetUnfolderBase]: For 18936/18936 co-relation queries the response was YES. [2025-03-04 02:12:20,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12052 conditions, 2418 events. 1203/2418 cut-off events. For 18936/18936 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15877 event pairs, 484 based on Foata normal form. 1/2419 useless extension candidates. Maximal degree in co-relation 11932. Up to 1716 conditions per place. [2025-03-04 02:12:20,235 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 164 selfloop transitions, 94 changer transitions 35/294 dead transitions. [2025-03-04 02:12:20,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 294 transitions, 4628 flow [2025-03-04 02:12:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:12:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:12:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 265 transitions. [2025-03-04 02:12:20,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2025-03-04 02:12:20,237 INFO L175 Difference]: Start difference. First operand has 154 places, 202 transitions, 3286 flow. Second operand 18 states and 265 transitions. [2025-03-04 02:12:20,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 294 transitions, 4628 flow [2025-03-04 02:12:20,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 294 transitions, 4560 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-03-04 02:12:20,321 INFO L231 Difference]: Finished difference. Result has 168 places, 218 transitions, 3731 flow [2025-03-04 02:12:20,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3231, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3731, PETRI_PLACES=168, PETRI_TRANSITIONS=218} [2025-03-04 02:12:20,322 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 123 predicate places. [2025-03-04 02:12:20,322 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 218 transitions, 3731 flow [2025-03-04 02:12:20,322 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-04 02:12:20,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:20,322 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-04 02:12:20,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:12:20,322 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-04 02:12:20,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1526275524, now seen corresponding path program 5 times [2025-03-04 02:12:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191299008] [2025-03-04 02:12:20,323 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:12:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:20,346 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:12:20,360 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:12:20,360 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:20,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:12:20,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:12:20,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:12:20,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:12:20,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:20,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:12:20,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:12:20,405 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:12:20,406 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-04 02:12:20,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-04 02:12:20,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-04 02:12:20,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-04 02:12:20,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-04 02:12:20,408 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-04 02:12:20,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:12:20,409 INFO L422 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1] [2025-03-04 02:12:20,457 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:12:20,459 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:12:20,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:12:20 BasicIcfg [2025-03-04 02:12:20,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:12:20,464 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:12:20,464 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:12:20,465 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:12:20,465 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:12:05" (3/4) ... [2025-03-04 02:12:20,466 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 02:12:20,524 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 15. [2025-03-04 02:12:20,567 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:12:20,567 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:12:20,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:12:20,568 INFO L158 Benchmark]: Toolchain (without parser) took 15685.92ms. Allocated memory was 142.6MB in the beginning and 796.9MB in the end (delta: 654.3MB). Free memory was 109.7MB in the beginning and 662.9MB in the end (delta: -553.2MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. [2025-03-04 02:12:20,569 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:20,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.16ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 79.4MB in the end (delta: 30.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 02:12:20,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 77.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:20,570 INFO L158 Benchmark]: Boogie Preprocessor took 38.08ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 73.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:20,571 INFO L158 Benchmark]: IcfgBuilder took 545.64ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 104.9MB in the end (delta: -30.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2025-03-04 02:12:20,572 INFO L158 Benchmark]: TraceAbstraction took 14542.63ms. Allocated memory was 142.6MB in the beginning and 796.9MB in the end (delta: 654.3MB). Free memory was 104.9MB in the beginning and 675.5MB in the end (delta: -570.6MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2025-03-04 02:12:20,572 INFO L158 Benchmark]: Witness Printer took 102.96ms. Allocated memory is still 796.9MB. Free memory was 675.5MB in the beginning and 662.9MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:12:20,573 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.16ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 79.4MB in the end (delta: 30.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 77.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.08ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 73.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 545.64ms. Allocated memory is still 142.6MB. Free memory was 73.9MB in the beginning and 104.9MB in the end (delta: -30.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14542.63ms. Allocated memory was 142.6MB in the beginning and 796.9MB in the end (delta: 654.3MB). Free memory was 104.9MB in the beginning and 675.5MB in the end (delta: -570.6MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. * Witness Printer took 102.96ms. Allocated memory is still 796.9MB. Free memory was 675.5MB in the beginning and 662.9MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [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: 14.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1280 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1220 mSDsluCounter, 1254 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1189 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4941 IncrementalHoareTripleChecker+Invalid, 5088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 65 mSDtfsCounter, 4941 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3731occurred in iteration=12, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 2879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-04 02:12:20,593 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