./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_5-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_5-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 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:30:19,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:30:19,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:30:19,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:30:19,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:30:19,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:30:19,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:30:19,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:30:19,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:30:19,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:30:19,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:30:19,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:30:19,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:30:19,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:30:19,120 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:30:19,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:30:19,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:30:19,121 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:30:19,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:30:19,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:30:19,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:30:19,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:30:19,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:30:19,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:30:19,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:30:19,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:30:19,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:30:19,122 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:30:19,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:30:19,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:30:19,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:30:19,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:30:19,123 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 -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e [2025-03-17 06:30:19,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:30:19,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:30:19,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:30:19,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:30:19,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:30:19,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2025-03-17 06:30:20,469 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f35e4d6/4488b6fc496249d4909215a1a101239e/FLAG13d89b1b3 [2025-03-17 06:30:20,817 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:30:20,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2025-03-17 06:30:20,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f35e4d6/4488b6fc496249d4909215a1a101239e/FLAG13d89b1b3 [2025-03-17 06:30:21,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f35e4d6/4488b6fc496249d4909215a1a101239e [2025-03-17 06:30:21,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:30:21,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:30:21,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:30:21,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:30:21,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:30:21,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2bb789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21, skipping insertion in model container [2025-03-17 06:30:21,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:30:21,428 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_5-container_of.i[186287,186300] [2025-03-17 06:30:21,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:30:21,479 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:30:21,524 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_5-container_of.i[186287,186300] [2025-03-17 06:30:21,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:30:21,573 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:30:21,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21 WrapperNode [2025-03-17 06:30:21,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:30:21,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:30:21,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:30:21,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:30:21,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,616 INFO L138 Inliner]: procedures = 248, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136 [2025-03-17 06:30:21,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:30:21,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:30:21,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:30:21,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:30:21,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,646 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 2, 15]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 2, 8]. [2025-03-17 06:30:21,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:30:21,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:30:21,671 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:30:21,671 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:30:21,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (1/1) ... [2025-03-17 06:30:21,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:30:21,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:30:21,699 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-17 06:30:21,701 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-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-17 06:30:21,719 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:30:21,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 06:30:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 06:30:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:30:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 06:30:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 06:30:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 06:30:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:30:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:30:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 06:30:21,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:30:21,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:30:21,721 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:30:21,925 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:30:21,927 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:30:22,146 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:30:22,146 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:30:22,277 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:30:22,277 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:30:22,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:30:22 BoogieIcfgContainer [2025-03-17 06:30:22,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:30:22,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:30:22,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:30:22,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:30:22,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:30:21" (1/3) ... [2025-03-17 06:30:22,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161c5251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:30:22, skipping insertion in model container [2025-03-17 06:30:22,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:21" (2/3) ... [2025-03-17 06:30:22,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161c5251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:30:22, skipping insertion in model container [2025-03-17 06:30:22,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:30:22" (3/3) ... [2025-03-17 06:30:22,285 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2025-03-17 06:30:22,296 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:30:22,297 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_5-container_of.i that has 2 procedures, 47 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-17 06:30:22,297 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:30:22,345 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 06:30:22,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 62 transitions, 138 flow [2025-03-17 06:30:22,398 INFO L124 PetriNetUnfolderBase]: 8/75 cut-off events. [2025-03-17 06:30:22,400 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:30:22,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 8/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 163 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2025-03-17 06:30:22,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 62 transitions, 138 flow [2025-03-17 06:30:22,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 55 transitions, 122 flow [2025-03-17 06:30:22,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:30:22,422 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;@2ff86a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:30:22,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 06:30:22,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:30:22,428 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-17 06:30:22,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:30:22,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:22,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:22,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-17 06:30:22,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash 523719986, now seen corresponding path program 1 times [2025-03-17 06:30:22,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:22,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70655274] [2025-03-17 06:30:22,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:22,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:22,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 06:30:22,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 06:30:22,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:22,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:23,034 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-17 06:30:23,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:23,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70655274] [2025-03-17 06:30:23,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70655274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:23,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:23,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:30:23,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119169481] [2025-03-17 06:30:23,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:23,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:30:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:23,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:30:23,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:30:23,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-03-17 06:30:23,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-17 06:30:23,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:23,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-03-17 06:30:23,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:23,437 INFO L124 PetriNetUnfolderBase]: 904/1560 cut-off events. [2025-03-17 06:30:23,438 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 06:30:23,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 1560 events. 904/1560 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7408 event pairs, 679 based on Foata normal form. 2/1537 useless extension candidates. Maximal degree in co-relation 2807. Up to 1158 conditions per place. [2025-03-17 06:30:23,449 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 52 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2025-03-17 06:30:23,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 256 flow [2025-03-17 06:30:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:30:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:30:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-17 06:30:23,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2025-03-17 06:30:23,460 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 122 flow. Second operand 3 states and 91 transitions. [2025-03-17 06:30:23,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 256 flow [2025-03-17 06:30:23,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 248 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 06:30:23,466 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 116 flow [2025-03-17 06:30:23,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-17 06:30:23,470 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2025-03-17 06:30:23,470 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 116 flow [2025-03-17 06:30:23,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-17 06:30:23,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:23,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:23,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:30:23,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-17 06:30:23,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash 783811786, now seen corresponding path program 1 times [2025-03-17 06:30:23,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:23,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310583076] [2025-03-17 06:30:23,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:23,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 06:30:23,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 06:30:23,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:23,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:23,701 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-17 06:30:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:23,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310583076] [2025-03-17 06:30:23,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310583076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:23,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:23,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:30:23,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668647081] [2025-03-17 06:30:23,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:23,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:30:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:23,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:30:23,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:30:23,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 62 [2025-03-17 06:30:23,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-17 06:30:23,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:23,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 62 [2025-03-17 06:30:23,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:24,074 INFO L124 PetriNetUnfolderBase]: 1152/2053 cut-off events. [2025-03-17 06:30:24,075 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-17 06:30:24,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 2053 events. 1152/2053 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10972 event pairs, 579 based on Foata normal form. 120/2154 useless extension candidates. Maximal degree in co-relation 1634. Up to 1102 conditions per place. [2025-03-17 06:30:24,085 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 62 selfloop transitions, 8 changer transitions 4/80 dead transitions. [2025-03-17 06:30:24,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 326 flow [2025-03-17 06:30:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:30:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:30:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-17 06:30:24,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2025-03-17 06:30:24,087 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 116 flow. Second operand 4 states and 116 transitions. [2025-03-17 06:30:24,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 326 flow [2025-03-17 06:30:24,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:30:24,092 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 146 flow [2025-03-17 06:30:24,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2025-03-17 06:30:24,093 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2025-03-17 06:30:24,093 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 146 flow [2025-03-17 06:30:24,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-17 06:30:24,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:24,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:24,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:30:24,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-17 06:30:24,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:24,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1098957505, now seen corresponding path program 1 times [2025-03-17 06:30:24,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:24,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366892416] [2025-03-17 06:30:24,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:24,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:24,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 06:30:24,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 06:30:24,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:24,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:24,223 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-17 06:30:24,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:24,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366892416] [2025-03-17 06:30:24,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366892416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:24,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:24,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:30:24,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887092475] [2025-03-17 06:30:24,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:24,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:30:24,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:24,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:30:24,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:30:24,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 62 [2025-03-17 06:30:24,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-17 06:30:24,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:24,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 62 [2025-03-17 06:30:24,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:24,415 INFO L124 PetriNetUnfolderBase]: 455/809 cut-off events. [2025-03-17 06:30:24,416 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-03-17 06:30:24,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 809 events. 455/809 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3441 event pairs, 63 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 1758. Up to 475 conditions per place. [2025-03-17 06:30:24,421 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 60 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2025-03-17 06:30:24,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 296 flow [2025-03-17 06:30:24,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:30:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:30:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-03-17 06:30:24,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5282258064516129 [2025-03-17 06:30:24,424 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 146 flow. Second operand 4 states and 131 transitions. [2025-03-17 06:30:24,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 296 flow [2025-03-17 06:30:24,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 290 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:30:24,426 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 98 flow [2025-03-17 06:30:24,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-03-17 06:30:24,427 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2025-03-17 06:30:24,427 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 98 flow [2025-03-17 06:30:24,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-17 06:30:24,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:24,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:24,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:30:24,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-17 06:30:24,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1274664289, now seen corresponding path program 1 times [2025-03-17 06:30:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:24,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777265510] [2025-03-17 06:30:24,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:24,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 06:30:24,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 06:30:24,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:24,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:24,675 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-17 06:30:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:24,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777265510] [2025-03-17 06:30:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777265510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:24,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:24,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:30:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691684065] [2025-03-17 06:30:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:24,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:30:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:24,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:30:24,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:30:24,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-03-17 06:30:24,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:30:24,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:24,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-03-17 06:30:24,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:24,798 INFO L124 PetriNetUnfolderBase]: 468/853 cut-off events. [2025-03-17 06:30:24,798 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-03-17 06:30:24,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1979 conditions, 853 events. 468/853 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3423 event pairs, 416 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 652. Up to 763 conditions per place. [2025-03-17 06:30:24,802 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 42 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-17 06:30:24,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 223 flow [2025-03-17 06:30:24,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:30:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:30:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-17 06:30:24,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2025-03-17 06:30:24,804 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 98 flow. Second operand 3 states and 102 transitions. [2025-03-17 06:30:24,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 223 flow [2025-03-17 06:30:24,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:30:24,806 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 137 flow [2025-03-17 06:30:24,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-03-17 06:30:24,806 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2025-03-17 06:30:24,806 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 137 flow [2025-03-17 06:30:24,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:30:24,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:24,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:24,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:30:24,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-17 06:30:24,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1629231223, now seen corresponding path program 1 times [2025-03-17 06:30:24,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:24,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124913992] [2025-03-17 06:30:24,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:24,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 06:30:24,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 06:30:24,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:24,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:24,943 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-17 06:30:24,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124913992] [2025-03-17 06:30:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124913992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:24,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:24,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:30:24,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992460508] [2025-03-17 06:30:24,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:24,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:30:24,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:24,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:30:24,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:30:24,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-03-17 06:30:24,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:30:24,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:24,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-03-17 06:30:24,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:25,070 INFO L124 PetriNetUnfolderBase]: 477/880 cut-off events. [2025-03-17 06:30:25,071 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2025-03-17 06:30:25,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2128 conditions, 880 events. 477/880 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3573 event pairs, 430 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1700. Up to 786 conditions per place. [2025-03-17 06:30:25,075 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 44 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2025-03-17 06:30:25,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 290 flow [2025-03-17 06:30:25,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:30:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:30:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-03-17 06:30:25,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543010752688172 [2025-03-17 06:30:25,076 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 137 flow. Second operand 3 states and 101 transitions. [2025-03-17 06:30:25,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 290 flow [2025-03-17 06:30:25,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 266 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-17 06:30:25,078 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 183 flow [2025-03-17 06:30:25,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-03-17 06:30:25,079 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2025-03-17 06:30:25,079 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 183 flow [2025-03-17 06:30:25,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 06:30:25,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:25,079 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] [2025-03-17 06:30:25,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:30:25,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-17 06:30:25,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash -317643371, now seen corresponding path program 1 times [2025-03-17 06:30:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:25,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758743386] [2025-03-17 06:30:25,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:25,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:25,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:30:25,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:30:25,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:25,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:25,565 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-17 06:30:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758743386] [2025-03-17 06:30:25,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758743386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:25,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:30:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464260587] [2025-03-17 06:30:25,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:25,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:30:25,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:25,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:30:25,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:30:25,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-03-17 06:30:25,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 183 flow. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-17 06:30:25,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:25,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-03-17 06:30:25,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:26,127 INFO L124 PetriNetUnfolderBase]: 1107/2020 cut-off events. [2025-03-17 06:30:26,128 INFO L125 PetriNetUnfolderBase]: For 968/968 co-relation queries the response was YES. [2025-03-17 06:30:26,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5089 conditions, 2020 events. 1107/2020 cut-off events. For 968/968 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 11197 event pairs, 116 based on Foata normal form. 16/2014 useless extension candidates. Maximal degree in co-relation 4227. Up to 540 conditions per place. [2025-03-17 06:30:26,140 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 134 selfloop transitions, 19 changer transitions 0/160 dead transitions. [2025-03-17 06:30:26,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 160 transitions, 868 flow [2025-03-17 06:30:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 06:30:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 06:30:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 335 transitions. [2025-03-17 06:30:26,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4912023460410557 [2025-03-17 06:30:26,141 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 183 flow. Second operand 11 states and 335 transitions. [2025-03-17 06:30:26,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 160 transitions, 868 flow [2025-03-17 06:30:26,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 160 transitions, 836 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 06:30:26,151 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 303 flow [2025-03-17 06:30:26,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=303, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2025-03-17 06:30:26,151 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2025-03-17 06:30:26,151 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 303 flow [2025-03-17 06:30:26,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-17 06:30:26,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:26,152 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] [2025-03-17 06:30:26,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:30:26,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-17 06:30:26,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash 34549291, now seen corresponding path program 2 times [2025-03-17 06:30:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:26,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013816686] [2025-03-17 06:30:26,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:30:26,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:26,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:30:26,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:30:26,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:30:26,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:26,647 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-17 06:30:26,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:26,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013816686] [2025-03-17 06:30:26,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013816686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:26,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:26,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:30:26,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320613181] [2025-03-17 06:30:26,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:26,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:30:26,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:26,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:30:26,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:30:26,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-03-17 06:30:26,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 303 flow. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-17 06:30:26,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:26,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-03-17 06:30:26,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:27,205 INFO L124 PetriNetUnfolderBase]: 1301/2412 cut-off events. [2025-03-17 06:30:27,205 INFO L125 PetriNetUnfolderBase]: For 3191/3191 co-relation queries the response was YES. [2025-03-17 06:30:27,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7686 conditions, 2412 events. 1301/2412 cut-off events. For 3191/3191 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 13998 event pairs, 82 based on Foata normal form. 16/2362 useless extension candidates. Maximal degree in co-relation 4227. Up to 834 conditions per place. [2025-03-17 06:30:27,223 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 131 selfloop transitions, 36 changer transitions 0/174 dead transitions. [2025-03-17 06:30:27,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 174 transitions, 1161 flow [2025-03-17 06:30:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:30:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 06:30:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 340 transitions. [2025-03-17 06:30:27,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45698924731182794 [2025-03-17 06:30:27,225 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 303 flow. Second operand 12 states and 340 transitions. [2025-03-17 06:30:27,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 174 transitions, 1161 flow [2025-03-17 06:30:27,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 174 transitions, 1151 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:30:27,234 INFO L231 Difference]: Finished difference. Result has 81 places, 88 transitions, 553 flow [2025-03-17 06:30:27,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=553, PETRI_PLACES=81, PETRI_TRANSITIONS=88} [2025-03-17 06:30:27,236 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2025-03-17 06:30:27,236 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 88 transitions, 553 flow [2025-03-17 06:30:27,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-17 06:30:27,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:27,236 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] [2025-03-17 06:30:27,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:30:27,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-17 06:30:27,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:27,237 INFO L85 PathProgramCache]: Analyzing trace with hash 449331795, now seen corresponding path program 3 times [2025-03-17 06:30:27,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:27,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117056919] [2025-03-17 06:30:27,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:30:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:27,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:30:27,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:30:27,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:30:27,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:27,656 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-17 06:30:27,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:27,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117056919] [2025-03-17 06:30:27,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117056919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:27,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:27,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:30:27,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047523889] [2025-03-17 06:30:27,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:27,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:30:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:27,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:30:27,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:30:27,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-03-17 06:30:27,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 88 transitions, 553 flow. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-17 06:30:27,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:27,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-03-17 06:30:27,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:28,100 INFO L124 PetriNetUnfolderBase]: 1197/2256 cut-off events. [2025-03-17 06:30:28,101 INFO L125 PetriNetUnfolderBase]: For 5133/5133 co-relation queries the response was YES. [2025-03-17 06:30:28,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7979 conditions, 2256 events. 1197/2256 cut-off events. For 5133/5133 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 13008 event pairs, 154 based on Foata normal form. 16/2206 useless extension candidates. Maximal degree in co-relation 4285. Up to 1412 conditions per place. [2025-03-17 06:30:28,114 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 102 selfloop transitions, 39 changer transitions 0/148 dead transitions. [2025-03-17 06:30:28,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 148 transitions, 1179 flow [2025-03-17 06:30:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:30:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 06:30:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 280 transitions. [2025-03-17 06:30:28,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2025-03-17 06:30:28,116 INFO L175 Difference]: Start difference. First operand has 81 places, 88 transitions, 553 flow. Second operand 10 states and 280 transitions. [2025-03-17 06:30:28,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 148 transitions, 1179 flow [2025-03-17 06:30:28,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 148 transitions, 1131 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-17 06:30:28,128 INFO L231 Difference]: Finished difference. Result has 92 places, 104 transitions, 824 flow [2025-03-17 06:30:28,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=824, PETRI_PLACES=92, PETRI_TRANSITIONS=104} [2025-03-17 06:30:28,128 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 35 predicate places. [2025-03-17 06:30:28,128 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 104 transitions, 824 flow [2025-03-17 06:30:28,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-17 06:30:28,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:28,129 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] [2025-03-17 06:30:28,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:30:28,129 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-17 06:30:28,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash 761744125, now seen corresponding path program 4 times [2025-03-17 06:30:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:28,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975857408] [2025-03-17 06:30:28,129 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:30:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:28,145 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 06:30:28,160 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:30:28,160 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:30:28,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:28,585 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-17 06:30:28,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:28,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975857408] [2025-03-17 06:30:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975857408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:28,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:28,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:30:28,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621822468] [2025-03-17 06:30:28,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:28,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:30:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:28,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:30:28,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:30:28,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-03-17 06:30:28,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 104 transitions, 824 flow. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-17 06:30:28,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:28,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-03-17 06:30:28,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:29,182 INFO L124 PetriNetUnfolderBase]: 1412/2716 cut-off events. [2025-03-17 06:30:29,182 INFO L125 PetriNetUnfolderBase]: For 7991/7991 co-relation queries the response was YES. [2025-03-17 06:30:29,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10214 conditions, 2716 events. 1412/2716 cut-off events. For 7991/7991 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 16620 event pairs, 167 based on Foata normal form. 32/2659 useless extension candidates. Maximal degree in co-relation 9854. Up to 1332 conditions per place. [2025-03-17 06:30:29,202 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 164 selfloop transitions, 45 changer transitions 0/216 dead transitions. [2025-03-17 06:30:29,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 216 transitions, 1854 flow [2025-03-17 06:30:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:30:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 06:30:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 359 transitions. [2025-03-17 06:30:29,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4825268817204301 [2025-03-17 06:30:29,204 INFO L175 Difference]: Start difference. First operand has 92 places, 104 transitions, 824 flow. Second operand 12 states and 359 transitions. [2025-03-17 06:30:29,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 216 transitions, 1854 flow [2025-03-17 06:30:29,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 216 transitions, 1750 flow, removed 47 selfloop flow, removed 2 redundant places. [2025-03-17 06:30:29,222 INFO L231 Difference]: Finished difference. Result has 107 places, 117 transitions, 1064 flow [2025-03-17 06:30:29,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1064, PETRI_PLACES=107, PETRI_TRANSITIONS=117} [2025-03-17 06:30:29,223 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 50 predicate places. [2025-03-17 06:30:29,223 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 117 transitions, 1064 flow [2025-03-17 06:30:29,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 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-17 06:30:29,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:29,223 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] [2025-03-17 06:30:29,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:30:29,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-17 06:30:29,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1502301653, now seen corresponding path program 5 times [2025-03-17 06:30:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:29,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628650589] [2025-03-17 06:30:29,224 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:30:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:29,242 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:30:29,252 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:30:29,253 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:30:29,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:30:29,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:30:29,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 06:30:29,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 06:30:29,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:29,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:30:29,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:30:29,287 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:30:29,288 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-03-17 06:30:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-17 06:30:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-17 06:30:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-17 06:30:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-17 06:30:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-17 06:30:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-03-17 06:30:29,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-03-17 06:30:29,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:30:29,289 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-03-17 06:30:29,324 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 06:30:29,324 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:30:29,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:30:29 BasicIcfg [2025-03-17 06:30:29,329 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:30:29,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:30:29,330 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:30:29,330 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:30:29,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:30:22" (3/4) ... [2025-03-17 06:30:29,331 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 06:30:29,391 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-03-17 06:30:29,424 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 06:30:29,424 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 06:30:29,424 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:30:29,425 INFO L158 Benchmark]: Toolchain (without parser) took 8362.70ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 103.7MB in the beginning and 318.5MB in the end (delta: -214.7MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2025-03-17 06:30:29,425 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:30:29,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.18ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 72.0MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:30:29,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.85ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 70.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:30:29,426 INFO L158 Benchmark]: Boogie Preprocessor took 48.49ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 66.2MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:30:29,426 INFO L158 Benchmark]: IcfgBuilder took 606.40ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 93.9MB in the end (delta: -27.7MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2025-03-17 06:30:29,426 INFO L158 Benchmark]: TraceAbstraction took 7050.20ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 93.2MB in the beginning and 331.3MB in the end (delta: -238.1MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2025-03-17 06:30:29,426 INFO L158 Benchmark]: Witness Printer took 94.52ms. Allocated memory is still 469.8MB. Free memory was 331.3MB in the beginning and 318.5MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:30:29,427 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.94ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.18ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 72.0MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.85ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 70.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.49ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 66.2MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 606.40ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 93.9MB in the end (delta: -27.7MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7050.20ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 93.2MB in the beginning and 331.3MB in the end (delta: -238.1MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * Witness Printer took 94.52ms. Allocated memory is still 469.8MB. Free memory was 331.3MB in the beginning and 318.5MB in the end (delta: 12.8MB). 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; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={6:24}, \old(data)={6:0}, d={6:24}, data={6: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) );}) [L3907] 1 data->shared.a = 1 VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3910] EXPR 1 data->shared.b [L3910] 1 int lb = data->shared.b; [L3913] 1 data->shared.b = lb + 1 VAL [\old(arg)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3916] 1 return 0; [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1=-1, t2=0] [L3931] 0 return 0; VAL [\old(arg)={6:24}, \old(data)={6:0}, \result=0, \result={0:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, 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) );}) [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3938] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={6:24}, \old(data)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3941] 0 data->shared.a = 3 VAL [\old(arg)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3907] 2 data->shared.a = 1 VAL [\old(arg)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3944] 0 data->shared.b = 3 VAL [\old(arg)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3947] EXPR 0 data->shared.a [L3947] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] 0 reach_error() VAL [\old(arg)={6:24}, \old(expression)=0, \result={0:0}, arg={6:24}, data={6:0}, dev={6: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: 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: 3929]: 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, 67 locations, 74 edges, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 656 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1960 IncrementalHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 11 mSDtfsCounter, 1960 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-17 06:30:29,442 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