./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix019.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix019.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:48:34,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:48:34,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:48:34,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:48:34,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:48:34,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:48:34,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:48:34,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:48:34,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:48:34,741 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:48:34,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:48:34,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:48:34,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:48:34,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:48:34,741 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:48:34,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:48:34,741 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:48:34,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:48:34,743 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:48:34,743 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:48:34,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:48:34,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:48:34,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:48:34,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:48:34,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:48:34,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:48:34,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:48:34,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:48:34,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:48:34,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:48:34,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:48:34,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:48:34,744 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 [2025-03-04 09:48:34,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:48:34,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:48:34,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:48:34,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:48:34,985 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:48:34,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix019.opt.i [2025-03-04 09:48:36,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47b2cc10/290cc4b59fff47838581b2103085001f/FLAGf01343353 [2025-03-04 09:48:36,483 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:48:36,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix019.opt.i [2025-03-04 09:48:36,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47b2cc10/290cc4b59fff47838581b2103085001f/FLAGf01343353 [2025-03-04 09:48:36,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47b2cc10/290cc4b59fff47838581b2103085001f [2025-03-04 09:48:36,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:48:36,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:48:36,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:48:36,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:48:36,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:48:36,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:48:36" (1/1) ... [2025-03-04 09:48:36,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c36b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:36, skipping insertion in model container [2025-03-04 09:48:36,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:48:36" (1/1) ... [2025-03-04 09:48:36,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:48:37,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:48:37,011 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:48:37,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:48:37,084 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:48:37,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37 WrapperNode [2025-03-04 09:48:37,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:48:37,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:48:37,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:48:37,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:48:37,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,126 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2025-03-04 09:48:37,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:48:37,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:48:37,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:48:37,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:48:37,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,146 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:48:37,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,155 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:48:37,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:48:37,161 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:48:37,161 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:48:37,164 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (1/1) ... [2025-03-04 09:48:37,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:48:37,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:48:37,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:48:37,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:48:37,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:48:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:48:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:48:37,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:48:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:48:37,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:48:37,212 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:48:37,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:48:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:48:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:48:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:48:37,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:48:37,214 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:48:37,316 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:48:37,317 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:48:37,587 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:48:37,587 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:48:37,750 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:48:37,750 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:48:37,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:48:37 BoogieIcfgContainer [2025-03-04 09:48:37,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:48:37,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:48:37,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:48:37,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:48:37,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:48:36" (1/3) ... [2025-03-04 09:48:37,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720bb63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:48:37, skipping insertion in model container [2025-03-04 09:48:37,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:37" (2/3) ... [2025-03-04 09:48:37,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720bb63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:48:37, skipping insertion in model container [2025-03-04 09:48:37,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:48:37" (3/3) ... [2025-03-04 09:48:37,759 INFO L128 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2025-03-04 09:48:37,772 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:48:37,776 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix019.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:48:37,776 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:48:37,827 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:48:37,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:48:37,884 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-04 09:48:37,886 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:48:37,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-04 09:48:37,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:48:37,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2025-03-04 09:48:37,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:48:37,917 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;@2139a10c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:48:37,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 09:48:37,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:48:37,927 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-04 09:48:37,927 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:48:37,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:37,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:37,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:37,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash 114308845, now seen corresponding path program 1 times [2025-03-04 09:48:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:37,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510404934] [2025-03-04 09:48:37,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:38,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:48:38,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:48:38,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:38,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:38,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510404934] [2025-03-04 09:48:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510404934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:38,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:38,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:48:38,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365227193] [2025-03-04 09:48:38,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:38,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:48:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:38,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:48:38,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:48:38,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:48:38,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:38,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:38,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:48:38,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:39,246 INFO L124 PetriNetUnfolderBase]: 6239/8997 cut-off events. [2025-03-04 09:48:39,247 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-04 09:48:39,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17932 conditions, 8997 events. 6239/8997 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 49043 event pairs, 695 based on Foata normal form. 504/9496 useless extension candidates. Maximal degree in co-relation 17921. Up to 7705 conditions per place. [2025-03-04 09:48:39,295 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 46 selfloop transitions, 2 changer transitions 2/57 dead transitions. [2025-03-04 09:48:39,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 223 flow [2025-03-04 09:48:39,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:48:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:48:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-03-04 09:48:39,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2025-03-04 09:48:39,304 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 85 transitions. [2025-03-04 09:48:39,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 223 flow [2025-03-04 09:48:39,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:48:39,308 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-03-04 09:48:39,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-04 09:48:39,311 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-03-04 09:48:39,311 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-03-04 09:48:39,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:39,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:39,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:39,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:48:39,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:39,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash 979316200, now seen corresponding path program 1 times [2025-03-04 09:48:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:39,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722738858] [2025-03-04 09:48:39,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:39,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:39,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:48:39,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:48:39,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:39,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:39,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:39,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722738858] [2025-03-04 09:48:39,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722738858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:39,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:39,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:48:39,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711438757] [2025-03-04 09:48:39,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:39,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:48:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:39,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:48:39,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:48:39,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:48:39,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:39,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:39,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:48:39,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:40,013 INFO L124 PetriNetUnfolderBase]: 5603/8685 cut-off events. [2025-03-04 09:48:40,013 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-03-04 09:48:40,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17055 conditions, 8685 events. 5603/8685 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 51760 event pairs, 5603 based on Foata normal form. 252/8896 useless extension candidates. Maximal degree in co-relation 17045. Up to 7956 conditions per place. [2025-03-04 09:48:40,053 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-03-04 09:48:40,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 142 flow [2025-03-04 09:48:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:48:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:48:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 09:48:40,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-03-04 09:48:40,056 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 58 transitions. [2025-03-04 09:48:40,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 142 flow [2025-03-04 09:48:40,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:48:40,058 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2025-03-04 09:48:40,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-03-04 09:48:40,058 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-04 09:48:40,058 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2025-03-04 09:48:40,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:40,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:40,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:40,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:48:40,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:40,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 979316601, now seen corresponding path program 1 times [2025-03-04 09:48:40,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:40,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371519340] [2025-03-04 09:48:40,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:40,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:48:40,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:48:40,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:40,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:40,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371519340] [2025-03-04 09:48:40,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371519340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:40,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:48:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132905656] [2025-03-04 09:48:40,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:40,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:48:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:40,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:48:40,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:48:40,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:48:40,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:40,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:40,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:48:40,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:41,328 INFO L124 PetriNetUnfolderBase]: 7113/10647 cut-off events. [2025-03-04 09:48:41,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:48:41,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20903 conditions, 10647 events. 7113/10647 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 63532 event pairs, 1943 based on Foata normal form. 0/10406 useless extension candidates. Maximal degree in co-relation 20897. Up to 6742 conditions per place. [2025-03-04 09:48:41,369 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 43 selfloop transitions, 3 changer transitions 72/123 dead transitions. [2025-03-04 09:48:41,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 123 transitions, 494 flow [2025-03-04 09:48:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:48:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:48:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2025-03-04 09:48:41,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 09:48:41,375 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 8 states and 192 transitions. [2025-03-04 09:48:41,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 123 transitions, 494 flow [2025-03-04 09:48:41,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 123 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:48:41,380 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 110 flow [2025-03-04 09:48:41,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-03-04 09:48:41,381 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-03-04 09:48:41,381 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 110 flow [2025-03-04 09:48:41,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:41,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:41,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:41,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:48:41,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:41,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:41,383 INFO L85 PathProgramCache]: Analyzing trace with hash 543616408, now seen corresponding path program 1 times [2025-03-04 09:48:41,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:41,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311414041] [2025-03-04 09:48:41,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:41,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:41,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:48:41,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:48:41,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:41,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:41,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:41,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311414041] [2025-03-04 09:48:41,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311414041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:41,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:41,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:48:41,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235208653] [2025-03-04 09:48:41,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:41,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:48:41,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:41,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:48:41,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:48:41,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:48:41,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:41,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:41,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:48:41,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:42,408 INFO L124 PetriNetUnfolderBase]: 7816/11635 cut-off events. [2025-03-04 09:48:42,408 INFO L125 PetriNetUnfolderBase]: For 6307/6307 co-relation queries the response was YES. [2025-03-04 09:48:42,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27600 conditions, 11635 events. 7816/11635 cut-off events. For 6307/6307 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 67191 event pairs, 1187 based on Foata normal form. 358/11989 useless extension candidates. Maximal degree in co-relation 27588. Up to 5094 conditions per place. [2025-03-04 09:48:42,450 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 58 selfloop transitions, 7 changer transitions 81/151 dead transitions. [2025-03-04 09:48:42,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 151 transitions, 740 flow [2025-03-04 09:48:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:48:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:48:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2025-03-04 09:48:42,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-03-04 09:48:42,454 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 110 flow. Second operand 10 states and 235 transitions. [2025-03-04 09:48:42,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 151 transitions, 740 flow [2025-03-04 09:48:42,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 151 transitions, 721 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-04 09:48:42,521 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 197 flow [2025-03-04 09:48:42,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=197, PETRI_PLACES=64, PETRI_TRANSITIONS=41} [2025-03-04 09:48:42,522 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2025-03-04 09:48:42,522 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 197 flow [2025-03-04 09:48:42,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:42,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:42,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:42,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:48:42,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:42,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1128683393, now seen corresponding path program 1 times [2025-03-04 09:48:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:42,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809765418] [2025-03-04 09:48:42,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:42,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:42,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:48:42,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:48:42,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:42,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809765418] [2025-03-04 09:48:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809765418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:42,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:42,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:48:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495687536] [2025-03-04 09:48:42,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:42,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:48:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:42,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:48:42,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:48:42,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:48:42,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 41 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:42,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:42,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:48:42,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:43,154 INFO L124 PetriNetUnfolderBase]: 5301/8274 cut-off events. [2025-03-04 09:48:43,155 INFO L125 PetriNetUnfolderBase]: For 14646/14646 co-relation queries the response was YES. [2025-03-04 09:48:43,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23460 conditions, 8274 events. 5301/8274 cut-off events. For 14646/14646 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 48536 event pairs, 893 based on Foata normal form. 372/8642 useless extension candidates. Maximal degree in co-relation 23440. Up to 4425 conditions per place. [2025-03-04 09:48:43,197 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 77 selfloop transitions, 5 changer transitions 1/88 dead transitions. [2025-03-04 09:48:43,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 613 flow [2025-03-04 09:48:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:48:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:48:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 09:48:43,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-04 09:48:43,199 INFO L175 Difference]: Start difference. First operand has 64 places, 41 transitions, 197 flow. Second operand 4 states and 106 transitions. [2025-03-04 09:48:43,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 613 flow [2025-03-04 09:48:43,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 583 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-04 09:48:43,228 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 215 flow [2025-03-04 09:48:43,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2025-03-04 09:48:43,229 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2025-03-04 09:48:43,229 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 215 flow [2025-03-04 09:48:43,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:43,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:43,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:43,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:48:43,229 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:43,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:43,230 INFO L85 PathProgramCache]: Analyzing trace with hash 647988828, now seen corresponding path program 1 times [2025-03-04 09:48:43,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:43,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085837823] [2025-03-04 09:48:43,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:43,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:43,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:48:43,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:48:43,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:43,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:43,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:43,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085837823] [2025-03-04 09:48:43,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085837823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:43,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:43,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:48:43,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339821989] [2025-03-04 09:48:43,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:43,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:48:43,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:43,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:48:43,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:48:43,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:48:43,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:43,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:43,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:48:43,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:44,143 INFO L124 PetriNetUnfolderBase]: 6797/10329 cut-off events. [2025-03-04 09:48:44,143 INFO L125 PetriNetUnfolderBase]: For 13818/13818 co-relation queries the response was YES. [2025-03-04 09:48:44,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31004 conditions, 10329 events. 6797/10329 cut-off events. For 13818/13818 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 59998 event pairs, 2963 based on Foata normal form. 166/10492 useless extension candidates. Maximal degree in co-relation 30985. Up to 4946 conditions per place. [2025-03-04 09:48:44,184 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 57 selfloop transitions, 5 changer transitions 52/119 dead transitions. [2025-03-04 09:48:44,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 119 transitions, 755 flow [2025-03-04 09:48:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:48:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:48:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2025-03-04 09:48:44,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5301587301587302 [2025-03-04 09:48:44,185 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 215 flow. Second operand 7 states and 167 transitions. [2025-03-04 09:48:44,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 119 transitions, 755 flow [2025-03-04 09:48:44,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 119 transitions, 732 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 09:48:44,191 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 218 flow [2025-03-04 09:48:44,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2025-03-04 09:48:44,191 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2025-03-04 09:48:44,192 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 218 flow [2025-03-04 09:48:44,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:44,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:44,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:44,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:48:44,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:44,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash 298041586, now seen corresponding path program 1 times [2025-03-04 09:48:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279464159] [2025-03-04 09:48:44,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:44,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:48:44,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:48:44,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:44,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279464159] [2025-03-04 09:48:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279464159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:44,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:44,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:48:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523001646] [2025-03-04 09:48:44,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:44,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:48:44,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:44,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:48:44,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:48:44,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:48:44,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:44,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:44,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:48:44,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:44,981 INFO L124 PetriNetUnfolderBase]: 3735/5864 cut-off events. [2025-03-04 09:48:44,981 INFO L125 PetriNetUnfolderBase]: For 9481/9481 co-relation queries the response was YES. [2025-03-04 09:48:44,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16861 conditions, 5864 events. 3735/5864 cut-off events. For 9481/9481 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 32204 event pairs, 571 based on Foata normal form. 348/6208 useless extension candidates. Maximal degree in co-relation 16838. Up to 1862 conditions per place. [2025-03-04 09:48:45,007 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 82 selfloop transitions, 8 changer transitions 10/105 dead transitions. [2025-03-04 09:48:45,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 746 flow [2025-03-04 09:48:45,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:48:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:48:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-04 09:48:45,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 09:48:45,009 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 218 flow. Second operand 5 states and 135 transitions. [2025-03-04 09:48:45,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 746 flow [2025-03-04 09:48:45,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 105 transitions, 699 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-03-04 09:48:45,022 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 241 flow [2025-03-04 09:48:45,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2025-03-04 09:48:45,023 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2025-03-04 09:48:45,023 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 241 flow [2025-03-04 09:48:45,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:45,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:45,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:45,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:48:45,023 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:45,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:45,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1493845387, now seen corresponding path program 1 times [2025-03-04 09:48:45,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:45,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872523479] [2025-03-04 09:48:45,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:45,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:45,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 09:48:45,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 09:48:45,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:45,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:45,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:45,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872523479] [2025-03-04 09:48:45,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872523479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:45,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:45,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:48:45,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668901699] [2025-03-04 09:48:45,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:45,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:48:45,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:45,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:48:45,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:48:45,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:48:45,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:45,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:45,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:48:45,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:45,684 INFO L124 PetriNetUnfolderBase]: 2205/3454 cut-off events. [2025-03-04 09:48:45,684 INFO L125 PetriNetUnfolderBase]: For 6156/6156 co-relation queries the response was YES. [2025-03-04 09:48:45,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10700 conditions, 3454 events. 2205/3454 cut-off events. For 6156/6156 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 17278 event pairs, 451 based on Foata normal form. 140/3590 useless extension candidates. Maximal degree in co-relation 10678. Up to 1204 conditions per place. [2025-03-04 09:48:45,697 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 66 selfloop transitions, 11 changer transitions 8/90 dead transitions. [2025-03-04 09:48:45,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 611 flow [2025-03-04 09:48:45,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:48:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:48:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-03-04 09:48:45,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-03-04 09:48:45,698 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 241 flow. Second operand 6 states and 136 transitions. [2025-03-04 09:48:45,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 611 flow [2025-03-04 09:48:45,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 558 flow, removed 16 selfloop flow, removed 7 redundant places. [2025-03-04 09:48:45,711 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 223 flow [2025-03-04 09:48:45,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2025-03-04 09:48:45,713 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2025-03-04 09:48:45,713 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 223 flow [2025-03-04 09:48:45,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:45,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:45,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:48:45,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1464420553, now seen corresponding path program 1 times [2025-03-04 09:48:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984538584] [2025-03-04 09:48:45,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:45,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:48:45,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:48:45,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:45,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:45,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:45,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984538584] [2025-03-04 09:48:45,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984538584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:45,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:45,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:48:45,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632949820] [2025-03-04 09:48:45,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:45,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:48:45,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:45,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:48:45,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:48:45,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:48:45,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:45,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:45,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:48:45,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:46,222 INFO L124 PetriNetUnfolderBase]: 1293/2037 cut-off events. [2025-03-04 09:48:46,223 INFO L125 PetriNetUnfolderBase]: For 3075/3075 co-relation queries the response was YES. [2025-03-04 09:48:46,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6337 conditions, 2037 events. 1293/2037 cut-off events. For 3075/3075 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8796 event pairs, 253 based on Foata normal form. 8/2044 useless extension candidates. Maximal degree in co-relation 6317. Up to 1173 conditions per place. [2025-03-04 09:48:46,231 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 57 selfloop transitions, 10 changer transitions 18/90 dead transitions. [2025-03-04 09:48:46,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 607 flow [2025-03-04 09:48:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:48:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:48:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-03-04 09:48:46,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-04 09:48:46,232 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 223 flow. Second operand 7 states and 135 transitions. [2025-03-04 09:48:46,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 607 flow [2025-03-04 09:48:46,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 448 flow, removed 36 selfloop flow, removed 13 redundant places. [2025-03-04 09:48:46,240 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 221 flow [2025-03-04 09:48:46,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-03-04 09:48:46,240 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-04 09:48:46,240 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 221 flow [2025-03-04 09:48:46,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:46,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:46,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:46,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:48:46,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:46,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:46,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1259474393, now seen corresponding path program 2 times [2025-03-04 09:48:46,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:46,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83804] [2025-03-04 09:48:46,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:48:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:46,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:48:46,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:48:46,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:48:46,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:46,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:46,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83804] [2025-03-04 09:48:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:46,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:46,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:48:46,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051101798] [2025-03-04 09:48:46,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:46,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:48:46,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:46,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:48:46,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:48:46,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:48:46,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:46,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:46,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:48:46,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:46,715 INFO L124 PetriNetUnfolderBase]: 1681/2641 cut-off events. [2025-03-04 09:48:46,716 INFO L125 PetriNetUnfolderBase]: For 2256/2256 co-relation queries the response was YES. [2025-03-04 09:48:46,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7016 conditions, 2641 events. 1681/2641 cut-off events. For 2256/2256 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12170 event pairs, 516 based on Foata normal form. 8/2648 useless extension candidates. Maximal degree in co-relation 7001. Up to 1284 conditions per place. [2025-03-04 09:48:46,722 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 38 selfloop transitions, 1 changer transitions 45/89 dead transitions. [2025-03-04 09:48:46,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 516 flow [2025-03-04 09:48:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:48:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:48:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-03-04 09:48:46,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2025-03-04 09:48:46,724 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 221 flow. Second operand 6 states and 119 transitions. [2025-03-04 09:48:46,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 516 flow [2025-03-04 09:48:46,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 510 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 09:48:46,726 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 154 flow [2025-03-04 09:48:46,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2025-03-04 09:48:46,727 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2025-03-04 09:48:46,727 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 154 flow [2025-03-04 09:48:46,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:46,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:46,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:46,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:48:46,727 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:46,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1467791121, now seen corresponding path program 3 times [2025-03-04 09:48:46,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:46,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833957765] [2025-03-04 09:48:46,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:48:46,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:46,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:48:46,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:48:46,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:48:46,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:48,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:48:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833957765] [2025-03-04 09:48:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833957765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:48,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 09:48:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134950275] [2025-03-04 09:48:48,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:48,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:48:48,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:48:48,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:48:48,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:48:48,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:48:48,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 40 transitions, 154 flow. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:48,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:48,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:48:48,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:48,421 INFO L124 PetriNetUnfolderBase]: 723/1195 cut-off events. [2025-03-04 09:48:48,421 INFO L125 PetriNetUnfolderBase]: For 888/888 co-relation queries the response was YES. [2025-03-04 09:48:48,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2998 conditions, 1195 events. 723/1195 cut-off events. For 888/888 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4808 event pairs, 132 based on Foata normal form. 8/1203 useless extension candidates. Maximal degree in co-relation 2981. Up to 553 conditions per place. [2025-03-04 09:48:48,425 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 37 selfloop transitions, 4 changer transitions 42/88 dead transitions. [2025-03-04 09:48:48,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 478 flow [2025-03-04 09:48:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:48:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:48:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2025-03-04 09:48:48,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2025-03-04 09:48:48,426 INFO L175 Difference]: Start difference. First operand has 65 places, 40 transitions, 154 flow. Second operand 10 states and 160 transitions. [2025-03-04 09:48:48,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 478 flow [2025-03-04 09:48:48,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 422 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-03-04 09:48:48,429 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 142 flow [2025-03-04 09:48:48,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=142, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2025-03-04 09:48:48,429 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2025-03-04 09:48:48,429 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 142 flow [2025-03-04 09:48:48,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:48,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:48,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:48,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:48:48,430 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1087528073, now seen corresponding path program 4 times [2025-03-04 09:48:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:48:48,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532821907] [2025-03-04 09:48:48,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:48:48,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:48:48,437 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 09:48:48,474 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:48:48,474 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 09:48:48,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:48:48,474 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:48:48,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:48:48,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:48:48,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:48,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:48:48,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:48:48,558 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:48:48,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 09:48:48,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 09:48:48,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-04 09:48:48,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 09:48:48,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 09:48:48,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 09:48:48,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 09:48:48,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:48:48,563 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:48,627 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:48:48,627 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:48:48,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:48:48 BasicIcfg [2025-03-04 09:48:48,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:48:48,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:48:48,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:48:48,632 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:48:48,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:48:37" (3/4) ... [2025-03-04 09:48:48,633 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:48:48,634 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:48:48,635 INFO L158 Benchmark]: Toolchain (without parser) took 11877.09ms. Allocated memory was 201.3MB in the beginning and 973.1MB in the end (delta: 771.8MB). Free memory was 153.6MB in the beginning and 718.7MB in the end (delta: -565.1MB). Peak memory consumption was 210.8MB. Max. memory is 16.1GB. [2025-03-04 09:48:48,635 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:48:48,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.09ms. Allocated memory is still 201.3MB. Free memory was 153.6MB in the beginning and 129.9MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:48:48,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.43ms. Allocated memory is still 201.3MB. Free memory was 129.9MB in the beginning and 127.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:48:48,636 INFO L158 Benchmark]: Boogie Preprocessor took 32.83ms. Allocated memory is still 201.3MB. Free memory was 127.3MB in the beginning and 124.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:48:48,636 INFO L158 Benchmark]: IcfgBuilder took 590.04ms. Allocated memory is still 201.3MB. Free memory was 124.1MB in the beginning and 68.3MB in the end (delta: 55.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 09:48:48,638 INFO L158 Benchmark]: TraceAbstraction took 10879.06ms. Allocated memory was 201.3MB in the beginning and 973.1MB in the end (delta: 771.8MB). Free memory was 67.9MB in the beginning and 719.0MB in the end (delta: -651.1MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2025-03-04 09:48:48,638 INFO L158 Benchmark]: Witness Printer took 2.52ms. Allocated memory is still 973.1MB. Free memory was 719.0MB in the beginning and 718.7MB in the end (delta: 313.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:48:48,639 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.65ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.09ms. Allocated memory is still 201.3MB. Free memory was 153.6MB in the beginning and 129.9MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.43ms. Allocated memory is still 201.3MB. Free memory was 129.9MB in the beginning and 127.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.83ms. Allocated memory is still 201.3MB. Free memory was 127.3MB in the beginning and 124.1MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 590.04ms. Allocated memory is still 201.3MB. Free memory was 124.1MB in the beginning and 68.3MB in the end (delta: 55.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10879.06ms. Allocated memory was 201.3MB in the beginning and 973.1MB in the end (delta: 771.8MB). Free memory was 67.9MB in the beginning and 719.0MB in the end (delta: -651.1MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. * Witness Printer took 2.52ms. Allocated memory is still 973.1MB. Free memory was 719.0MB in the beginning and 718.7MB in the end (delta: 313.6kB). 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t500=-2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t500=-2, t501=-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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t500=-2, t501=-1, t502=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 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) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500=-2, t501=-1, t502=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 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) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 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 [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500=-2, t501=-1, t502=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500=-2, t501=-1, t502=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L861] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix019.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - 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: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 842]: 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: 844]: 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 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 630 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1909 IncrementalHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 3 mSDtfsCounter, 1909 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=7, InterpolantAutomatonStates: 69, 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.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1855 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 09:48:48,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix019.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:48:50,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:48:50,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 09:48:50,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:48:50,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:48:50,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:48:50,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:48:50,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:48:50,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:48:50,772 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:48:50,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:48:50,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:48:50,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:48:50,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:48:50,774 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:48:50,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:48:50,774 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:48:50,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:48:50,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:48:50,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:48:50,775 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:48:50,775 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:48:50,775 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:48:50,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:48:50,775 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:48:50,775 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 09:48:50,775 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 09:48:50,775 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:48:50,775 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:48:50,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:48:50,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:48:50,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:48:50,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:48:50,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:48:50,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:48:50,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:48:50,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:48:50,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:48:50,776 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 09:48:50,777 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 09:48:50,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:48:50,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:48:50,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:48:50,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:48:50,777 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 [2025-03-04 09:48:51,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:48:51,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:48:51,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:48:51,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:48:51,059 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:48:51,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix019.opt.i [2025-03-04 09:48:52,189 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f4d3151/deff62243bac466e82e070b6c25b87c0/FLAG378b7c81e [2025-03-04 09:48:52,439 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:48:52,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix019.opt.i [2025-03-04 09:48:52,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f4d3151/deff62243bac466e82e070b6c25b87c0/FLAG378b7c81e [2025-03-04 09:48:52,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f4d3151/deff62243bac466e82e070b6c25b87c0 [2025-03-04 09:48:52,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:48:52,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:48:52,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:48:52,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:48:52,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:48:52,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:48:52" (1/1) ... [2025-03-04 09:48:52,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@361f548e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:52, skipping insertion in model container [2025-03-04 09:48:52,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:48:52" (1/1) ... [2025-03-04 09:48:52,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:48:53,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:48:53,030 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:48:53,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:48:53,133 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:48:53,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53 WrapperNode [2025-03-04 09:48:53,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:48:53,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:48:53,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:48:53,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:48:53,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,174 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2025-03-04 09:48:53,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:48:53,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:48:53,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:48:53,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:48:53,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,201 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:48:53,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:48:53,216 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:48:53,216 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:48:53,216 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:48:53,217 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (1/1) ... [2025-03-04 09:48:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:48:53,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:48:53,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:48:53,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:48:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:48:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:48:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 09:48:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:48:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:48:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:48:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:48:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:48:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:48:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:48:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:48:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:48:53,272 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:48:53,377 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:48:53,378 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:48:53,622 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:48:53,623 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:48:53,795 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:48:53,795 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:48:53,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:48:53 BoogieIcfgContainer [2025-03-04 09:48:53,796 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:48:53,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:48:53,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:48:53,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:48:53,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:48:52" (1/3) ... [2025-03-04 09:48:53,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa394fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:48:53, skipping insertion in model container [2025-03-04 09:48:53,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:48:53" (2/3) ... [2025-03-04 09:48:53,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa394fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:48:53, skipping insertion in model container [2025-03-04 09:48:53,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:48:53" (3/3) ... [2025-03-04 09:48:53,802 INFO L128 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2025-03-04 09:48:53,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:48:53,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix019.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:48:53,815 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:48:53,868 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:48:53,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:48:53,914 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-04 09:48:53,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:48:53,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-04 09:48:53,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:48:53,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2025-03-04 09:48:53,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:48:53,938 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;@34d33e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:48:53,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 09:48:53,944 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:48:53,945 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-04 09:48:53,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:48:53,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:53,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:53,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:53,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1139136493, now seen corresponding path program 1 times [2025-03-04 09:48:53,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:48:53,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685747493] [2025-03-04 09:48:53,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:48:53,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:48:53,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:48:54,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:48:54,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:48:54,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:54,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:54,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:48:54,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:48:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:54,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:48:54,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:48:54,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685747493] [2025-03-04 09:48:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685747493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:54,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:54,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:48:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323984947] [2025-03-04 09:48:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:54,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:48:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:48:54,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:48:54,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:48:54,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:48:54,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:54,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:54,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:48:54,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:55,193 INFO L124 PetriNetUnfolderBase]: 6239/8997 cut-off events. [2025-03-04 09:48:55,193 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-04 09:48:55,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17932 conditions, 8997 events. 6239/8997 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 49092 event pairs, 695 based on Foata normal form. 504/9496 useless extension candidates. Maximal degree in co-relation 17921. Up to 7705 conditions per place. [2025-03-04 09:48:55,248 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 46 selfloop transitions, 2 changer transitions 2/57 dead transitions. [2025-03-04 09:48:55,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 223 flow [2025-03-04 09:48:55,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:48:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:48:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-03-04 09:48:55,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2025-03-04 09:48:55,261 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 85 transitions. [2025-03-04 09:48:55,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 223 flow [2025-03-04 09:48:55,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:48:55,267 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-03-04 09:48:55,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-04 09:48:55,272 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-03-04 09:48:55,274 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-03-04 09:48:55,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:55,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:55,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:55,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:48:55,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:55,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:55,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash 372618282, now seen corresponding path program 1 times [2025-03-04 09:48:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:48:55,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943988024] [2025-03-04 09:48:55,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:55,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:55,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:48:55,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:48:55,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:48:55,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:48:55,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:48:55,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:55,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:55,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 09:48:55,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:48:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:55,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:48:55,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:48:55,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943988024] [2025-03-04 09:48:55,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943988024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:55,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:55,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:48:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281918123] [2025-03-04 09:48:55,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:48:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:48:55,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:48:55,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:48:55,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:48:55,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:55,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:55,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:48:55,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:56,324 INFO L124 PetriNetUnfolderBase]: 5603/8685 cut-off events. [2025-03-04 09:48:56,324 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-03-04 09:48:56,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17055 conditions, 8685 events. 5603/8685 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 51685 event pairs, 5603 based on Foata normal form. 252/8896 useless extension candidates. Maximal degree in co-relation 17045. Up to 7956 conditions per place. [2025-03-04 09:48:56,366 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-03-04 09:48:56,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 142 flow [2025-03-04 09:48:56,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:48:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:48:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 09:48:56,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-03-04 09:48:56,374 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 58 transitions. [2025-03-04 09:48:56,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 142 flow [2025-03-04 09:48:56,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:48:56,376 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2025-03-04 09:48:56,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-03-04 09:48:56,379 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-04 09:48:56,379 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2025-03-04 09:48:56,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:56,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:56,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:56,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:48:56,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:56,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:56,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:56,583 INFO L85 PathProgramCache]: Analyzing trace with hash 372618683, now seen corresponding path program 1 times [2025-03-04 09:48:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:48:56,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393214738] [2025-03-04 09:48:56,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:56,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:56,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:48:56,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:48:56,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:48:56,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:48:56,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:48:56,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:56,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:56,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:48:56,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:48:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:56,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:48:56,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:48:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393214738] [2025-03-04 09:48:56,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393214738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:56,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:56,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:48:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290376046] [2025-03-04 09:48:56,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:56,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:48:56,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:48:56,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:48:56,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:48:56,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:48:56,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-03-04 09:48:56,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:56,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:48:56,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:57,254 INFO L124 PetriNetUnfolderBase]: 3991/6389 cut-off events. [2025-03-04 09:48:57,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:48:57,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12343 conditions, 6389 events. 3991/6389 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 38136 event pairs, 645 based on Foata normal form. 252/6636 useless extension candidates. Maximal degree in co-relation 12337. Up to 3409 conditions per place. [2025-03-04 09:48:57,293 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 58 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2025-03-04 09:48:57,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 280 flow [2025-03-04 09:48:57,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:48:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:48:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 09:48:57,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-04 09:48:57,295 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 106 transitions. [2025-03-04 09:48:57,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 280 flow [2025-03-04 09:48:57,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:48:57,297 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2025-03-04 09:48:57,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-03-04 09:48:57,298 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-03-04 09:48:57,298 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2025-03-04 09:48:57,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-03-04 09:48:57,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:57,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:57,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:48:57,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:57,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:57,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1546197367, now seen corresponding path program 1 times [2025-03-04 09:48:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:48:57,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730146181] [2025-03-04 09:48:57,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:57,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:57,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:48:57,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:48:57,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:48:57,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:48:57,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:48:57,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:57,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:57,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:48:57,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:48:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:57,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:48:57,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:48:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730146181] [2025-03-04 09:48:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730146181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:57,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:48:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416791887] [2025-03-04 09:48:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:57,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:48:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:48:57,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:48:57,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:48:57,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:48:57,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:57,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:57,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:48:57,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:58,058 INFO L124 PetriNetUnfolderBase]: 2183/3493 cut-off events. [2025-03-04 09:48:58,059 INFO L125 PetriNetUnfolderBase]: For 728/728 co-relation queries the response was YES. [2025-03-04 09:48:58,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7886 conditions, 3493 events. 2183/3493 cut-off events. For 728/728 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 17876 event pairs, 411 based on Foata normal form. 172/3660 useless extension candidates. Maximal degree in co-relation 7877. Up to 1116 conditions per place. [2025-03-04 09:48:58,079 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 74 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2025-03-04 09:48:58,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 400 flow [2025-03-04 09:48:58,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:48:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:48:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-04 09:48:58,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 09:48:58,085 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 135 transitions. [2025-03-04 09:48:58,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 400 flow [2025-03-04 09:48:58,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 09:48:58,090 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2025-03-04 09:48:58,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-03-04 09:48:58,092 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-04 09:48:58,092 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2025-03-04 09:48:58,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:58,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:58,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:58,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:48:58,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:58,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:58,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:58,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1092280723, now seen corresponding path program 1 times [2025-03-04 09:48:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:48:58,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689168692] [2025-03-04 09:48:58,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:58,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:58,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:48:58,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:48:58,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:48:58,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:48:58,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:48:58,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:58,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:58,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:48:58,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:48:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:58,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:48:58,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:48:58,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689168692] [2025-03-04 09:48:58,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689168692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:58,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:58,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:48:58,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211648586] [2025-03-04 09:48:58,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:58,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:48:58,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:48:58,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:48:58,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:48:58,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:48:58,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:58,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:58,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:48:58,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:58,708 INFO L124 PetriNetUnfolderBase]: 1331/2061 cut-off events. [2025-03-04 09:48:58,708 INFO L125 PetriNetUnfolderBase]: For 1342/1342 co-relation queries the response was YES. [2025-03-04 09:48:58,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5126 conditions, 2061 events. 1331/2061 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9141 event pairs, 369 based on Foata normal form. 60/2116 useless extension candidates. Maximal degree in co-relation 5115. Up to 776 conditions per place. [2025-03-04 09:48:58,719 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 62 selfloop transitions, 11 changer transitions 1/80 dead transitions. [2025-03-04 09:48:58,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 387 flow [2025-03-04 09:48:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:48:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:48:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-03-04 09:48:58,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-03-04 09:48:58,722 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 136 transitions. [2025-03-04 09:48:58,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 387 flow [2025-03-04 09:48:58,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 362 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 09:48:58,731 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2025-03-04 09:48:58,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2025-03-04 09:48:58,732 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-03-04 09:48:58,732 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2025-03-04 09:48:58,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:58,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:58,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:58,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 09:48:58,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:58,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:58,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:58,934 INFO L85 PathProgramCache]: Analyzing trace with hash -960465371, now seen corresponding path program 1 times [2025-03-04 09:48:58,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:48:58,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284847209] [2025-03-04 09:48:58,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:48:58,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:58,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:48:58,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:48:58,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:48:59,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:48:59,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:48:59,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:48:59,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:59,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 09:48:59,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:48:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:48:59,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:48:59,195 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:48:59,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284847209] [2025-03-04 09:48:59,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284847209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:48:59,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:48:59,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 09:48:59,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352267887] [2025-03-04 09:48:59,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:48:59,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:48:59,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:48:59,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:48:59,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:48:59,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:48:59,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:59,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:48:59,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:48:59,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:48:59,617 INFO L124 PetriNetUnfolderBase]: 1735/2688 cut-off events. [2025-03-04 09:48:59,617 INFO L125 PetriNetUnfolderBase]: For 1864/1864 co-relation queries the response was YES. [2025-03-04 09:48:59,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6822 conditions, 2688 events. 1735/2688 cut-off events. For 1864/1864 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 12711 event pairs, 245 based on Foata normal form. 8/2694 useless extension candidates. Maximal degree in co-relation 6810. Up to 1317 conditions per place. [2025-03-04 09:48:59,628 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 56 selfloop transitions, 7 changer transitions 41/110 dead transitions. [2025-03-04 09:48:59,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 110 transitions, 603 flow [2025-03-04 09:48:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:48:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:48:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2025-03-04 09:48:59,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-04 09:48:59,634 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 9 states and 189 transitions. [2025-03-04 09:48:59,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 110 transitions, 603 flow [2025-03-04 09:48:59,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 110 transitions, 486 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-04 09:48:59,643 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 153 flow [2025-03-04 09:48:59,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=153, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2025-03-04 09:48:59,645 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-04 09:48:59,645 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 153 flow [2025-03-04 09:48:59,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:48:59,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:48:59,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:48:59,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:48:59,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:59,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:48:59,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:48:59,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1196679955, now seen corresponding path program 2 times [2025-03-04 09:48:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:48:59,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366586102] [2025-03-04 09:48:59,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:48:59,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:48:59,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:48:59,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:48:59,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:48:59,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:48:59,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:48:59,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:48:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:48:59,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:48:59,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:49:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:49:00,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:49:00,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:49:00,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366586102] [2025-03-04 09:49:00,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366586102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:49:00,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:49:00,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:49:00,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365763411] [2025-03-04 09:49:00,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:49:00,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:49:00,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:49:00,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:49:00,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:49:00,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:49:00,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 153 flow. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:49:00,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:49:00,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:49:00,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:49:00,373 INFO L124 PetriNetUnfolderBase]: 1843/2881 cut-off events. [2025-03-04 09:49:00,374 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2025-03-04 09:49:00,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6993 conditions, 2881 events. 1843/2881 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 14008 event pairs, 417 based on Foata normal form. 8/2886 useless extension candidates. Maximal degree in co-relation 6979. Up to 1171 conditions per place. [2025-03-04 09:49:00,384 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 63 selfloop transitions, 11 changer transitions 27/107 dead transitions. [2025-03-04 09:49:00,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 107 transitions, 529 flow [2025-03-04 09:49:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:49:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:49:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2025-03-04 09:49:00,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-04 09:49:00,385 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 153 flow. Second operand 8 states and 174 transitions. [2025-03-04 09:49:00,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 107 transitions, 529 flow [2025-03-04 09:49:00,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 107 transitions, 497 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-04 09:49:00,388 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 176 flow [2025-03-04 09:49:00,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=176, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2025-03-04 09:49:00,389 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-04 09:49:00,389 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 176 flow [2025-03-04 09:49:00,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:49:00,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:49:00,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:49:00,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 09:49:00,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:49:00,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-04 09:49:00,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:49:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1714223257, now seen corresponding path program 3 times [2025-03-04 09:49:00,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:49:00,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463773086] [2025-03-04 09:49:00,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:49:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:49:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:49:00,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:49:00,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:49:00,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:49:00,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:49:00,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:49:00,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:49:00,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:49:00,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:49:00,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:49:00,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:49:00,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:49:00,752 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 09:49:00,753 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:49:00,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 09:49:00,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 09:49:00,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-04 09:49:00,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 09:49:00,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 09:49:00,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 09:49:00,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 09:49:00,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:49:00,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:49:00,956 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-03-04 09:49:01,008 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:49:01,008 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:49:01,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:49:01 BasicIcfg [2025-03-04 09:49:01,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:49:01,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:49:01,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:49:01,015 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:49:01,016 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:48:53" (3/4) ... [2025-03-04 09:49:01,017 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:49:01,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:49:01,019 INFO L158 Benchmark]: Toolchain (without parser) took 8257.88ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 89.7MB in the beginning and 629.1MB in the end (delta: -539.4MB). Peak memory consumption was 249.7MB. Max. memory is 16.1GB. [2025-03-04 09:49:01,019 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 18.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:49:01,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.97ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 65.9MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:49:01,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.23ms. Allocated memory is still 117.4MB. Free memory was 65.9MB in the beginning and 63.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:49:01,020 INFO L158 Benchmark]: Boogie Preprocessor took 36.81ms. Allocated memory is still 117.4MB. Free memory was 63.5MB in the beginning and 60.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:49:01,020 INFO L158 Benchmark]: IcfgBuilder took 579.74ms. Allocated memory is still 117.4MB. Free memory was 60.4MB in the beginning and 42.0MB in the end (delta: 18.4MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2025-03-04 09:49:01,021 INFO L158 Benchmark]: TraceAbstraction took 7217.03ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 41.3MB in the beginning and 629.2MB in the end (delta: -587.8MB). Peak memory consumption was 203.2MB. Max. memory is 16.1GB. [2025-03-04 09:49:01,022 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 906.0MB. Free memory was 629.2MB in the beginning and 629.1MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:49:01,022 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.7MB in the end (delta: 18.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.97ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 65.9MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.23ms. Allocated memory is still 117.4MB. Free memory was 65.9MB in the beginning and 63.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.81ms. Allocated memory is still 117.4MB. Free memory was 63.5MB in the beginning and 60.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 579.74ms. Allocated memory is still 117.4MB. Free memory was 60.4MB in the beginning and 42.0MB in the end (delta: 18.4MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7217.03ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 41.3MB in the beginning and 629.2MB in the end (delta: -587.8MB). Peak memory consumption was 203.2MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 906.0MB. Free memory was 629.2MB in the beginning and 629.1MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t500=510, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t500=510, t501=511, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t500=510, t501=511, t502=512, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L760] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 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) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500=510, t501=511, t502=512, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 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) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 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 [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500=510, t501=511, t502=512, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500=510, t501=511, t502=512, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L861] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix019.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - 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: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 846]: 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: 842]: 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 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 381 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1146 IncrementalHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 0 mSDtfsCounter, 1146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 462 SizeOfPredicates, 18 NumberOfNonLiveVariables, 692 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 09:49:01,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample