./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:53:26,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:53:26,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:53:26,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:53:26,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:53:26,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:53:26,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:53:26,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:53:26,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:53:26,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:53:26,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:53:26,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:53:26,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:53:26,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:53:26,555 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:53:26,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:53:26,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:53:26,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:53:26,556 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 [2025-03-04 09:53:26,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:53:26,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:53:26,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:53:26,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:53:26,801 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:53:26,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:53:28,019 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746572888/2526baa939654e4fa2245074ff26739a/FLAG9967bf4b3 [2025-03-04 09:53:28,303 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:53:28,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:53:28,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746572888/2526baa939654e4fa2245074ff26739a/FLAG9967bf4b3 [2025-03-04 09:53:28,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/746572888/2526baa939654e4fa2245074ff26739a [2025-03-04 09:53:28,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:53:28,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:53:28,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:53:28,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:53:28,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:53:28,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:28,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f13cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28, skipping insertion in model container [2025-03-04 09:53:28,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:28,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:53:28,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:53:28,875 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:53:28,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:53:28,989 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:53:28,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28 WrapperNode [2025-03-04 09:53:28,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:53:28,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:53:28,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:53:28,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:53:28,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,032 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 108 [2025-03-04 09:53:29,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:53:29,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:53:29,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:53:29,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:53:29,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,062 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:53:29,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:53:29,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:53:29,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:53:29,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:53:29,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (1/1) ... [2025-03-04 09:53:29,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:53:29,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:53:29,115 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:53:29,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:53:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:53:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:53:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:53:29,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:53:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:53:29,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:53:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:53:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:53:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:53:29,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:53:29,136 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:53:29,244 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:53:29,245 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:53:29,490 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:53:29,490 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:53:29,651 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:53:29,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:53:29,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:53:29 BoogieIcfgContainer [2025-03-04 09:53:29,652 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:53:29,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:53:29,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:53:29,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:53:29,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:53:28" (1/3) ... [2025-03-04 09:53:29,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9c24de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:53:29, skipping insertion in model container [2025-03-04 09:53:29,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:28" (2/3) ... [2025-03-04 09:53:29,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9c24de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:53:29, skipping insertion in model container [2025-03-04 09:53:29,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:53:29" (3/3) ... [2025-03-04 09:53:29,660 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:53:29,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:53:29,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 35 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:53:29,673 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:53:29,712 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:53:29,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2025-03-04 09:53:29,781 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-03-04 09:53:29,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:53:29,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 2/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-04 09:53:29,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2025-03-04 09:53:29,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 74 flow [2025-03-04 09:53:29,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:53:29,806 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=None, 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;@42658f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:53:29,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 09:53:29,813 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:53:29,813 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-04 09:53:29,813 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:53:29,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:29,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 09:53:29,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:29,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash 10254501, now seen corresponding path program 1 times [2025-03-04 09:53:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:29,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006352167] [2025-03-04 09:53:29,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:29,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:53:29,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:53:29,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:29,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:30,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:30,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006352167] [2025-03-04 09:53:30,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006352167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:30,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:30,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:53:30,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317914868] [2025-03-04 09:53:30,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:30,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:53:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:30,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:53:30,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:53:30,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-04 09:53:30,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:30,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:30,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-04 09:53:30,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:30,547 INFO L124 PetriNetUnfolderBase]: 679/1136 cut-off events. [2025-03-04 09:53:30,547 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 09:53:30,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1136 events. 679/1136 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5595 event pairs, 54 based on Foata normal form. 83/1216 useless extension candidates. Maximal degree in co-relation 2256. Up to 986 conditions per place. [2025-03-04 09:53:30,558 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 37 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2025-03-04 09:53:30,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 185 flow [2025-03-04 09:53:30,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:53:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:53:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 09:53:30,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2025-03-04 09:53:30,571 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 74 flow. Second operand 3 states and 70 transitions. [2025-03-04 09:53:30,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 185 flow [2025-03-04 09:53:30,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:53:30,575 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2025-03-04 09:53:30,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-03-04 09:53:30,579 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-03-04 09:53:30,580 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2025-03-04 09:53:30,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:30,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:30,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:30,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:53:30,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1619811814, now seen corresponding path program 1 times [2025-03-04 09:53:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891704731] [2025-03-04 09:53:30,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:30,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:53:30,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:53:30,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:30,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:30,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891704731] [2025-03-04 09:53:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891704731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:30,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:30,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:53:30,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99448421] [2025-03-04 09:53:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:30,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:53:30,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:30,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:53:30,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:53:30,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 09:53:30,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:30,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:30,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 09:53:30,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:30,802 INFO L124 PetriNetUnfolderBase]: 608/1104 cut-off events. [2025-03-04 09:53:30,802 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 09:53:30,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2186 conditions, 1104 events. 608/1104 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5506 event pairs, 608 based on Foata normal form. 42/1137 useless extension candidates. Maximal degree in co-relation 2176. Up to 999 conditions per place. [2025-03-04 09:53:30,807 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 21 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2025-03-04 09:53:30,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 110 flow [2025-03-04 09:53:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:53:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:53:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-03-04 09:53:30,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-04 09:53:30,808 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 3 states and 45 transitions. [2025-03-04 09:53:30,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 110 flow [2025-03-04 09:53:30,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:53:30,809 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2025-03-04 09:53:30,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2025-03-04 09:53:30,810 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2025-03-04 09:53:30,810 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2025-03-04 09:53:30,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:30,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:30,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:30,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:53:30,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:30,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:30,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1619812210, now seen corresponding path program 1 times [2025-03-04 09:53:30,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:30,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382612081] [2025-03-04 09:53:30,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:30,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:30,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:53:30,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:53:30,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:30,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:30,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:30,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382612081] [2025-03-04 09:53:30,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382612081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:30,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:30,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:53:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606872095] [2025-03-04 09:53:30,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:30,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:53:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:30,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:53:30,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:53:30,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 09:53:30,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:30,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:30,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 09:53:30,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:31,277 INFO L124 PetriNetUnfolderBase]: 703/1235 cut-off events. [2025-03-04 09:53:31,278 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:53:31,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 1235 events. 703/1235 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6002 event pairs, 151 based on Foata normal form. 0/1202 useless extension candidates. Maximal degree in co-relation 2419. Up to 633 conditions per place. [2025-03-04 09:53:31,282 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 29 selfloop transitions, 2 changer transitions 47/82 dead transitions. [2025-03-04 09:53:31,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 82 transitions, 326 flow [2025-03-04 09:53:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:53:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:53:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2025-03-04 09:53:31,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-03-04 09:53:31,287 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 8 states and 136 transitions. [2025-03-04 09:53:31,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 82 transitions, 326 flow [2025-03-04 09:53:31,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 82 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:53:31,289 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 73 flow [2025-03-04 09:53:31,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=73, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2025-03-04 09:53:31,290 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2025-03-04 09:53:31,291 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 73 flow [2025-03-04 09:53:31,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:31,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:31,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:31,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:53:31,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:31,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1411169460, now seen corresponding path program 1 times [2025-03-04 09:53:31,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:31,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262344575] [2025-03-04 09:53:31,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:31,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:53:31,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:53:31,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:31,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:31,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:31,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262344575] [2025-03-04 09:53:31,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262344575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:31,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:31,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:53:31,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963375723] [2025-03-04 09:53:31,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:31,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:53:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:31,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:53:31,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:53:31,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-04 09:53:31,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:31,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:31,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-04 09:53:31,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:31,577 INFO L124 PetriNetUnfolderBase]: 328/626 cut-off events. [2025-03-04 09:53:31,577 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 09:53:31,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 626 events. 328/626 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2659 event pairs, 86 based on Foata normal form. 42/665 useless extension candidates. Maximal degree in co-relation 1363. Up to 289 conditions per place. [2025-03-04 09:53:31,580 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 4 changer transitions 1/50 dead transitions. [2025-03-04 09:53:31,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 221 flow [2025-03-04 09:53:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:53:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:53:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-04 09:53:31,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 09:53:31,584 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 73 flow. Second operand 4 states and 80 transitions. [2025-03-04 09:53:31,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 221 flow [2025-03-04 09:53:31,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 205 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 09:53:31,588 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 87 flow [2025-03-04 09:53:31,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2025-03-04 09:53:31,589 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2025-03-04 09:53:31,590 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 87 flow [2025-03-04 09:53:31,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:31,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:31,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:31,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:53:31,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:31,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash 96780659, now seen corresponding path program 1 times [2025-03-04 09:53:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968237830] [2025-03-04 09:53:31,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:31,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:53:31,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:53:31,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:31,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:31,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-03-04 09:53:31,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:31,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968237830] [2025-03-04 09:53:31,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968237830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:31,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:53:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366813058] [2025-03-04 09:53:31,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:31,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:53:31,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:31,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:53:31,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:53:31,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-04 09:53:31,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:31,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:31,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-04 09:53:31,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:31,927 INFO L124 PetriNetUnfolderBase]: 162/316 cut-off events. [2025-03-04 09:53:31,928 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-04 09:53:31,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 316 events. 162/316 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1044 event pairs, 58 based on Foata normal form. 22/335 useless extension candidates. Maximal degree in co-relation 755. Up to 131 conditions per place. [2025-03-04 09:53:31,931 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 33 selfloop transitions, 6 changer transitions 1/44 dead transitions. [2025-03-04 09:53:31,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 205 flow [2025-03-04 09:53:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:53:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:53:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-03-04 09:53:31,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-03-04 09:53:31,932 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 87 flow. Second operand 5 states and 82 transitions. [2025-03-04 09:53:31,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 205 flow [2025-03-04 09:53:31,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 191 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 09:53:31,934 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 99 flow [2025-03-04 09:53:31,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2025-03-04 09:53:31,934 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2025-03-04 09:53:31,934 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 99 flow [2025-03-04 09:53:31,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:31,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:31,935 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] [2025-03-04 09:53:31,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:53:31,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:31,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:31,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1279596979, now seen corresponding path program 1 times [2025-03-04 09:53:31,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:31,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430466379] [2025-03-04 09:53:31,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:31,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:31,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:53:31,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:53:31,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:31,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:32,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:32,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430466379] [2025-03-04 09:53:32,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430466379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:32,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:32,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:53:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567555722] [2025-03-04 09:53:32,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:32,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:53:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:32,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:53:32,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:53:32,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 09:53:32,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 99 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:32,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:32,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 09:53:32,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:32,535 INFO L124 PetriNetUnfolderBase]: 269/529 cut-off events. [2025-03-04 09:53:32,535 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2025-03-04 09:53:32,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 529 events. 269/529 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2129 event pairs, 37 based on Foata normal form. 8/534 useless extension candidates. Maximal degree in co-relation 1317. Up to 205 conditions per place. [2025-03-04 09:53:32,537 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 28 selfloop transitions, 3 changer transitions 38/73 dead transitions. [2025-03-04 09:53:32,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 397 flow [2025-03-04 09:53:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:53:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:53:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2025-03-04 09:53:32,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2025-03-04 09:53:32,539 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 99 flow. Second operand 9 states and 128 transitions. [2025-03-04 09:53:32,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 397 flow [2025-03-04 09:53:32,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 319 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-03-04 09:53:32,541 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 93 flow [2025-03-04 09:53:32,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=93, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2025-03-04 09:53:32,541 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2025-03-04 09:53:32,541 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 93 flow [2025-03-04 09:53:32,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:32,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:32,542 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] [2025-03-04 09:53:32,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:53:32,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:32,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:32,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1230819229, now seen corresponding path program 2 times [2025-03-04 09:53:32,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:32,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134956837] [2025-03-04 09:53:32,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:53:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:32,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:53:32,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:53:32,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:53:32,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:33,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:53:33,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134956837] [2025-03-04 09:53:33,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134956837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:33,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:33,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:53:33,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195460591] [2025-03-04 09:53:33,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:33,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:53:33,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:53:33,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:53:33,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:53:33,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 09:53:33,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 28 transitions, 93 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:33,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:33,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 09:53:33,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:33,325 INFO L124 PetriNetUnfolderBase]: 141/292 cut-off events. [2025-03-04 09:53:33,325 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 09:53:33,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 292 events. 141/292 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 914 event pairs, 60 based on Foata normal form. 4/295 useless extension candidates. Maximal degree in co-relation 692. Up to 120 conditions per place. [2025-03-04 09:53:33,326 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 25 selfloop transitions, 2 changer transitions 29/60 dead transitions. [2025-03-04 09:53:33,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 299 flow [2025-03-04 09:53:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:53:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:53:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2025-03-04 09:53:33,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3784722222222222 [2025-03-04 09:53:33,328 INFO L175 Difference]: Start difference. First operand has 49 places, 28 transitions, 93 flow. Second operand 8 states and 109 transitions. [2025-03-04 09:53:33,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 299 flow [2025-03-04 09:53:33,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 267 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-04 09:53:33,329 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 89 flow [2025-03-04 09:53:33,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=89, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2025-03-04 09:53:33,330 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2025-03-04 09:53:33,330 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 89 flow [2025-03-04 09:53:33,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:33,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:33,330 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] [2025-03-04 09:53:33,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:53:33,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:33,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:33,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2041324603, now seen corresponding path program 3 times [2025-03-04 09:53:33,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:53:33,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937844063] [2025-03-04 09:53:33,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:53:33,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:53:33,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:53:33,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:53:33,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:53:33,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:53:33,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:53:33,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:53:33,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:53:33,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:33,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:53:33,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:53:33,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:53:33,488 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-03-04 09:53:33,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-04 09:53:33,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-04 09:53:33,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-04 09:53:33,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-04 09:53:33,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-04 09:53:33,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:53:33,494 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-03-04 09:53:33,548 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:53:33,551 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:53:33,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:53:33 BasicIcfg [2025-03-04 09:53:33,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:53:33,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:53:33,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:53:33,558 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:53:33,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:53:29" (3/4) ... [2025-03-04 09:53:33,561 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:53:33,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:53:33,564 INFO L158 Benchmark]: Toolchain (without parser) took 4968.37ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 121.8MB in the beginning and 248.7MB in the end (delta: -126.9MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2025-03-04 09:53:33,565 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:53:33,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.39ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 98.9MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:53:33,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.41ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 96.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:53:33,565 INFO L158 Benchmark]: Boogie Preprocessor took 47.94ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 95.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:53:33,565 INFO L158 Benchmark]: IcfgBuilder took 567.31ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 45.6MB in the end (delta: 48.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 09:53:33,565 INFO L158 Benchmark]: TraceAbstraction took 3902.59ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 44.7MB in the beginning and 248.7MB in the end (delta: -204.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-03-04 09:53:33,567 INFO L158 Benchmark]: Witness Printer took 6.43ms. Allocated memory is still 385.9MB. Free memory was 248.7MB in the beginning and 248.7MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:53:33,568 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.33ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.39ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 98.9MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.41ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 96.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.94ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 95.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 567.31ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 45.6MB in the end (delta: 48.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3902.59ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 44.7MB in the beginning and 248.7MB in the end (delta: -204.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Witness Printer took 6.43ms. Allocated memory is still 385.9MB. Free memory was 248.7MB in the beginning and 248.7MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1705; [L811] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 0 pthread_t t1706; [L813] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705=-2, t1706=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L749] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L766] 2 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L752] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705=-2, t1706=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705=-2, t1706=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705=-2, t1706=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L17] 0 __assert_fail ("0", "rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: 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: 813]: 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 5 procedures, 53 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 780 IncrementalHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1 mSDtfsCounter, 780 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, InterpolantAutomatonStates: 40, 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, 1.6s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 471 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 09:53:33,584 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:53:35,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:53:35,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 09:53:35,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:53:35,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:53:35,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:53:35,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:53:35,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:53:35,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:53:35,585 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:53:35,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:53:35,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:53:35,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:53:35,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:53:35,586 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:53:35,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:53:35,586 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:53:35,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:53:35,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:53:35,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:53:35,587 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:53:35,588 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:53:35,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:53:35,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:53:35,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:53:35,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:53:35,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:53:35,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:53:35,588 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 09:53:35,588 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 09:53:35,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:53:35,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:53:35,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:53:35,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:53:35,589 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 60cd4209446f80c263553fdb6a481b4dd4e668058f5fe80fa8786bdb8310f6e8 [2025-03-04 09:53:35,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:53:35,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:53:35,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:53:35,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:53:35,870 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:53:35,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:53:37,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75652276/c0e92f228a9341f58b0f743ef5f19752/FLAGba3cdc6b3 [2025-03-04 09:53:37,282 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:53:37,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:53:37,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75652276/c0e92f228a9341f58b0f743ef5f19752/FLAGba3cdc6b3 [2025-03-04 09:53:37,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75652276/c0e92f228a9341f58b0f743ef5f19752 [2025-03-04 09:53:37,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:53:37,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:53:37,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:53:37,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:53:37,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:53:37,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de546c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37, skipping insertion in model container [2025-03-04 09:53:37,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:53:37,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:53:37,613 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:53:37,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:53:37,690 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:53:37,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37 WrapperNode [2025-03-04 09:53:37,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:53:37,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:53:37,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:53:37,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:53:37,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,741 INFO L138 Inliner]: procedures = 175, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 109 [2025-03-04 09:53:37,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:53:37,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:53:37,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:53:37,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:53:37,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,771 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:53:37,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:53:37,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:53:37,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:53:37,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:53:37,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (1/1) ... [2025-03-04 09:53:37,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:53:37,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:53:37,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:53:37,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:53:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:53:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:53:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 09:53:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:53:37,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:53:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:53:37,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:53:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:53:37,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:53:37,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:53:37,854 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:53:37,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:53:37,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:53:38,261 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:53:38,261 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:53:38,529 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:53:38,530 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:53:38,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:53:38 BoogieIcfgContainer [2025-03-04 09:53:38,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:53:38,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:53:38,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:53:38,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:53:38,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:53:37" (1/3) ... [2025-03-04 09:53:38,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef946cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:53:38, skipping insertion in model container [2025-03-04 09:53:38,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:53:37" (2/3) ... [2025-03-04 09:53:38,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef946cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:53:38, skipping insertion in model container [2025-03-04 09:53:38,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:53:38" (3/3) ... [2025-03-04 09:53:38,540 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:53:38,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:53:38,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 35 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:53:38,552 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:53:38,597 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:53:38,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2025-03-04 09:53:38,660 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-03-04 09:53:38,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:53:38,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 2/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-04 09:53:38,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2025-03-04 09:53:38,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 74 flow [2025-03-04 09:53:38,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:53:38,683 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=None, 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;@364ca42b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:53:38,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 09:53:38,686 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:53:38,687 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-03-04 09:53:38,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:53:38,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:38,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 09:53:38,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:38,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash 10316069, now seen corresponding path program 1 times [2025-03-04 09:53:38,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:53:38,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853764034] [2025-03-04 09:53:38,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:38,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:38,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:53:38,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:53:38,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:53:38,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:53:38,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:53:38,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:38,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:38,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:53:38,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:53:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:38,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:53:38,812 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:53:38,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853764034] [2025-03-04 09:53:38,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853764034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:38,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:38,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:53:38,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402923423] [2025-03-04 09:53:38,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:38,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:53:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:53:38,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:53:38,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:53:38,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-04 09:53:38,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:38,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:38,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-04 09:53:38,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:39,135 INFO L124 PetriNetUnfolderBase]: 679/1136 cut-off events. [2025-03-04 09:53:39,135 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 09:53:39,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1136 events. 679/1136 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5595 event pairs, 54 based on Foata normal form. 83/1216 useless extension candidates. Maximal degree in co-relation 2256. Up to 986 conditions per place. [2025-03-04 09:53:39,147 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 37 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2025-03-04 09:53:39,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 185 flow [2025-03-04 09:53:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:53:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:53:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 09:53:39,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2025-03-04 09:53:39,160 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 74 flow. Second operand 3 states and 70 transitions. [2025-03-04 09:53:39,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 185 flow [2025-03-04 09:53:39,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:53:39,166 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2025-03-04 09:53:39,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-03-04 09:53:39,170 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-03-04 09:53:39,171 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2025-03-04 09:53:39,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:39,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:39,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:39,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:53:39,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:39,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:39,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash -990872472, now seen corresponding path program 1 times [2025-03-04 09:53:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:53:39,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1195045133] [2025-03-04 09:53:39,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:39,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:39,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:53:39,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:53:39,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:53:39,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:53:39,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:53:39,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:39,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:39,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 09:53:39,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:53:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:39,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:53:39,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:53:39,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195045133] [2025-03-04 09:53:39,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195045133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:39,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:39,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:53:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198626106] [2025-03-04 09:53:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:39,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:53:39,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:53:39,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:53:39,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:53:39,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 09:53:39,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:39,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:39,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 09:53:39,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:39,640 INFO L124 PetriNetUnfolderBase]: 608/1104 cut-off events. [2025-03-04 09:53:39,640 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-04 09:53:39,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2186 conditions, 1104 events. 608/1104 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5518 event pairs, 608 based on Foata normal form. 42/1137 useless extension candidates. Maximal degree in co-relation 2176. Up to 999 conditions per place. [2025-03-04 09:53:39,648 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 21 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2025-03-04 09:53:39,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 110 flow [2025-03-04 09:53:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:53:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:53:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-03-04 09:53:39,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-04 09:53:39,650 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 3 states and 45 transitions. [2025-03-04 09:53:39,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 110 flow [2025-03-04 09:53:39,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:53:39,651 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2025-03-04 09:53:39,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2025-03-04 09:53:39,653 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2025-03-04 09:53:39,653 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2025-03-04 09:53:39,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:39,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:39,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:53:39,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:53:39,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:39,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:39,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash -990872076, now seen corresponding path program 1 times [2025-03-04 09:53:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:53:39,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198329550] [2025-03-04 09:53:39,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:39,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:53:39,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:53:39,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:53:39,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:53:39,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:53:39,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:39,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:39,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:53:39,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:53:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:39,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:53:39,958 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:53:39,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198329550] [2025-03-04 09:53:39,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198329550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:39,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:39,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:53:39,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476143395] [2025-03-04 09:53:39,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:39,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:53:39,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:53:39,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:53:39,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:53:39,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-04 09:53:39,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:39,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:39,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-04 09:53:39,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:40,115 INFO L124 PetriNetUnfolderBase]: 346/686 cut-off events. [2025-03-04 09:53:40,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:53:40,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 686 events. 346/686 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3168 event pairs, 86 based on Foata normal form. 42/725 useless extension candidates. Maximal degree in co-relation 1315. Up to 319 conditions per place. [2025-03-04 09:53:40,119 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 4 changer transitions 1/51 dead transitions. [2025-03-04 09:53:40,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 51 transitions, 202 flow [2025-03-04 09:53:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:53:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:53:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-04 09:53:40,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 09:53:40,122 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 4 states and 80 transitions. [2025-03-04 09:53:40,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 51 transitions, 202 flow [2025-03-04 09:53:40,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:53:40,124 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 85 flow [2025-03-04 09:53:40,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2025-03-04 09:53:40,124 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2025-03-04 09:53:40,124 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 85 flow [2025-03-04 09:53:40,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:40,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:40,125 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-04 09:53:40,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:53:40,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:40,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:40,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:40,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1948877184, now seen corresponding path program 1 times [2025-03-04 09:53:40,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:53:40,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339037712] [2025-03-04 09:53:40,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:40,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:40,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:53:40,329 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:53:40,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:53:40,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:53:40,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:53:40,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:40,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:40,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:53:40,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:53:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:40,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:53:40,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:53:40,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339037712] [2025-03-04 09:53:40,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339037712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:40,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:53:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453641050] [2025-03-04 09:53:40,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:53:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:53:40,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:53:40,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:53:40,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-04 09:53:40,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:40,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:40,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-04 09:53:40,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:40,545 INFO L124 PetriNetUnfolderBase]: 162/320 cut-off events. [2025-03-04 09:53:40,545 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-04 09:53:40,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 320 events. 162/320 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1065 event pairs, 58 based on Foata normal form. 22/339 useless extension candidates. Maximal degree in co-relation 741. Up to 131 conditions per place. [2025-03-04 09:53:40,547 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 33 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2025-03-04 09:53:40,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 202 flow [2025-03-04 09:53:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:53:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:53:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-03-04 09:53:40,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-03-04 09:53:40,548 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 85 flow. Second operand 5 states and 82 transitions. [2025-03-04 09:53:40,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 202 flow [2025-03-04 09:53:40,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 193 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 09:53:40,549 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 101 flow [2025-03-04 09:53:40,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2025-03-04 09:53:40,550 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2025-03-04 09:53:40,550 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 101 flow [2025-03-04 09:53:40,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:40,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:40,550 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] [2025-03-04 09:53:40,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:53:40,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:40,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:40,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:40,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1704408755, now seen corresponding path program 1 times [2025-03-04 09:53:40,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:53:40,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498115446] [2025-03-04 09:53:40,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:53:40,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:40,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:53:40,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:53:40,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:53:40,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:53:40,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:53:40,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:40,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:40,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 09:53:40,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:53:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:40,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:53:40,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:53:40,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498115446] [2025-03-04 09:53:40,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498115446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:40,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:40,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:53:40,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959335582] [2025-03-04 09:53:40,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:40,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:53:40,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:53:40,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:53:40,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:53:40,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-04 09:53:40,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 101 flow. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:40,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:40,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-04 09:53:40,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:41,302 INFO L124 PetriNetUnfolderBase]: 239/487 cut-off events. [2025-03-04 09:53:41,302 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-03-04 09:53:41,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 487 events. 239/487 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1931 event pairs, 61 based on Foata normal form. 8/492 useless extension candidates. Maximal degree in co-relation 1179. Up to 141 conditions per place. [2025-03-04 09:53:41,304 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 32 selfloop transitions, 7 changer transitions 42/86 dead transitions. [2025-03-04 09:53:41,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 431 flow [2025-03-04 09:53:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:53:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 09:53:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2025-03-04 09:53:41,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41435185185185186 [2025-03-04 09:53:41,305 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 101 flow. Second operand 12 states and 179 transitions. [2025-03-04 09:53:41,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 431 flow [2025-03-04 09:53:41,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 365 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-04 09:53:41,308 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 113 flow [2025-03-04 09:53:41,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=113, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2025-03-04 09:53:41,308 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2025-03-04 09:53:41,308 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 113 flow [2025-03-04 09:53:41,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:41,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:41,309 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] [2025-03-04 09:53:41,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:53:41,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:41,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash -135474273, now seen corresponding path program 2 times [2025-03-04 09:53:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:53:41,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928697906] [2025-03-04 09:53:41,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:53:41,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:53:41,516 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:53:41,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:53:41,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:53:41,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:53:41,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:53:41,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:53:41,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 09:53:41,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:53:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:53:41,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:53:41,771 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:53:41,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928697906] [2025-03-04 09:53:41,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928697906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:53:41,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:53:41,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 09:53:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299943734] [2025-03-04 09:53:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:53:41,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:53:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:53:41,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:53:41,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:53:41,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-04 09:53:41,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 113 flow. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:41,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:53:41,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-04 09:53:41,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:53:42,006 INFO L124 PetriNetUnfolderBase]: 141/300 cut-off events. [2025-03-04 09:53:42,006 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-04 09:53:42,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 300 events. 141/300 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 966 event pairs, 16 based on Foata normal form. 4/303 useless extension candidates. Maximal degree in co-relation 734. Up to 121 conditions per place. [2025-03-04 09:53:42,007 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 29 selfloop transitions, 4 changer transitions 28/66 dead transitions. [2025-03-04 09:53:42,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 342 flow [2025-03-04 09:53:42,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:53:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:53:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2025-03-04 09:53:42,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2025-03-04 09:53:42,010 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 113 flow. Second operand 10 states and 136 transitions. [2025-03-04 09:53:42,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 342 flow [2025-03-04 09:53:42,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 294 flow, removed 16 selfloop flow, removed 10 redundant places. [2025-03-04 09:53:42,012 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 97 flow [2025-03-04 09:53:42,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=97, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2025-03-04 09:53:42,012 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2025-03-04 09:53:42,012 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 97 flow [2025-03-04 09:53:42,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:53:42,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:53:42,012 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] [2025-03-04 09:53:42,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:53:42,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:42,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-04 09:53:42,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:53:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2040949577, now seen corresponding path program 3 times [2025-03-04 09:53:42,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:53:42,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683071517] [2025-03-04 09:53:42,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:53:42,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:42,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:53:42,222 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:53:42,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:53:42,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:53:42,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:53:42,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:53:42,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:53:42,280 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:53:42,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:53:42,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:53:42,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:53:42,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:53:42,340 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 09:53:42,340 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:53:42,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-03-04 09:53:42,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-04 09:53:42,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-04 09:53:42,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-04 09:53:42,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-04 09:53:42,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-04 09:53:42,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 09:53:42,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:53:42,545 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-03-04 09:53:42,602 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:53:42,602 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:53:42,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:53:42 BasicIcfg [2025-03-04 09:53:42,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:53:42,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:53:42,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:53:42,610 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:53:42,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:53:38" (3/4) ... [2025-03-04 09:53:42,616 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:53:42,617 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:53:42,618 INFO L158 Benchmark]: Toolchain (without parser) took 5298.95ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 58.5MB in the beginning and 49.4MB in the end (delta: 9.1MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-03-04 09:53:42,618 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:53:42,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.17ms. Allocated memory is still 83.9MB. Free memory was 58.2MB in the beginning and 35.5MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:53:42,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.52ms. Allocated memory is still 83.9MB. Free memory was 35.5MB in the beginning and 33.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:53:42,618 INFO L158 Benchmark]: Boogie Preprocessor took 51.68ms. Allocated memory is still 83.9MB. Free memory was 33.4MB in the beginning and 30.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:53:42,618 INFO L158 Benchmark]: IcfgBuilder took 736.59ms. Allocated memory is still 83.9MB. Free memory was 30.9MB in the beginning and 36.9MB in the end (delta: -6.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2025-03-04 09:53:42,619 INFO L158 Benchmark]: TraceAbstraction took 4076.63ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 36.4MB in the beginning and 49.4MB in the end (delta: -13.0MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2025-03-04 09:53:42,619 INFO L158 Benchmark]: Witness Printer took 6.99ms. Allocated memory is still 100.7MB. Free memory was 49.4MB in the beginning and 49.4MB in the end (delta: 4.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:53:42,620 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.22ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.17ms. Allocated memory is still 83.9MB. Free memory was 58.2MB in the beginning and 35.5MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.52ms. Allocated memory is still 83.9MB. Free memory was 35.5MB in the beginning and 33.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.68ms. Allocated memory is still 83.9MB. Free memory was 33.4MB in the beginning and 30.9MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 736.59ms. Allocated memory is still 83.9MB. Free memory was 30.9MB in the beginning and 36.9MB in the end (delta: -6.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4076.63ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 36.4MB in the beginning and 49.4MB in the end (delta: -13.0MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Witness Printer took 6.99ms. Allocated memory is still 100.7MB. Free memory was 49.4MB in the beginning and 49.4MB in the end (delta: 4.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1705; [L811] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 0 pthread_t t1706; [L813] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1705=-1, t1706=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L738] 1 x$w_buff1 = x$w_buff0 [L739] 1 x$w_buff0 = 1 [L740] 1 x$w_buff1_used = x$w_buff0_used [L741] 1 x$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L743] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L744] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L745] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L746] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L749] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L766] 2 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L769] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 x$flush_delayed = weak$$choice2 [L775] 2 x$mem_tmp = x [L776] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L777] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L778] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L779] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L780] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L782] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = x [L784] 2 x = x$flush_delayed ? x$mem_tmp : x [L785] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L752] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705=-1, t1706=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705=-1, t1706=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L826] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1705=-1, t1706=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L828] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L17] 0 __assert_fail ("0", "rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 811]: 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 5 procedures, 53 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 753 IncrementalHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 0 mSDtfsCounter, 753 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 386 SizeOfPredicates, 13 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 could not prove your program: unable to determine feasibility of some traces [2025-03-04 09:53:42,636 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 Result: UNKNOWN: Overapproximated counterexample