./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.c -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 1a47f601dac55524949bba968e873e267efb3beee8a7cca477f42267cf0ac989 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:52:14,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:52:15,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:52:15,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:52:15,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:52:15,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:52:15,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:52:15,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:52:15,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:52:15,044 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:52:15,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:52:15,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:52:15,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:52:15,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:52:15,045 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:52:15,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:52:15,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:52:15,045 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:52:15,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:52:15,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:52:15,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:52:15,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:52:15,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:52:15,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:52:15,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:52:15,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:52:15,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:52:15,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:52:15,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:52:15,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:52:15,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:52:15,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:52:15,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:52:15,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:52:15,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:52:15,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:52:15,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:52:15,047 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 -> 1a47f601dac55524949bba968e873e267efb3beee8a7cca477f42267cf0ac989 [2025-04-29 10:52:15,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:52:15,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:52:15,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:52:15,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:52:15,276 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:52:15,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.c [2025-04-29 10:52:16,590 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25f07487/8d92a53577ea41fcad48b13c6b280fa0/FLAG18131563b [2025-04-29 10:52:16,790 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:52:16,790 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.c [2025-04-29 10:52:16,791 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:52:16,791 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:52:16,795 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25f07487/8d92a53577ea41fcad48b13c6b280fa0/FLAG18131563b [2025-04-29 10:52:17,590 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25f07487/8d92a53577ea41fcad48b13c6b280fa0 [2025-04-29 10:52:17,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:52:17,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:52:17,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:52:17,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:52:17,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:52:17,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@499e4dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17, skipping insertion in model container [2025-04-29 10:52:17,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:52:17,729 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.c[399,412] [2025-04-29 10:52:17,749 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:52:17,757 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:52:17,774 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.c[399,412] [2025-04-29 10:52:17,782 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:52:17,804 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:52:17,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17 WrapperNode [2025-04-29 10:52:17,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:52:17,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:52:17,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:52:17,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:52:17,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,843 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 146 [2025-04-29 10:52:17,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:52:17,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:52:17,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:52:17,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:52:17,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,860 INFO L175 MemorySlicer]: Split 3 memory accesses to 3 slices as follows [1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 1, 1]. The 0 writes are split as follows [0, 0, 0]. [2025-04-29 10:52:17,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:52:17,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:52:17,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:52:17,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:52:17,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:52:17,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:52:17,897 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-04-29 10:52:17,899 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-04-29 10:52:17,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 10:52:17,914 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 10:52:17,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 10:52:17,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 10:52:17,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 10:52:17,914 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 10:52:17,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:52:17,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:52:17,914 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 10:52:17,914 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 10:52:17,915 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 10:52:17,973 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:52:17,974 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:52:18,186 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 10:52:18,187 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:52:18,368 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:52:18,368 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:52:18,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:52:18 BoogieIcfgContainer [2025-04-29 10:52:18,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:52:18,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:52:18,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:52:18,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:52:18,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:52:17" (1/3) ... [2025-04-29 10:52:18,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f360d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:52:18, skipping insertion in model container [2025-04-29 10:52:18,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (2/3) ... [2025-04-29 10:52:18,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f360d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:52:18, skipping insertion in model container [2025-04-29 10:52:18,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:52:18" (3/3) ... [2025-04-29 10:52:18,377 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.c [2025-04-29 10:52:18,387 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:52:18,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.c that has 2 procedures, 50 locations, 53 edges, 1 initial locations, 0 loop locations, and 3 error locations. [2025-04-29 10:52:18,388 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 10:52:18,434 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 10:52:18,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 54 transitions, 112 flow [2025-04-29 10:52:18,480 INFO L116 PetriNetUnfolderBase]: 4/54 cut-off events. [2025-04-29 10:52:18,482 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:52:18,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 54 events. 4/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-04-29 10:52:18,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 54 transitions, 112 flow [2025-04-29 10:52:18,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 89 flow [2025-04-29 10:52:18,493 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:52:18,502 INFO L340 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;@5fc0613e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:52:18,503 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 10:52:18,509 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 10:52:18,509 INFO L116 PetriNetUnfolderBase]: 1/20 cut-off events. [2025-04-29 10:52:18,509 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:52:18,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:18,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:18,510 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-29 10:52:18,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:18,513 INFO L85 PathProgramCache]: Analyzing trace with hash 139501974, now seen corresponding path program 1 times [2025-04-29 10:52:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:18,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457007487] [2025-04-29 10:52:18,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:18,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:18,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 10:52:18,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 10:52:18,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:18,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:18,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:18,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457007487] [2025-04-29 10:52:18,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457007487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:18,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:18,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:52:18,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698954741] [2025-04-29 10:52:18,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:18,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:52:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:18,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:52:18,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:52:18,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-04-29 10:52:18,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-04-29 10:52:18,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:18,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-04-29 10:52:18,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:19,070 INFO L116 PetriNetUnfolderBase]: 202/488 cut-off events. [2025-04-29 10:52:19,070 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:52:19,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 488 events. 202/488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2174 event pairs, 47 based on Foata normal form. 41/499 useless extension candidates. Maximal degree in co-relation 918. Up to 252 conditions per place. [2025-04-29 10:52:19,076 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 44 selfloop transitions, 7 changer transitions 8/67 dead transitions. [2025-04-29 10:52:19,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 255 flow [2025-04-29 10:52:19,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:52:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 10:52:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-04-29 10:52:19,087 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-04-29 10:52:19,088 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 89 flow. Second operand 5 states and 136 transitions. [2025-04-29 10:52:19,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 255 flow [2025-04-29 10:52:19,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:52:19,097 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 116 flow [2025-04-29 10:52:19,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2025-04-29 10:52:19,102 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2025-04-29 10:52:19,102 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 116 flow [2025-04-29 10:52:19,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-04-29 10:52:19,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:19,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:19,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:52:19,103 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-29 10:52:19,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1208034362, now seen corresponding path program 1 times [2025-04-29 10:52:19,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:19,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307921595] [2025-04-29 10:52:19,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:19,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 10:52:19,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 10:52:19,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:19,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:19,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307921595] [2025-04-29 10:52:19,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307921595] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:19,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:19,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156657815] [2025-04-29 10:52:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:19,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:19,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:19,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:19,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2025-04-29 10:52:19,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-04-29 10:52:19,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:19,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2025-04-29 10:52:19,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:19,503 INFO L116 PetriNetUnfolderBase]: 171/435 cut-off events. [2025-04-29 10:52:19,503 INFO L117 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-04-29 10:52:19,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 435 events. 171/435 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1938 event pairs, 69 based on Foata normal form. 15/446 useless extension candidates. Maximal degree in co-relation 962. Up to 204 conditions per place. [2025-04-29 10:52:19,508 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 36 selfloop transitions, 4 changer transitions 38/86 dead transitions. [2025-04-29 10:52:19,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 380 flow [2025-04-29 10:52:19,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:52:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 10:52:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-04-29 10:52:19,511 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2025-04-29 10:52:19,511 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 116 flow. Second operand 8 states and 183 transitions. [2025-04-29 10:52:19,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 380 flow [2025-04-29 10:52:19,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:19,515 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 110 flow [2025-04-29 10:52:19,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2025-04-29 10:52:19,516 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2025-04-29 10:52:19,516 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 110 flow [2025-04-29 10:52:19,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-04-29 10:52:19,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:19,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:19,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:52:19,516 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-29 10:52:19,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2107920068, now seen corresponding path program 1 times [2025-04-29 10:52:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:19,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089498038] [2025-04-29 10:52:19,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:19,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 10:52:19,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 10:52:19,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:19,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:19,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089498038] [2025-04-29 10:52:19,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089498038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:19,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101289344] [2025-04-29 10:52:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:19,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:52:19,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:19,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:52:19,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:52:19,615 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-04-29 10:52:19,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 35 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-04-29 10:52:19,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:19,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-04-29 10:52:19,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:19,705 INFO L116 PetriNetUnfolderBase]: 116/298 cut-off events. [2025-04-29 10:52:19,705 INFO L117 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2025-04-29 10:52:19,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 298 events. 116/298 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1177 event pairs, 55 based on Foata normal form. 11/307 useless extension candidates. Maximal degree in co-relation 725. Up to 178 conditions per place. [2025-04-29 10:52:19,710 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-04-29 10:52:19,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 272 flow [2025-04-29 10:52:19,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:52:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 10:52:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-04-29 10:52:19,711 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2025-04-29 10:52:19,711 INFO L175 Difference]: Start difference. First operand has 57 places, 35 transitions, 110 flow. Second operand 5 states and 119 transitions. [2025-04-29 10:52:19,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 272 flow [2025-04-29 10:52:19,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 212 flow, removed 10 selfloop flow, removed 13 redundant places. [2025-04-29 10:52:19,715 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 122 flow [2025-04-29 10:52:19,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2025-04-29 10:52:19,715 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-04-29 10:52:19,716 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 122 flow [2025-04-29 10:52:19,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-04-29 10:52:19,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:19,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:19,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:52:19,716 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-29 10:52:19,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash -858612660, now seen corresponding path program 1 times [2025-04-29 10:52:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:19,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983750306] [2025-04-29 10:52:19,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:19,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:52:19,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:52:19,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:19,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:19,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:19,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983750306] [2025-04-29 10:52:19,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983750306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:19,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:19,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:52:19,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141044893] [2025-04-29 10:52:19,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:19,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:19,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:19,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:19,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:19,842 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-04-29 10:52:19,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-04-29 10:52:19,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:19,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-04-29 10:52:19,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:19,938 INFO L116 PetriNetUnfolderBase]: 109/277 cut-off events. [2025-04-29 10:52:19,939 INFO L117 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-04-29 10:52:19,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 277 events. 109/277 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1041 event pairs, 41 based on Foata normal form. 8/283 useless extension candidates. Maximal degree in co-relation 622. Up to 146 conditions per place. [2025-04-29 10:52:19,941 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 39 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2025-04-29 10:52:19,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 264 flow [2025-04-29 10:52:19,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:52:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 10:52:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2025-04-29 10:52:19,942 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.404320987654321 [2025-04-29 10:52:19,942 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 122 flow. Second operand 6 states and 131 transitions. [2025-04-29 10:52:19,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 264 flow [2025-04-29 10:52:19,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 254 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-29 10:52:19,945 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 139 flow [2025-04-29 10:52:19,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-04-29 10:52:19,947 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2025-04-29 10:52:19,947 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 139 flow [2025-04-29 10:52:19,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-04-29 10:52:19,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:19,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:19,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:52:19,948 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-29 10:52:19,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1592790816, now seen corresponding path program 1 times [2025-04-29 10:52:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:19,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718308579] [2025-04-29 10:52:19,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:19,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:52:19,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:52:19,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:19,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:20,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:20,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718308579] [2025-04-29 10:52:20,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718308579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:20,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:20,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:20,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095980595] [2025-04-29 10:52:20,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:20,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:20,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:20,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:20,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:20,045 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-04-29 10:52:20,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-04-29 10:52:20,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:20,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-04-29 10:52:20,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:20,112 INFO L116 PetriNetUnfolderBase]: 67/209 cut-off events. [2025-04-29 10:52:20,112 INFO L117 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-04-29 10:52:20,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 209 events. 67/209 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 747 event pairs, 22 based on Foata normal form. 10/217 useless extension candidates. Maximal degree in co-relation 474. Up to 90 conditions per place. [2025-04-29 10:52:20,113 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 37 selfloop transitions, 7 changer transitions 2/56 dead transitions. [2025-04-29 10:52:20,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 287 flow [2025-04-29 10:52:20,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:52:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 10:52:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-04-29 10:52:20,115 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5601851851851852 [2025-04-29 10:52:20,115 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 139 flow. Second operand 4 states and 121 transitions. [2025-04-29 10:52:20,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 287 flow [2025-04-29 10:52:20,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 278 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-29 10:52:20,118 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 154 flow [2025-04-29 10:52:20,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-04-29 10:52:20,119 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2025-04-29 10:52:20,119 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 154 flow [2025-04-29 10:52:20,119 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-04-29 10:52:20,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:20,119 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] [2025-04-29 10:52:20,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:52:20,119 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-29 10:52:20,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:20,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2013763224, now seen corresponding path program 1 times [2025-04-29 10:52:20,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:20,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995202564] [2025-04-29 10:52:20,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:20,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:20,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 10:52:20,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 10:52:20,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:20,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:20,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:20,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995202564] [2025-04-29 10:52:20,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995202564] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:20,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:20,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:20,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289097923] [2025-04-29 10:52:20,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:20,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:20,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:20,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:20,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:20,255 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2025-04-29 10:52:20,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-04-29 10:52:20,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:20,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2025-04-29 10:52:20,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:20,324 INFO L116 PetriNetUnfolderBase]: 66/215 cut-off events. [2025-04-29 10:52:20,325 INFO L117 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-04-29 10:52:20,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 215 events. 66/215 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 765 event pairs, 29 based on Foata normal form. 2/217 useless extension candidates. Maximal degree in co-relation 515. Up to 100 conditions per place. [2025-04-29 10:52:20,326 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 34 selfloop transitions, 5 changer transitions 3/51 dead transitions. [2025-04-29 10:52:20,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 275 flow [2025-04-29 10:52:20,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:52:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 10:52:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-04-29 10:52:20,327 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-29 10:52:20,327 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 154 flow. Second operand 4 states and 116 transitions. [2025-04-29 10:52:20,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 275 flow [2025-04-29 10:52:20,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:52:20,330 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 156 flow [2025-04-29 10:52:20,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2025-04-29 10:52:20,330 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2025-04-29 10:52:20,330 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 156 flow [2025-04-29 10:52:20,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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-04-29 10:52:20,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:20,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:20,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:52:20,332 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-29 10:52:20,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash 452866420, now seen corresponding path program 1 times [2025-04-29 10:52:20,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:20,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880218130] [2025-04-29 10:52:20,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:20,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:20,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 10:52:20,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:52:20,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:20,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:20,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:20,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880218130] [2025-04-29 10:52:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880218130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:20,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:20,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:52:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101419449] [2025-04-29 10:52:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:20,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:52:20,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:20,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:52:20,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:52:20,480 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-04-29 10:52:20,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-04-29 10:52:20,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:20,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-04-29 10:52:20,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:20,608 INFO L116 PetriNetUnfolderBase]: 74/206 cut-off events. [2025-04-29 10:52:20,608 INFO L117 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-04-29 10:52:20,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 206 events. 74/206 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 677 event pairs, 14 based on Foata normal form. 12/216 useless extension candidates. Maximal degree in co-relation 563. Up to 47 conditions per place. [2025-04-29 10:52:20,609 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2025-04-29 10:52:20,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 338 flow [2025-04-29 10:52:20,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 10:52:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 10:52:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2025-04-29 10:52:20,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36213991769547327 [2025-04-29 10:52:20,611 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 156 flow. Second operand 9 states and 176 transitions. [2025-04-29 10:52:20,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 338 flow [2025-04-29 10:52:20,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 319 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 10:52:20,614 INFO L231 Difference]: Finished difference. Result has 54 places, 0 transitions, 0 flow [2025-04-29 10:52:20,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=54, PETRI_TRANSITIONS=0} [2025-04-29 10:52:20,615 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2025-04-29 10:52:20,615 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 0 transitions, 0 flow [2025-04-29 10:52:20,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-04-29 10:52:20,617 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-29 10:52:20,617 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-29 10:52:20,617 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-29 10:52:20,617 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-29 10:52:20,617 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-29 10:52:20,617 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-29 10:52:20,618 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-29 10:52:20,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 10:52:20,618 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:20,621 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 10:52:20,621 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:52:20,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:52:20 BasicIcfg [2025-04-29 10:52:20,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:52:20,629 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:52:20,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:52:20,629 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:52:20,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:52:18" (3/4) ... [2025-04-29 10:52:20,632 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:52:20,636 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 10:52:20,639 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-04-29 10:52:20,639 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-04-29 10:52:20,639 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 10:52:20,694 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:52:20,694 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:52:20,694 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:52:20,694 INFO L158 Benchmark]: Toolchain (without parser) took 3101.18ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 45.5MB in the end (delta: 60.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-04-29 10:52:20,695 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:20,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.06ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:52:20,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.31ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:20,696 INFO L158 Benchmark]: Boogie Preprocessor took 29.38ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:20,697 INFO L158 Benchmark]: RCFGBuilder took 494.59ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 49.0MB in the end (delta: 38.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-29 10:52:20,697 INFO L158 Benchmark]: TraceAbstraction took 2259.06ms. Allocated memory is still 142.6MB. Free memory was 49.0MB in the beginning and 50.6MB in the end (delta: -1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:20,697 INFO L158 Benchmark]: Witness Printer took 65.02ms. Allocated memory is still 142.6MB. Free memory was 50.6MB in the beginning and 45.5MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:20,698 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.15ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.06ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 91.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.31ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.38ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 494.59ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 49.0MB in the end (delta: 38.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2259.06ms. Allocated memory is still 142.6MB. Free memory was 49.0MB in the beginning and 50.6MB in the end (delta: -1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 65.02ms. Allocated memory is still 142.6MB. Free memory was 50.6MB in the beginning and 45.5MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 79 locations, 86 edges, 7 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: 2.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 727 IncrementalHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 7 mSDtfsCounter, 727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 10:52:20,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE