./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi007_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/rfi007_tso.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:46:15,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:46:15,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:46:15,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:46:15,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:46:15,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:46:15,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:46:15,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:46:15,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:46:15,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:46:15,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:46:15,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:46:15,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:46:15,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:46:15,093 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:46:15,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:46:15,094 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:46:15,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:46:15,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:46:15,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:46:15,094 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:46:15,094 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:46:15,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:46:15,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:46:15,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:46:15,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:46:15,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:46:15,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:46:15,096 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-jdk21/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 -> 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 [2025-02-06 12:46:15,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:46:15,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:46:15,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:46:15,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:46:15,320 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:46:15,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2025-02-06 12:46:16,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d82e25cd/1bbd4c726ce245c7b643d9cbc637a543/FLAG825144a67 [2025-02-06 12:46:16,854 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:46:16,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2025-02-06 12:46:16,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d82e25cd/1bbd4c726ce245c7b643d9cbc637a543/FLAG825144a67 [2025-02-06 12:46:16,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d82e25cd/1bbd4c726ce245c7b643d9cbc637a543 [2025-02-06 12:46:16,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:46:16,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:46:16,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:46:16,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:46:16,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:46:16,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:46:16" (1/1) ... [2025-02-06 12:46:16,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5006ffda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:16, skipping insertion in model container [2025-02-06 12:46:16,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:46:16" (1/1) ... [2025-02-06 12:46:16,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:46:17,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:46:17,205 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:46:17,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:46:17,280 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:46:17,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17 WrapperNode [2025-02-06 12:46:17,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:46:17,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:46:17,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:46:17,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:46:17,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,322 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2025-02-06 12:46:17,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:46:17,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:46:17,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:46:17,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:46:17,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,339 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-02-06 12:46:17,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:46:17,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:46:17,348 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:46:17,348 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:46:17,348 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (1/1) ... [2025-02-06 12:46:17,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:46:17,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:17,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:46:17,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:46:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:46:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:46:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:46:17,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:46:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:46:17,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:46:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:46:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:46:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:46:17,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:46:17,392 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:46:17,492 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:46:17,493 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:46:17,697 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:46:17,697 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:46:17,903 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:46:17,903 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:46:17,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:17 BoogieIcfgContainer [2025-02-06 12:46:17,904 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:46:17,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:46:17,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:46:17,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:46:17,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:46:16" (1/3) ... [2025-02-06 12:46:17,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50864b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:46:17, skipping insertion in model container [2025-02-06 12:46:17,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:17" (2/3) ... [2025-02-06 12:46:17,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50864b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:46:17, skipping insertion in model container [2025-02-06 12:46:17,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:17" (3/3) ... [2025-02-06 12:46:17,912 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i [2025-02-06 12:46:17,921 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:46:17,922 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi007_tso.i that has 3 procedures, 35 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:46:17,922 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:46:17,961 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:46:17,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2025-02-06 12:46:18,005 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-02-06 12:46:18,008 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:18,010 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 51 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-02-06 12:46:18,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2025-02-06 12:46:18,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 74 flow [2025-02-06 12:46:18,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:46:18,030 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;@57f3851f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:46:18,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:46:18,037 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:46:18,037 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 12:46:18,037 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:18,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:18,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:46:18,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:18,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1849111238, now seen corresponding path program 1 times [2025-02-06 12:46:18,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:18,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501090042] [2025-02-06 12:46:18,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:18,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:46:18,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:46:18,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:18,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:18,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:18,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501090042] [2025-02-06 12:46:18,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501090042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:18,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:18,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:46:18,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493271883] [2025-02-06 12:46:18,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:18,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:46:18,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:18,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:46:18,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:46:18,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-02-06 12:46:18,431 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.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-02-06 12:46:18,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:18,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-02-06 12:46:18,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:18,730 INFO L124 PetriNetUnfolderBase]: 679/1139 cut-off events. [2025-02-06 12:46:18,731 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:46:18,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 1139 events. 679/1139 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5389 event pairs, 55 based on Foata normal form. 84/1222 useless extension candidates. Maximal degree in co-relation 2259. Up to 985 conditions per place. [2025-02-06 12:46:18,741 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 34 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2025-02-06 12:46:18,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 170 flow [2025-02-06 12:46:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:46:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:46:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-02-06 12:46:18,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2025-02-06 12:46:18,755 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 74 flow. Second operand 3 states and 67 transitions. [2025-02-06 12:46:18,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 170 flow [2025-02-06 12:46:18,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:46:18,764 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2025-02-06 12:46:18,766 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-02-06 12:46:18,768 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-02-06 12:46:18,768 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2025-02-06 12:46:18,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-02-06 12:46:18,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:18,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:18,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:46:18,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:18,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:18,770 INFO L85 PathProgramCache]: Analyzing trace with hash 360807757, now seen corresponding path program 1 times [2025-02-06 12:46:18,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:18,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937311783] [2025-02-06 12:46:18,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:18,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:18,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:46:18,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:46:18,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:18,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:18,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:18,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937311783] [2025-02-06 12:46:18,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937311783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:18,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:18,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:46:18,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571122081] [2025-02-06 12:46:18,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:18,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:46:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:18,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:46:18,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:46:18,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 12:46:18,841 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-02-06 12:46:18,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:18,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 12:46:18,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:18,999 INFO L124 PetriNetUnfolderBase]: 608/1122 cut-off events. [2025-02-06 12:46:19,000 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:46:19,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2193 conditions, 1122 events. 608/1122 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5632 event pairs, 608 based on Foata normal form. 42/1157 useless extension candidates. Maximal degree in co-relation 2183. Up to 999 conditions per place. [2025-02-06 12:46:19,007 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 21 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2025-02-06 12:46:19,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 110 flow [2025-02-06 12:46:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:46:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:46:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-02-06 12:46:19,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-02-06 12:46:19,009 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 3 states and 45 transitions. [2025-02-06 12:46:19,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 110 flow [2025-02-06 12:46:19,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:46:19,010 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2025-02-06 12:46:19,010 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-02-06 12:46:19,010 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2025-02-06 12:46:19,010 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2025-02-06 12:46:19,010 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-02-06 12:46:19,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:19,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:19,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:46:19,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:19,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash 360808206, now seen corresponding path program 1 times [2025-02-06 12:46:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:19,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568208032] [2025-02-06 12:46:19,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:19,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:19,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:46:19,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:46:19,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:19,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:20,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568208032] [2025-02-06 12:46:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568208032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:20,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:46:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213058343] [2025-02-06 12:46:20,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:20,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:46:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:20,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:46:20,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:46:20,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 12:46:20,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-02-06 12:46:20,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:20,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 12:46:20,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:20,550 INFO L124 PetriNetUnfolderBase]: 703/1235 cut-off events. [2025-02-06 12:46:20,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:20,552 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 6004 event pairs, 151 based on Foata normal form. 0/1204 useless extension candidates. Maximal degree in co-relation 2419. Up to 633 conditions per place. [2025-02-06 12:46:20,555 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 29 selfloop transitions, 2 changer transitions 47/82 dead transitions. [2025-02-06 12:46:20,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 82 transitions, 326 flow [2025-02-06 12:46:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:46:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:46:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2025-02-06 12:46:20,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-02-06 12:46:20,557 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 8 states and 136 transitions. [2025-02-06 12:46:20,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 82 transitions, 326 flow [2025-02-06 12:46:20,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 82 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:46:20,558 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 73 flow [2025-02-06 12:46:20,558 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-02-06 12:46:20,559 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2025-02-06 12:46:20,559 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 73 flow [2025-02-06 12:46:20,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-02-06 12:46:20,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:20,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:20,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:46:20,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:20,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:20,561 INFO L85 PathProgramCache]: Analyzing trace with hash 928313789, now seen corresponding path program 1 times [2025-02-06 12:46:20,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:20,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7403466] [2025-02-06 12:46:20,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:20,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:20,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:46:20,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:46:20,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:20,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:21,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:21,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7403466] [2025-02-06 12:46:21,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7403466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:21,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:21,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:46:21,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327900570] [2025-02-06 12:46:21,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:21,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:46:21,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:21,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:46:21,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:46:21,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 12:46:21,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 73 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:46:21,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:21,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 12:46:21,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:21,803 INFO L124 PetriNetUnfolderBase]: 328/626 cut-off events. [2025-02-06 12:46:21,803 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-06 12:46:21,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 626 events. 328/626 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2605 event pairs, 13 based on Foata normal form. 42/667 useless extension candidates. Maximal degree in co-relation 1363. Up to 265 conditions per place. [2025-02-06 12:46:21,806 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 52 selfloop transitions, 13 changer transitions 4/73 dead transitions. [2025-02-06 12:46:21,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 73 transitions, 315 flow [2025-02-06 12:46:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:46:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:46:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2025-02-06 12:46:21,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-02-06 12:46:21,808 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 73 flow. Second operand 9 states and 138 transitions. [2025-02-06 12:46:21,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 73 transitions, 315 flow [2025-02-06 12:46:21,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 73 transitions, 299 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-06 12:46:21,813 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 156 flow [2025-02-06 12:46:21,814 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-02-06 12:46:21,814 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2025-02-06 12:46:21,815 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 156 flow [2025-02-06 12:46:21,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:46:21,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:21,815 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-02-06 12:46:21,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:46:21,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:21,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:21,816 INFO L85 PathProgramCache]: Analyzing trace with hash -97703156, now seen corresponding path program 1 times [2025-02-06 12:46:21,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:21,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195839034] [2025-02-06 12:46:21,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:21,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:21,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:46:21,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:46:21,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:21,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:22,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195839034] [2025-02-06 12:46:22,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195839034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:22,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:22,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:46:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758341967] [2025-02-06 12:46:22,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:22,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:46:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:22,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:46:22,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:46:22,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-02-06 12:46:22,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 156 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-02-06 12:46:22,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:22,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-02-06 12:46:22,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:22,138 INFO L124 PetriNetUnfolderBase]: 162/316 cut-off events. [2025-02-06 12:46:22,139 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2025-02-06 12:46:22,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 316 events. 162/316 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1007 event pairs, 54 based on Foata normal form. 22/337 useless extension candidates. Maximal degree in co-relation 847. Up to 131 conditions per place. [2025-02-06 12:46:22,141 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 35 selfloop transitions, 8 changer transitions 4/51 dead transitions. [2025-02-06 12:46:22,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 285 flow [2025-02-06 12:46:22,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:46:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:46:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-02-06 12:46:22,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-02-06 12:46:22,144 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 156 flow. Second operand 5 states and 82 transitions. [2025-02-06 12:46:22,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 285 flow [2025-02-06 12:46:22,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 260 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 12:46:22,147 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 149 flow [2025-02-06 12:46:22,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2025-02-06 12:46:22,149 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2025-02-06 12:46:22,150 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 149 flow [2025-02-06 12:46:22,150 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-02-06 12:46:22,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:22,151 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-02-06 12:46:22,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:46:22,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:22,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1891801336, now seen corresponding path program 1 times [2025-02-06 12:46:22,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:22,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605265811] [2025-02-06 12:46:22,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:22,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:46:22,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:46:22,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:22,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605265811] [2025-02-06 12:46:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605265811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:46:22,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226470168] [2025-02-06 12:46:22,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:22,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:46:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:22,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:46:22,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:46:22,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 12:46:22,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 149 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-02-06 12:46:22,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:22,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 12:46:22,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:22,966 INFO L124 PetriNetUnfolderBase]: 197/388 cut-off events. [2025-02-06 12:46:22,967 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2025-02-06 12:46:22,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 388 events. 197/388 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1330 event pairs, 22 based on Foata normal form. 4/391 useless extension candidates. Maximal degree in co-relation 1042. Up to 209 conditions per place. [2025-02-06 12:46:22,969 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 26 selfloop transitions, 3 changer transitions 36/69 dead transitions. [2025-02-06 12:46:22,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 409 flow [2025-02-06 12:46:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:46:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:46:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2025-02-06 12:46:22,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2025-02-06 12:46:22,974 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 149 flow. Second operand 8 states and 113 transitions. [2025-02-06 12:46:22,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 409 flow [2025-02-06 12:46:22,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 347 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-02-06 12:46:22,977 INFO L231 Difference]: Finished difference. Result has 54 places, 28 transitions, 101 flow [2025-02-06 12:46:22,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=101, PETRI_PLACES=54, PETRI_TRANSITIONS=28} [2025-02-06 12:46:22,978 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2025-02-06 12:46:22,978 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 28 transitions, 101 flow [2025-02-06 12:46:22,978 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-02-06 12:46:22,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:22,978 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-02-06 12:46:22,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:46:22,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:22,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1602091604, now seen corresponding path program 2 times [2025-02-06 12:46:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:22,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036766749] [2025-02-06 12:46:22,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:46:22,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:22,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:46:23,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:46:23,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:46:23,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:24,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:24,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036766749] [2025-02-06 12:46:24,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036766749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:24,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:24,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:46:24,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105354660] [2025-02-06 12:46:24,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:24,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:46:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:24,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:46:24,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:46:24,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 12:46:24,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 28 transitions, 101 flow. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-02-06 12:46:24,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:24,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 12:46:24,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:24,292 INFO L124 PetriNetUnfolderBase]: 138/297 cut-off events. [2025-02-06 12:46:24,293 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-02-06 12:46:24,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 297 events. 138/297 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1013 event pairs, 40 based on Foata normal form. 4/301 useless extension candidates. Maximal degree in co-relation 739. Up to 140 conditions per place. [2025-02-06 12:46:24,294 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 25 selfloop transitions, 5 changer transitions 21/55 dead transitions. [2025-02-06 12:46:24,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 289 flow [2025-02-06 12:46:24,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:46:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:46:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2025-02-06 12:46:24,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2025-02-06 12:46:24,295 INFO L175 Difference]: Start difference. First operand has 54 places, 28 transitions, 101 flow. Second operand 8 states and 104 transitions. [2025-02-06 12:46:24,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 289 flow [2025-02-06 12:46:24,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 249 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-02-06 12:46:24,296 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 96 flow [2025-02-06 12:46:24,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=96, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2025-02-06 12:46:24,296 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2025-02-06 12:46:24,296 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 96 flow [2025-02-06 12:46:24,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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-02-06 12:46:24,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:24,297 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-02-06 12:46:24,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:46:24,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:24,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1254982834, now seen corresponding path program 3 times [2025-02-06 12:46:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:24,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006668892] [2025-02-06 12:46:24,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:46:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:24,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:46:24,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:46:24,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:46:24,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:46:24,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:46:24,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:46:24,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:46:24,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:24,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:46:24,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:46:24,421 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:46:24,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-06 12:46:24,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:46:24,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:46:24,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 12:46:24,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 12:46:24,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:46:24,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:46:24,423 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-02-06 12:46:24,461 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:46:24,461 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:46:24,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:46:24 BasicIcfg [2025-02-06 12:46:24,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:46:24,464 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:46:24,464 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:46:24,464 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:46:24,465 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:17" (3/4) ... [2025-02-06 12:46:24,466 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:46:24,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:46:24,467 INFO L158 Benchmark]: Toolchain (without parser) took 7581.55ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 134.5MB in the beginning and 281.3MB in the end (delta: -146.8MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2025-02-06 12:46:24,467 INFO L158 Benchmark]: CDTParser took 4.51ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:46:24,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.61ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 110.4MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:46:24,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.21ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 107.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:46:24,467 INFO L158 Benchmark]: Boogie Preprocessor took 24.73ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 104.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:46:24,467 INFO L158 Benchmark]: IcfgBuilder took 556.41ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 130.5MB in the end (delta: -26.2MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2025-02-06 12:46:24,467 INFO L158 Benchmark]: TraceAbstraction took 6557.20ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 129.5MB in the beginning and 285.2MB in the end (delta: -155.7MB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. [2025-02-06 12:46:24,470 INFO L158 Benchmark]: Witness Printer took 1.91ms. Allocated memory is still 343.9MB. Free memory was 285.2MB in the beginning and 281.3MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:46:24,471 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.51ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.61ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 110.4MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.21ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 107.6MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.73ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 104.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 556.41ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 130.5MB in the end (delta: -26.2MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6557.20ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 129.5MB in the beginning and 285.2MB in the end (delta: -155.7MB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. * Witness Printer took 1.91ms. Allocated memory is still 343.9MB. Free memory was 285.2MB in the beginning and 281.3MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. 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; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1717; [L811] FCALL, FORK 0 pthread_create(&t1717, ((void *)0), P0, ((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, t1717=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t1718; [L813] FCALL, FORK 0 pthread_create(&t1718, ((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, t1717=-1, t1718=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L758] 2 y$w_buff1 = y$w_buff0 [L759] 2 y$w_buff0 = 2 [L760] 2 y$w_buff1_used = y$w_buff0_used [L761] 2 y$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L763] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L764] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L765] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L766] 2 y$r_buff0_thd2 = (_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = x 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 x = 1 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y = 1 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L744] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L747] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L748] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 2 __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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L751] 1 __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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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, t1717=-1, t1718=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$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, t1717=-1, t1718=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 y$flush_delayed = weak$$choice2 [L829] 0 y$mem_tmp = y [L830] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L831] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L832] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L833] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L834] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L836] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] 0 y = y$flush_delayed ? y$mem_tmp : y [L839] 0 y$flush_delayed = (_Bool)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, t1717=-1, t1718=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L841] 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=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "rfi007_tso.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=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 6.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 792 IncrementalHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 2 mSDtfsCounter, 792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 1096 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-02-06 12:46:24,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/rfi007_tso.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:46:26,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:46:26,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:46:26,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:46:26,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:46:26,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:46:26,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:46:26,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:46:26,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:46:26,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:46:26,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:46:26,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:46:26,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:46:26,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:46:26,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:46:26,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:46:26,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:46:26,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:46:26,741 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-jdk21/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 -> 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2 [2025-02-06 12:46:26,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:46:26,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:46:26,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:46:26,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:46:26,962 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:46:26,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2025-02-06 12:46:28,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/520641837/d0b108e872dc4f69bd51b6053f47c994/FLAGa7fef197b [2025-02-06 12:46:28,529 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:46:28,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi007_tso.i [2025-02-06 12:46:28,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/520641837/d0b108e872dc4f69bd51b6053f47c994/FLAGa7fef197b [2025-02-06 12:46:28,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/520641837/d0b108e872dc4f69bd51b6053f47c994 [2025-02-06 12:46:28,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:46:28,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:46:28,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:46:28,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:46:28,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:46:28,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:28,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dac00f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28, skipping insertion in model container [2025-02-06 12:46:28,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:28,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:46:28,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:46:28,901 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:46:28,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:46:28,985 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:46:28,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28 WrapperNode [2025-02-06 12:46:28,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:46:28,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:46:28,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:46:28,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:46:28,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,046 INFO L138 Inliner]: procedures = 175, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2025-02-06 12:46:29,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:46:29,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:46:29,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:46:29,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:46:29,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,100 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-02-06 12:46:29,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:46:29,127 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:46:29,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:46:29,127 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:46:29,128 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (1/1) ... [2025-02-06 12:46:29,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:46:29,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:29,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:46:29,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:46:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:46:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:46:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:46:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:46:29,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:46:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:46:29,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:46:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:46:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:46:29,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:46:29,168 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:46:29,246 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:46:29,248 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:46:29,544 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:46:29,545 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:46:29,737 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:46:29,737 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:46:29,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:29 BoogieIcfgContainer [2025-02-06 12:46:29,737 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:46:29,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:46:29,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:46:29,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:46:29,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:46:28" (1/3) ... [2025-02-06 12:46:29,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a695f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:46:29, skipping insertion in model container [2025-02-06 12:46:29,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:28" (2/3) ... [2025-02-06 12:46:29,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a695f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:46:29, skipping insertion in model container [2025-02-06 12:46:29,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:29" (3/3) ... [2025-02-06 12:46:29,747 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i [2025-02-06 12:46:29,757 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:46:29,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi007_tso.i that has 3 procedures, 35 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:46:29,758 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:46:29,798 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:46:29,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2025-02-06 12:46:29,843 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-02-06 12:46:29,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:29,846 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 51 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-02-06 12:46:29,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2025-02-06 12:46:29,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 74 flow [2025-02-06 12:46:29,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:46:29,864 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;@7c8795f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:46:29,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:46:29,869 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:46:29,869 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 12:46:29,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:29,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:29,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:46:29,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:29,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1789944326, now seen corresponding path program 1 times [2025-02-06 12:46:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:46:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709248592] [2025-02-06 12:46:29,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:29,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:29,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:29,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:46:29,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:46:29,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:46:29,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:46:29,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:29,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:29,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:46:29,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:46:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:30,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:46:30,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:46:30,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709248592] [2025-02-06 12:46:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709248592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:30,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:30,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:46:30,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150677760] [2025-02-06 12:46:30,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:30,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:46:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:46:30,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:46:30,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:46:30,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-02-06 12:46:30,057 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.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-02-06 12:46:30,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:30,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-02-06 12:46:30,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:30,255 INFO L124 PetriNetUnfolderBase]: 679/1139 cut-off events. [2025-02-06 12:46:30,256 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:46:30,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 1139 events. 679/1139 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5389 event pairs, 55 based on Foata normal form. 84/1222 useless extension candidates. Maximal degree in co-relation 2259. Up to 985 conditions per place. [2025-02-06 12:46:30,263 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 34 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2025-02-06 12:46:30,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 170 flow [2025-02-06 12:46:30,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:46:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:46:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-02-06 12:46:30,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2025-02-06 12:46:30,271 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 74 flow. Second operand 3 states and 67 transitions. [2025-02-06 12:46:30,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 170 flow [2025-02-06 12:46:30,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:46:30,275 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2025-02-06 12:46:30,276 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-02-06 12:46:30,278 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-02-06 12:46:30,278 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2025-02-06 12:46:30,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-02-06 12:46:30,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:30,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:30,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:46:30,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:30,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:30,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2045090767, now seen corresponding path program 1 times [2025-02-06 12:46:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:46:30,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687161022] [2025-02-06 12:46:30,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:30,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:30,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:30,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:46:30,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:46:30,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:46:30,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:46:30,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:30,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:30,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:46:30,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:46:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:30,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:46:30,572 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:46:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687161022] [2025-02-06 12:46:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687161022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:30,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:30,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:46:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214849657] [2025-02-06 12:46:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:30,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:46:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:46:30,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:46:30,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:46:30,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-02-06 12:46:30,574 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-02-06 12:46:30,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:30,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-02-06 12:46:30,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:30,733 INFO L124 PetriNetUnfolderBase]: 608/1122 cut-off events. [2025-02-06 12:46:30,733 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:46:30,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2193 conditions, 1122 events. 608/1122 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5645 event pairs, 608 based on Foata normal form. 42/1157 useless extension candidates. Maximal degree in co-relation 2183. Up to 999 conditions per place. [2025-02-06 12:46:30,745 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 21 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2025-02-06 12:46:30,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 110 flow [2025-02-06 12:46:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:46:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:46:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-02-06 12:46:30,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-02-06 12:46:30,747 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 3 states and 45 transitions. [2025-02-06 12:46:30,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 110 flow [2025-02-06 12:46:30,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:46:30,748 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2025-02-06 12:46:30,748 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-02-06 12:46:30,749 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2025-02-06 12:46:30,749 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2025-02-06 12:46:30,749 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-02-06 12:46:30,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:30,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:30,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:46:30,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:30,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:30,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:30,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2045091216, now seen corresponding path program 1 times [2025-02-06 12:46:30,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:46:30,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240390365] [2025-02-06 12:46:30,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:30,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:30,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:30,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:46:30,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:46:31,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:46:31,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:46:31,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:31,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:31,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:46:31,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:46:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:31,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:46:31,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:46:31,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240390365] [2025-02-06 12:46:31,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240390365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:31,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:31,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:46:31,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164726847] [2025-02-06 12:46:31,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:31,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:46:31,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:46:31,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:46:31,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:46:31,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-02-06 12:46:31,039 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-02-06 12:46:31,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:31,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-02-06 12:46:31,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:31,174 INFO L124 PetriNetUnfolderBase]: 346/686 cut-off events. [2025-02-06 12:46:31,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:31,175 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 3143 event pairs, 86 based on Foata normal form. 42/727 useless extension candidates. Maximal degree in co-relation 1315. Up to 319 conditions per place. [2025-02-06 12:46:31,177 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 4 changer transitions 1/51 dead transitions. [2025-02-06 12:46:31,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 51 transitions, 202 flow [2025-02-06 12:46:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:46:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:46:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-02-06 12:46:31,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-06 12:46:31,178 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 4 states and 80 transitions. [2025-02-06 12:46:31,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 51 transitions, 202 flow [2025-02-06 12:46:31,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:46:31,179 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 85 flow [2025-02-06 12:46:31,179 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-02-06 12:46:31,180 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2025-02-06 12:46:31,180 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 85 flow [2025-02-06 12:46:31,180 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-02-06 12:46:31,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:31,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:31,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:46:31,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:31,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:31,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1241199476, now seen corresponding path program 1 times [2025-02-06 12:46:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:46:31,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203692090] [2025-02-06 12:46:31,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:31,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:31,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:31,386 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:46:31,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:46:31,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:46:31,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:46:31,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:31,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:31,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:46:31,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:46:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:31,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:46:31,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:46:31,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203692090] [2025-02-06 12:46:31,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203692090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:31,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:31,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:46:31,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129038196] [2025-02-06 12:46:31,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:31,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:46:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:46:31,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:46:31,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:46:31,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-02-06 12:46:31,476 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-02-06 12:46:31,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:31,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-02-06 12:46:31,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:31,577 INFO L124 PetriNetUnfolderBase]: 162/320 cut-off events. [2025-02-06 12:46:31,577 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-02-06 12:46:31,577 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 1061 event pairs, 58 based on Foata normal form. 22/341 useless extension candidates. Maximal degree in co-relation 741. Up to 131 conditions per place. [2025-02-06 12:46:31,578 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 33 selfloop transitions, 6 changer transitions 1/45 dead transitions. [2025-02-06 12:46:31,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 202 flow [2025-02-06 12:46:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:46:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:46:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-02-06 12:46:31,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2025-02-06 12:46:31,579 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 85 flow. Second operand 5 states and 82 transitions. [2025-02-06 12:46:31,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 202 flow [2025-02-06 12:46:31,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 193 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:46:31,580 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 101 flow [2025-02-06 12:46:31,580 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-02-06 12:46:31,580 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2025-02-06 12:46:31,581 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 101 flow [2025-02-06 12:46:31,581 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-02-06 12:46:31,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:31,581 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-02-06 12:46:31,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:46:31,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:31,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:31,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:31,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1263426340, now seen corresponding path program 1 times [2025-02-06 12:46:31,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:46:31,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386869763] [2025-02-06 12:46:31,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:31,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:31,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:31,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:46:31,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:46:31,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:46:31,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:46:31,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:31,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:31,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:46:31,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:46:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:31,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:46:31,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:46:31,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386869763] [2025-02-06 12:46:31,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386869763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:31,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:31,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:46:31,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352107751] [2025-02-06 12:46:31,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:31,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:46:31,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:46:31,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:46:31,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:46:31,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-02-06 12:46:31,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 101 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-02-06 12:46:31,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:31,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-02-06 12:46:31,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:32,201 INFO L124 PetriNetUnfolderBase]: 197/396 cut-off events. [2025-02-06 12:46:32,201 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-02-06 12:46:32,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 396 events. 197/396 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1441 event pairs, 36 based on Foata normal form. 4/399 useless extension candidates. Maximal degree in co-relation 964. Up to 159 conditions per place. [2025-02-06 12:46:32,203 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 36 selfloop transitions, 5 changer transitions 26/72 dead transitions. [2025-02-06 12:46:32,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 365 flow [2025-02-06 12:46:32,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:46:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:46:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-02-06 12:46:32,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43209876543209874 [2025-02-06 12:46:32,204 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 101 flow. Second operand 9 states and 140 transitions. [2025-02-06 12:46:32,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 365 flow [2025-02-06 12:46:32,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 72 transitions, 308 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-06 12:46:32,206 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 107 flow [2025-02-06 12:46:32,206 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=107, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2025-02-06 12:46:32,207 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2025-02-06 12:46:32,207 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 107 flow [2025-02-06 12:46:32,207 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-02-06 12:46:32,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:32,207 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-02-06 12:46:32,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:46:32,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:32,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:32,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1500997162, now seen corresponding path program 2 times [2025-02-06 12:46:32,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:46:32,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747024133] [2025-02-06 12:46:32,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:46:32,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:32,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:32,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:46:32,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:46:32,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:46:32,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:46:32,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:46:32,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:32,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:46:32,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:46:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:32,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:46:32,692 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:46:32,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747024133] [2025-02-06 12:46:32,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747024133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:32,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:32,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:46:32,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515865103] [2025-02-06 12:46:32,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:32,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:46:32,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:46:32,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:46:32,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:46:32,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-02-06 12:46:32,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 107 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-02-06 12:46:32,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:32,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-02-06 12:46:32,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:32,885 INFO L124 PetriNetUnfolderBase]: 181/377 cut-off events. [2025-02-06 12:46:32,885 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-02-06 12:46:32,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 377 events. 181/377 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1380 event pairs, 55 based on Foata normal form. 4/380 useless extension candidates. Maximal degree in co-relation 913. Up to 190 conditions per place. [2025-02-06 12:46:32,887 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 30 selfloop transitions, 4 changer transitions 17/56 dead transitions. [2025-02-06 12:46:32,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 284 flow [2025-02-06 12:46:32,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:46:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:46:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2025-02-06 12:46:32,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2025-02-06 12:46:32,888 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 107 flow. Second operand 7 states and 102 transitions. [2025-02-06 12:46:32,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 284 flow [2025-02-06 12:46:32,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 258 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-06 12:46:32,889 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 109 flow [2025-02-06 12:46:32,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=109, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2025-02-06 12:46:32,889 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2025-02-06 12:46:32,889 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 109 flow [2025-02-06 12:46:32,889 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-02-06 12:46:32,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:32,890 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-02-06 12:46:32,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:46:33,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:33,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:46:33,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1415858578, now seen corresponding path program 3 times [2025-02-06 12:46:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:46:33,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896843560] [2025-02-06 12:46:33,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:46:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:33,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:33,093 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:46:33,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:46:33,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:46:33,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:46:33,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:46:33,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:46:33,151 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:46:33,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 12:46:33,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 12:46:33,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:33,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:46:33,195 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:46:33,195 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:46:33,196 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-06 12:46:33,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:46:33,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:46:33,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 12:46:33,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 12:46:33,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:46:33,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:46:33,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:46:33,397 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-02-06 12:46:33,430 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:46:33,430 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:46:33,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:46:33 BasicIcfg [2025-02-06 12:46:33,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:46:33,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:46:33,433 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:46:33,433 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:46:33,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:29" (3/4) ... [2025-02-06 12:46:33,434 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:46:33,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:46:33,435 INFO L158 Benchmark]: Toolchain (without parser) took 4872.55ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 90.9MB in the beginning and 100.3MB in the end (delta: -9.4MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2025-02-06 12:46:33,435 INFO L158 Benchmark]: CDTParser took 1.23ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:46:33,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.74ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 67.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:46:33,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.04ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 64.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:46:33,436 INFO L158 Benchmark]: Boogie Preprocessor took 74.90ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 61.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:46:33,436 INFO L158 Benchmark]: IcfgBuilder took 610.31ms. Allocated memory is still 117.4MB. Free memory was 61.4MB in the beginning and 88.0MB in the end (delta: -26.6MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2025-02-06 12:46:33,436 INFO L158 Benchmark]: TraceAbstraction took 3692.22ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 88.0MB in the beginning and 100.3MB in the end (delta: -12.4MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2025-02-06 12:46:33,436 INFO L158 Benchmark]: Witness Printer took 1.93ms. Allocated memory is still 176.2MB. Free memory was 100.3MB in the beginning and 100.3MB in the end (delta: 15.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:46:33,437 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.23ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.74ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 67.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.04ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 64.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.90ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 61.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 610.31ms. Allocated memory is still 117.4MB. Free memory was 61.4MB in the beginning and 88.0MB in the end (delta: -26.6MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3692.22ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 88.0MB in the beginning and 100.3MB in the end (delta: -12.4MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * Witness Printer took 1.93ms. Allocated memory is still 176.2MB. Free memory was 100.3MB in the beginning and 100.3MB in the end (delta: 15.5kB). 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; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1717; [L811] FCALL, FORK 0 pthread_create(&t1717, ((void *)0), P0, ((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, t1717=4094, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t1718; [L813] FCALL, FORK 0 pthread_create(&t1718, ((void *)0), P1, ((void *)0)) 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, t1717=4094, t1718=4095, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L758] 2 y$w_buff1 = y$w_buff0 [L759] 2 y$w_buff0 = 2 [L760] 2 y$w_buff1_used = y$w_buff0_used [L761] 2 y$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L763] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L764] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L765] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L766] 2 y$r_buff0_thd2 = (_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = x 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 x = 1 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y = 1 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L744] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L747] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L748] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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, t1717=4094, t1718=4095, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$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, t1717=4094, t1718=4095, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 y$flush_delayed = weak$$choice2 [L829] 0 y$mem_tmp = y [L830] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L831] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L832] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L833] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L834] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L836] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] 0 y = y$flush_delayed ? y$mem_tmp : y [L839] 0 y$flush_delayed = (_Bool)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, t1717=4094, t1718=4095, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L841] 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=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "rfi007_tso.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=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 698 IncrementalHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 0 mSDtfsCounter, 698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=6, InterpolantAutomatonStates: 31, 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.4s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 SizeOfPredicates, 15 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 41 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-02-06 12:46:33,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample