./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:41:13,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:41:13,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:41:13,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:41:13,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:41:14,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:41:14,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:41:14,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:41:14,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:41:14,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:41:14,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:41:14,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:41:14,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:41:14,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:41:14,016 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:41:14,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:41:14,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:41:14,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:41:14,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:41:14,019 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 [2025-02-06 12:41:14,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:41:14,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:41:14,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:41:14,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:41:14,247 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:41:14,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2025-02-06 12:41:15,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29ae03def/b13ff2d57796455bb6e70b6e4ae0e27f/FLAG89092258c [2025-02-06 12:41:15,787 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:41:15,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2025-02-06 12:41:15,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29ae03def/b13ff2d57796455bb6e70b6e4ae0e27f/FLAG89092258c [2025-02-06 12:41:15,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29ae03def/b13ff2d57796455bb6e70b6e4ae0e27f [2025-02-06 12:41:15,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:41:15,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:41:15,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:41:15,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:41:15,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:41:15,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:41:15" (1/1) ... [2025-02-06 12:41:15,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56777547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:15, skipping insertion in model container [2025-02-06 12:41:15,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:41:15" (1/1) ... [2025-02-06 12:41:15,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:41:16,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:41:16,151 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:41:16,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:41:16,211 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:41:16,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16 WrapperNode [2025-02-06 12:41:16,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:41:16,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:41:16,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:41:16,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:41:16,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,240 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2025-02-06 12:41:16,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:41:16,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:41:16,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:41:16,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:41:16,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,260 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:41:16,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:41:16,275 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:41:16,275 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:41:16,275 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:41:16,276 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (1/1) ... [2025-02-06 12:41:16,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:41:16,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:16,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:41:16,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:41:16,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:41:16,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:41:16,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:41:16,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:41:16,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:41:16,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:41:16,321 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:41:16,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:41:16,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:41:16,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:41:16,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:41:16,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:41:16,323 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:41:16,404 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:41:16,405 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:41:16,802 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:41:16,802 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:41:17,124 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:41:17,124 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:41:17,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:41:17 BoogieIcfgContainer [2025-02-06 12:41:17,125 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:41:17,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:41:17,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:41:17,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:41:17,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:41:15" (1/3) ... [2025-02-06 12:41:17,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35dc1f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:41:17, skipping insertion in model container [2025-02-06 12:41:17,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:16" (2/3) ... [2025-02-06 12:41:17,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35dc1f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:41:17, skipping insertion in model container [2025-02-06 12:41:17,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:41:17" (3/3) ... [2025-02-06 12:41:17,134 INFO L128 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2025-02-06 12:41:17,147 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:41:17,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix025_pso.opt_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:41:17,149 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:41:17,190 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:41:17,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2025-02-06 12:41:17,271 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-02-06 12:41:17,273 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:41:17,279 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 81 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-02-06 12:41:17,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2025-02-06 12:41:17,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2025-02-06 12:41:17,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:41:17,320 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;@11dc3436, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:41:17,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:41:17,325 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:41:17,325 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 12:41:17,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:41:17,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:17,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:41:17,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:17,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:17,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1836138443, now seen corresponding path program 1 times [2025-02-06 12:41:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:17,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077759168] [2025-02-06 12:41:17,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:17,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:17,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:41:17,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:41:17,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:17,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:17,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:17,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077759168] [2025-02-06 12:41:17,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077759168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:17,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:17,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:41:17,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295733922] [2025-02-06 12:41:17,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:17,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:41:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:17,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:41:17,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:41:17,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:17,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:17,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:17,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:17,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:18,986 INFO L124 PetriNetUnfolderBase]: 6239/8983 cut-off events. [2025-02-06 12:41:18,987 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-06 12:41:19,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17918 conditions, 8983 events. 6239/8983 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 50132 event pairs, 689 based on Foata normal form. 498/9467 useless extension candidates. Maximal degree in co-relation 17907. Up to 7711 conditions per place. [2025-02-06 12:41:19,042 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-02-06 12:41:19,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 238 flow [2025-02-06 12:41:19,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:41:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:41:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-06 12:41:19,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2025-02-06 12:41:19,053 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 88 transitions. [2025-02-06 12:41:19,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 238 flow [2025-02-06 12:41:19,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:41:19,058 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-02-06 12:41:19,060 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-02-06 12:41:19,062 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-02-06 12:41:19,062 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-02-06 12:41:19,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:19,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:19,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:41:19,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:41:19,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:19,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1810748916, now seen corresponding path program 1 times [2025-02-06 12:41:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:19,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064329174] [2025-02-06 12:41:19,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:19,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:19,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:41:19,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:41:19,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:19,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:19,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064329174] [2025-02-06 12:41:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064329174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:19,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:19,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:41:19,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448196415] [2025-02-06 12:41:19,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:19,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:41:19,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:19,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:41:19,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:41:19,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 12:41:19,130 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-02-06 12:41:19,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:19,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 12:41:19,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:19,729 INFO L124 PetriNetUnfolderBase]: 5603/8579 cut-off events. [2025-02-06 12:41:19,729 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-02-06 12:41:19,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17015 conditions, 8579 events. 5603/8579 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 50596 event pairs, 5603 based on Foata normal form. 252/8782 useless extension candidates. Maximal degree in co-relation 17005. Up to 7956 conditions per place. [2025-02-06 12:41:19,767 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-02-06 12:41:19,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 142 flow [2025-02-06 12:41:19,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:41:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:41:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-06 12:41:19,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-02-06 12:41:19,769 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 58 transitions. [2025-02-06 12:41:19,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 142 flow [2025-02-06 12:41:19,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:41:19,770 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2025-02-06 12:41:19,770 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-02-06 12:41:19,771 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-02-06 12:41:19,771 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2025-02-06 12:41:19,771 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-02-06 12:41:19,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:19,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:41:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:41:19,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:19,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1810749343, now seen corresponding path program 1 times [2025-02-06 12:41:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53349036] [2025-02-06 12:41:19,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:19,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:41:19,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:41:19,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:19,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:19,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:19,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53349036] [2025-02-06 12:41:19,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53349036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:19,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:19,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:41:19,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109076987] [2025-02-06 12:41:19,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:19,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:41:19,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:19,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:41:19,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:41:19,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 12:41:19,968 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-02-06 12:41:19,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:19,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 12:41:19,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:20,948 INFO L124 PetriNetUnfolderBase]: 7135/10687 cut-off events. [2025-02-06 12:41:20,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:41:20,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20973 conditions, 10687 events. 7135/10687 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 62613 event pairs, 2001 based on Foata normal form. 0/10434 useless extension candidates. Maximal degree in co-relation 20967. Up to 6723 conditions per place. [2025-02-06 12:41:21,002 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 40 selfloop transitions, 3 changer transitions 70/118 dead transitions. [2025-02-06 12:41:21,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 118 transitions, 472 flow [2025-02-06 12:41:21,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:41:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:41:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2025-02-06 12:41:21,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-02-06 12:41:21,004 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 8 states and 187 transitions. [2025-02-06 12:41:21,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 118 transitions, 472 flow [2025-02-06 12:41:21,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 118 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:41:21,008 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 110 flow [2025-02-06 12:41:21,008 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-02-06 12:41:21,009 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-02-06 12:41:21,009 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 110 flow [2025-02-06 12:41:21,009 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-02-06 12:41:21,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:21,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:41:21,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:41:21,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:21,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:21,010 INFO L85 PathProgramCache]: Analyzing trace with hash -848035938, now seen corresponding path program 1 times [2025-02-06 12:41:21,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:21,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578894730] [2025-02-06 12:41:21,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:21,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:21,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:41:21,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:41:21,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:21,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:21,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:21,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578894730] [2025-02-06 12:41:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578894730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:21,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:21,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:41:21,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335829770] [2025-02-06 12:41:21,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:21,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:41:21,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:21,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:41:21,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:41:21,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 12:41:21,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:21,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:21,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 12:41:21,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:21,812 INFO L124 PetriNetUnfolderBase]: 5415/8151 cut-off events. [2025-02-06 12:41:21,812 INFO L125 PetriNetUnfolderBase]: For 4420/4420 co-relation queries the response was YES. [2025-02-06 12:41:21,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19201 conditions, 8151 events. 5415/8151 cut-off events. For 4420/4420 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 45677 event pairs, 1241 based on Foata normal form. 240/8378 useless extension candidates. Maximal degree in co-relation 19189. Up to 4993 conditions per place. [2025-02-06 12:41:21,858 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 43 selfloop transitions, 2 changer transitions 55/105 dead transitions. [2025-02-06 12:41:21,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 105 transitions, 500 flow [2025-02-06 12:41:21,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:41:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:41:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-02-06 12:41:21,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2025-02-06 12:41:21,862 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 110 flow. Second operand 7 states and 163 transitions. [2025-02-06 12:41:21,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 105 transitions, 500 flow [2025-02-06 12:41:21,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 105 transitions, 483 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-06 12:41:21,960 INFO L231 Difference]: Finished difference. Result has 57 places, 36 transitions, 117 flow [2025-02-06 12:41:21,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=101, 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=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=117, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2025-02-06 12:41:21,961 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-02-06 12:41:21,961 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 117 flow [2025-02-06 12:41:21,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:21,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:21,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:41:21,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:41:21,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:21,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 797755705, now seen corresponding path program 1 times [2025-02-06 12:41:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631838785] [2025-02-06 12:41:21,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:21,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:41:21,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:41:21,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:21,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:22,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:22,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631838785] [2025-02-06 12:41:22,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631838785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:22,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:22,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:41:22,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158525695] [2025-02-06 12:41:22,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:22,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:41:22,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:22,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:41:22,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:41:22,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:22,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:22,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:22,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:22,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:22,545 INFO L124 PetriNetUnfolderBase]: 3703/5731 cut-off events. [2025-02-06 12:41:22,546 INFO L125 PetriNetUnfolderBase]: For 2644/2644 co-relation queries the response was YES. [2025-02-06 12:41:22,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13669 conditions, 5731 events. 3703/5731 cut-off events. For 2644/2644 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 31693 event pairs, 597 based on Foata normal form. 252/5972 useless extension candidates. Maximal degree in co-relation 13653. Up to 3001 conditions per place. [2025-02-06 12:41:22,571 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 64 selfloop transitions, 5 changer transitions 1/75 dead transitions. [2025-02-06 12:41:22,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 373 flow [2025-02-06 12:41:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:41:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:41:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-02-06 12:41:22,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-02-06 12:41:22,575 INFO L175 Difference]: Start difference. First operand has 57 places, 36 transitions, 117 flow. Second operand 4 states and 106 transitions. [2025-02-06 12:41:22,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 373 flow [2025-02-06 12:41:22,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 351 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-06 12:41:22,594 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 137 flow [2025-02-06 12:41:22,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2025-02-06 12:41:22,596 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-02-06 12:41:22,597 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 137 flow [2025-02-06 12:41:22,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:22,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:22,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:41:22,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:41:22,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:22,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:22,598 INFO L85 PathProgramCache]: Analyzing trace with hash -902451616, now seen corresponding path program 1 times [2025-02-06 12:41:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:22,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120611880] [2025-02-06 12:41:22,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:22,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:41:22,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:41:22,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:22,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:22,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:22,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120611880] [2025-02-06 12:41:22,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120611880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:22,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:22,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:41:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427865955] [2025-02-06 12:41:22,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:22,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:41:22,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:22,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:41:22,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:41:22,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:22,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-02-06 12:41:22,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:22,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:22,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:23,187 INFO L124 PetriNetUnfolderBase]: 2135/3347 cut-off events. [2025-02-06 12:41:23,187 INFO L125 PetriNetUnfolderBase]: For 1572/1572 co-relation queries the response was YES. [2025-02-06 12:41:23,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8463 conditions, 3347 events. 2135/3347 cut-off events. For 1572/1572 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 16509 event pairs, 379 based on Foata normal form. 172/3508 useless extension candidates. Maximal degree in co-relation 8449. Up to 1116 conditions per place. [2025-02-06 12:41:23,201 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 78 selfloop transitions, 8 changer transitions 1/92 dead transitions. [2025-02-06 12:41:23,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 92 transitions, 469 flow [2025-02-06 12:41:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:41:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:41:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-02-06 12:41:23,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-06 12:41:23,202 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 137 flow. Second operand 5 states and 135 transitions. [2025-02-06 12:41:23,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 92 transitions, 469 flow [2025-02-06 12:41:23,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 92 transitions, 459 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:41:23,207 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 177 flow [2025-02-06 12:41:23,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-02-06 12:41:23,208 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-02-06 12:41:23,208 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 177 flow [2025-02-06 12:41:23,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-02-06 12:41:23,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:23,208 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-02-06 12:41:23,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:41:23,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:23,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash -816710228, now seen corresponding path program 1 times [2025-02-06 12:41:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:23,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444669756] [2025-02-06 12:41:23,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:23,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:41:23,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:41:23,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:23,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444669756] [2025-02-06 12:41:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444669756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:23,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:23,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:41:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569551705] [2025-02-06 12:41:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:23,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:41:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:23,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:41:23,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:41:23,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 12:41:23,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:23,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:23,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 12:41:23,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:24,081 INFO L124 PetriNetUnfolderBase]: 3323/5176 cut-off events. [2025-02-06 12:41:24,081 INFO L125 PetriNetUnfolderBase]: For 4069/4069 co-relation queries the response was YES. [2025-02-06 12:41:24,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13954 conditions, 5176 events. 3323/5176 cut-off events. For 4069/4069 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 27333 event pairs, 649 based on Foata normal form. 68/5241 useless extension candidates. Maximal degree in co-relation 13938. Up to 2388 conditions per place. [2025-02-06 12:41:24,094 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 96 selfloop transitions, 15 changer transitions 48/164 dead transitions. [2025-02-06 12:41:24,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 164 transitions, 970 flow [2025-02-06 12:41:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:41:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 12:41:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 240 transitions. [2025-02-06 12:41:24,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-02-06 12:41:24,096 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 177 flow. Second operand 11 states and 240 transitions. [2025-02-06 12:41:24,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 164 transitions, 970 flow [2025-02-06 12:41:24,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 164 transitions, 898 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-02-06 12:41:24,105 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 296 flow [2025-02-06 12:41:24,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=296, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2025-02-06 12:41:24,105 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2025-02-06 12:41:24,105 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 296 flow [2025-02-06 12:41:24,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:24,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:24,106 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-02-06 12:41:24,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:41:24,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:24,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:24,106 INFO L85 PathProgramCache]: Analyzing trace with hash 907866550, now seen corresponding path program 2 times [2025-02-06 12:41:24,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:24,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425634744] [2025-02-06 12:41:24,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:41:24,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:24,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:41:24,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:41:24,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:41:24,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:24,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425634744] [2025-02-06 12:41:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425634744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:24,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:41:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520295559] [2025-02-06 12:41:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:24,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:41:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:24,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:41:24,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:41:24,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 12:41:24,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:24,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:24,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 12:41:24,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:25,225 INFO L124 PetriNetUnfolderBase]: 4375/6808 cut-off events. [2025-02-06 12:41:25,226 INFO L125 PetriNetUnfolderBase]: For 8678/8678 co-relation queries the response was YES. [2025-02-06 12:41:25,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20176 conditions, 6808 events. 4375/6808 cut-off events. For 8678/8678 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 37905 event pairs, 975 based on Foata normal form. 56/6861 useless extension candidates. Maximal degree in co-relation 20152. Up to 2372 conditions per place. [2025-02-06 12:41:25,257 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 100 selfloop transitions, 15 changer transitions 45/165 dead transitions. [2025-02-06 12:41:25,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 165 transitions, 1101 flow [2025-02-06 12:41:25,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:41:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:41:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2025-02-06 12:41:25,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2025-02-06 12:41:25,259 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 296 flow. Second operand 8 states and 206 transitions. [2025-02-06 12:41:25,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 165 transitions, 1101 flow [2025-02-06 12:41:25,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 165 transitions, 1065 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-02-06 12:41:25,276 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 324 flow [2025-02-06 12:41:25,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=324, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2025-02-06 12:41:25,277 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2025-02-06 12:41:25,279 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 324 flow [2025-02-06 12:41:25,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:25,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:25,279 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-02-06 12:41:25,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:41:25,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1253200296, now seen corresponding path program 3 times [2025-02-06 12:41:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505406843] [2025-02-06 12:41:25,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:41:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:25,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:41:25,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:41:25,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:41:25,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:25,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505406843] [2025-02-06 12:41:25,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505406843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:25,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:25,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:41:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636695878] [2025-02-06 12:41:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:25,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:41:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:25,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:41:25,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:41:25,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:25,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 324 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-02-06 12:41:25,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:25,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:25,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:25,901 INFO L124 PetriNetUnfolderBase]: 2547/4007 cut-off events. [2025-02-06 12:41:25,902 INFO L125 PetriNetUnfolderBase]: For 7041/7041 co-relation queries the response was YES. [2025-02-06 12:41:25,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12139 conditions, 4007 events. 2547/4007 cut-off events. For 7041/7041 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 21172 event pairs, 469 based on Foata normal form. 156/4152 useless extension candidates. Maximal degree in co-relation 12113. Up to 1460 conditions per place. [2025-02-06 12:41:25,918 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 67 selfloop transitions, 11 changer transitions 25/108 dead transitions. [2025-02-06 12:41:25,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 835 flow [2025-02-06 12:41:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:41:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:41:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-02-06 12:41:25,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-02-06 12:41:25,920 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 324 flow. Second operand 6 states and 136 transitions. [2025-02-06 12:41:25,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 835 flow [2025-02-06 12:41:25,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 699 flow, removed 28 selfloop flow, removed 12 redundant places. [2025-02-06 12:41:25,929 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 239 flow [2025-02-06 12:41:25,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2025-02-06 12:41:25,930 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2025-02-06 12:41:25,930 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 239 flow [2025-02-06 12:41:25,930 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-02-06 12:41:25,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:25,930 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-02-06 12:41:25,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:41:25,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:25,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:25,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1282450198, now seen corresponding path program 1 times [2025-02-06 12:41:25,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:25,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261839023] [2025-02-06 12:41:25,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:25,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:25,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:41:25,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:41:25,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:25,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:26,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:26,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261839023] [2025-02-06 12:41:26,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261839023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:26,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:26,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:41:26,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326227266] [2025-02-06 12:41:26,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:26,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:41:26,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:26,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:41:26,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:41:26,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 12:41:26,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 239 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-02-06 12:41:26,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:26,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 12:41:26,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:26,469 INFO L124 PetriNetUnfolderBase]: 2131/3415 cut-off events. [2025-02-06 12:41:26,470 INFO L125 PetriNetUnfolderBase]: For 4481/4481 co-relation queries the response was YES. [2025-02-06 12:41:26,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10075 conditions, 3415 events. 2131/3415 cut-off events. For 4481/4481 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17741 event pairs, 691 based on Foata normal form. 8/3419 useless extension candidates. Maximal degree in co-relation 10055. Up to 1932 conditions per place. [2025-02-06 12:41:26,479 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 39 selfloop transitions, 3 changer transitions 41/88 dead transitions. [2025-02-06 12:41:26,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 592 flow [2025-02-06 12:41:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:41:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:41:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-02-06 12:41:26,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44814814814814813 [2025-02-06 12:41:26,481 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 239 flow. Second operand 6 states and 121 transitions. [2025-02-06 12:41:26,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 592 flow [2025-02-06 12:41:26,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 483 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:41:26,493 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 152 flow [2025-02-06 12:41:26,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2025-02-06 12:41:26,494 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2025-02-06 12:41:26,494 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 152 flow [2025-02-06 12:41:26,494 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-02-06 12:41:26,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:26,494 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-02-06 12:41:26,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:41:26,494 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:26,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash 611040526, now seen corresponding path program 2 times [2025-02-06 12:41:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:26,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513271691] [2025-02-06 12:41:26,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:41:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:26,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:41:26,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:41:26,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:41:26,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:26,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:41:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513271691] [2025-02-06 12:41:26,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513271691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:26,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:26,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:41:26,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538491958] [2025-02-06 12:41:26,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:26,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:41:26,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:41:26,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:41:26,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:41:26,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 12:41:26,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 152 flow. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:26,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:26,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 12:41:26,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:27,320 INFO L124 PetriNetUnfolderBase]: 895/1461 cut-off events. [2025-02-06 12:41:27,320 INFO L125 PetriNetUnfolderBase]: For 618/618 co-relation queries the response was YES. [2025-02-06 12:41:27,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3588 conditions, 1461 events. 895/1461 cut-off events. For 618/618 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6273 event pairs, 170 based on Foata normal form. 8/1468 useless extension candidates. Maximal degree in co-relation 3569. Up to 571 conditions per place. [2025-02-06 12:41:27,330 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 54 selfloop transitions, 5 changer transitions 36/100 dead transitions. [2025-02-06 12:41:27,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 541 flow [2025-02-06 12:41:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:41:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:41:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2025-02-06 12:41:27,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39753086419753086 [2025-02-06 12:41:27,331 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 152 flow. Second operand 9 states and 161 transitions. [2025-02-06 12:41:27,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 541 flow [2025-02-06 12:41:27,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 489 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-02-06 12:41:27,336 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 149 flow [2025-02-06 12:41:27,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=149, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2025-02-06 12:41:27,337 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2025-02-06 12:41:27,337 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 149 flow [2025-02-06 12:41:27,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:27,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:27,338 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-02-06 12:41:27,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:41:27,338 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:27,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:27,339 INFO L85 PathProgramCache]: Analyzing trace with hash -184550042, now seen corresponding path program 3 times [2025-02-06 12:41:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:41:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196228026] [2025-02-06 12:41:27,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:41:27,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:41:27,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:41:27,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:41:27,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:41:27,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:41:27,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:41:27,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:41:27,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:41:27,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:27,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:41:27,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:41:27,461 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:41:27,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 12:41:27,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:41:27,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:41:27,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:41:27,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-06 12:41:27,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-06 12:41:27,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:41:27,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:41:27,467 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 12:41:27,540 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:41:27,541 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:41:27,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:41:27 BasicIcfg [2025-02-06 12:41:27,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:41:27,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:41:27,547 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:41:27,547 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:41:27,548 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:41:17" (3/4) ... [2025-02-06 12:41:27,550 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:41:27,551 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:41:27,552 INFO L158 Benchmark]: Toolchain (without parser) took 11719.04ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 110.2MB in the beginning and 446.2MB in the end (delta: -336.0MB). Peak memory consumption was 540.7MB. Max. memory is 16.1GB. [2025-02-06 12:41:27,552 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:41:27,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.88ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 87.0MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:41:27,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.69ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 84.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:41:27,553 INFO L158 Benchmark]: Boogie Preprocessor took 29.64ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 81.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:41:27,553 INFO L158 Benchmark]: IcfgBuilder took 850.22ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 99.1MB in the end (delta: -17.3MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2025-02-06 12:41:27,554 INFO L158 Benchmark]: TraceAbstraction took 10419.86ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 98.4MB in the beginning and 450.6MB in the end (delta: -352.2MB). Peak memory consumption was 518.1MB. Max. memory is 16.1GB. [2025-02-06 12:41:27,554 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 1.0GB. Free memory was 446.4MB in the beginning and 446.2MB in the end (delta: 210.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:41:27,555 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.88ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 87.0MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.69ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 84.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.64ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 81.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 850.22ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 99.1MB in the end (delta: -17.3MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10419.86ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 98.4MB in the beginning and 450.6MB in the end (delta: -352.2MB). Peak memory consumption was 518.1MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 1.0GB. Free memory was 446.4MB in the beginning and 446.2MB in the end (delta: 210.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t666; [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] 0 pthread_t t667; [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, t667=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] 0 pthread_t t668; [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L746] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L18] 0 __assert_fail ("0", "mix025_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 839]: 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: 835]: 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.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 698 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 694 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1959 IncrementalHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2 mSDtfsCounter, 1959 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1093 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-02-06 12:41:27,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:41:30,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:41:30,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:41:30,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:41:30,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:41:30,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:41:30,252 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:41:30,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:41:30,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:41:30,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:41:30,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:41:30,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:41:30,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:41:30,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:41:30,253 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:41:30,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:41:30,253 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:41:30,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:41:30,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:41:30,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:41:30,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:41:30,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:41:30,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:41:30,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:41:30,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:41:30,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:41:30,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:41:30,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:41:30,255 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:41:30,255 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:41:30,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:41:30,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:41:30,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:41:30,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:41:30,256 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 [2025-02-06 12:41:30,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:41:30,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:41:30,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:41:30,480 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:41:30,481 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:41:30,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2025-02-06 12:41:31,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a724c0d9/b88d2b059cb940119609084b171591a3/FLAG18ec3f3dd [2025-02-06 12:41:31,962 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:41:31,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2025-02-06 12:41:31,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a724c0d9/b88d2b059cb940119609084b171591a3/FLAG18ec3f3dd [2025-02-06 12:41:32,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a724c0d9/b88d2b059cb940119609084b171591a3 [2025-02-06 12:41:32,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:41:32,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:41:32,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:41:32,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:41:32,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:41:32,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318f208e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32, skipping insertion in model container [2025-02-06 12:41:32,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:41:32,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:41:32,552 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:41:32,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:41:32,647 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:41:32,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32 WrapperNode [2025-02-06 12:41:32,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:41:32,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:41:32,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:41:32,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:41:32,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,682 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2025-02-06 12:41:32,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:41:32,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:41:32,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:41:32,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:41:32,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,711 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:41:32,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:41:32,735 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:41:32,735 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:41:32,735 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:41:32,735 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (1/1) ... [2025-02-06 12:41:32,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:41:32,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:32,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:41:32,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:41:32,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:41:32,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:41:32,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:41:32,804 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:41:32,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:41:32,804 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:41:32,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:41:32,804 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:41:32,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:41:32,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:41:32,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:41:32,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:41:32,805 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:41:32,920 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:41:32,922 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:41:33,182 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:41:33,182 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:41:33,371 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:41:33,371 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:41:33,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:41:33 BoogieIcfgContainer [2025-02-06 12:41:33,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:41:33,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:41:33,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:41:33,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:41:33,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:41:32" (1/3) ... [2025-02-06 12:41:33,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193e5b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:41:33, skipping insertion in model container [2025-02-06 12:41:33,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:41:32" (2/3) ... [2025-02-06 12:41:33,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193e5b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:41:33, skipping insertion in model container [2025-02-06 12:41:33,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:41:33" (3/3) ... [2025-02-06 12:41:33,381 INFO L128 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2025-02-06 12:41:33,391 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:41:33,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix025_pso.opt_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:41:33,393 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:41:33,447 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:41:33,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2025-02-06 12:41:33,487 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-02-06 12:41:33,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:41:33,491 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 81 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-02-06 12:41:33,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2025-02-06 12:41:33,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2025-02-06 12:41:33,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:41:33,508 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;@1acff6c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:41:33,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:41:33,516 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:41:33,517 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 12:41:33,517 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:41:33,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:33,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:41:33,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:33,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1776971531, now seen corresponding path program 1 times [2025-02-06 12:41:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:41:33,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41602926] [2025-02-06 12:41:33,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:33,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:33,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:33,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:41:33,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:41:33,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:41:33,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:41:33,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:33,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:33,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:41:33,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:41:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:33,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:41:33,656 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:41:33,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41602926] [2025-02-06 12:41:33,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41602926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:33,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:33,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:41:33,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091472774] [2025-02-06 12:41:33,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:33,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:41:33,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:41:33,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:41:33,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:41:33,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:33,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:33,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:33,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:33,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:34,656 INFO L124 PetriNetUnfolderBase]: 6239/8983 cut-off events. [2025-02-06 12:41:34,656 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-06 12:41:34,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17918 conditions, 8983 events. 6239/8983 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 50132 event pairs, 689 based on Foata normal form. 498/9467 useless extension candidates. Maximal degree in co-relation 17907. Up to 7711 conditions per place. [2025-02-06 12:41:34,705 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-02-06 12:41:34,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 238 flow [2025-02-06 12:41:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:41:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:41:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-06 12:41:34,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2025-02-06 12:41:34,716 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 88 transitions. [2025-02-06 12:41:34,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 238 flow [2025-02-06 12:41:34,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:41:34,721 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-02-06 12:41:34,723 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-02-06 12:41:34,726 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-02-06 12:41:34,726 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-02-06 12:41:34,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:41:34,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:34,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:41:34,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 12:41:34,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:34,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:34,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1204050998, now seen corresponding path program 1 times [2025-02-06 12:41:34,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:41:34,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716526427] [2025-02-06 12:41:34,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:34,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:34,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:34,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:41:34,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:41:35,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:41:35,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:41:35,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:35,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:35,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:41:35,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:41:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:35,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:41:35,057 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:41:35,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716526427] [2025-02-06 12:41:35,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716526427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:35,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:35,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:41:35,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491624842] [2025-02-06 12:41:35,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:35,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:41:35,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:41:35,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:41:35,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:41:35,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-02-06 12:41:35,061 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-02-06 12:41:35,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:35,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-02-06 12:41:35,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:35,699 INFO L124 PetriNetUnfolderBase]: 5603/8579 cut-off events. [2025-02-06 12:41:35,700 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-02-06 12:41:35,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17015 conditions, 8579 events. 5603/8579 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 50608 event pairs, 5603 based on Foata normal form. 252/8782 useless extension candidates. Maximal degree in co-relation 17005. Up to 7956 conditions per place. [2025-02-06 12:41:35,734 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-02-06 12:41:35,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 142 flow [2025-02-06 12:41:35,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:41:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:41:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-06 12:41:35,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-02-06 12:41:35,737 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 58 transitions. [2025-02-06 12:41:35,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 142 flow [2025-02-06 12:41:35,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:41:35,739 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2025-02-06 12:41:35,739 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-02-06 12:41:35,739 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-02-06 12:41:35,739 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2025-02-06 12:41:35,741 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-02-06 12:41:35,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:35,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:41:35,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:41:35,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:35,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:35,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1204051425, now seen corresponding path program 1 times [2025-02-06 12:41:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:41:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013376639] [2025-02-06 12:41:35,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:35,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:35,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:35,950 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:41:35,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:41:36,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:41:36,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:41:36,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:36,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:36,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:41:36,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:41:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:36,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:41:36,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:41:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013376639] [2025-02-06 12:41:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013376639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:36,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:41:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511974549] [2025-02-06 12:41:36,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:36,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:41:36,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:41:36,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:41:36,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:41:36,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:36,062 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-02-06 12:41:36,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:36,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:36,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:36,561 INFO L124 PetriNetUnfolderBase]: 3991/6391 cut-off events. [2025-02-06 12:41:36,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:41:36,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12345 conditions, 6391 events. 3991/6391 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 38550 event pairs, 645 based on Foata normal form. 252/6632 useless extension candidates. Maximal degree in co-relation 12339. Up to 3409 conditions per place. [2025-02-06 12:41:36,587 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 58 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2025-02-06 12:41:36,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 280 flow [2025-02-06 12:41:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:41:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:41:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-02-06 12:41:36,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-02-06 12:41:36,588 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 106 transitions. [2025-02-06 12:41:36,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 280 flow [2025-02-06 12:41:36,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:41:36,590 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2025-02-06 12:41:36,590 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-02-06 12:41:36,590 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-02-06 12:41:36,590 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2025-02-06 12:41:36,590 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-02-06 12:41:36,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:36,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:41:36,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:41:36,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:36,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:36,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:36,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1189938033, now seen corresponding path program 1 times [2025-02-06 12:41:36,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:41:36,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123814535] [2025-02-06 12:41:36,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:36,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:36,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:36,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:41:36,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:41:36,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:41:36,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:41:36,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:36,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:36,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:41:36,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:41:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:36,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:41:36,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:41:36,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123814535] [2025-02-06 12:41:36,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123814535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:36,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:36,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:41:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492291406] [2025-02-06 12:41:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:36,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:41:36,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:41:36,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:41:36,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:41:36,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:36,946 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-02-06 12:41:36,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:36,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:36,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:37,398 INFO L124 PetriNetUnfolderBase]: 2183/3495 cut-off events. [2025-02-06 12:41:37,398 INFO L125 PetriNetUnfolderBase]: For 736/736 co-relation queries the response was YES. [2025-02-06 12:41:37,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7888 conditions, 3495 events. 2183/3495 cut-off events. For 736/736 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 18073 event pairs, 411 based on Foata normal form. 172/3656 useless extension candidates. Maximal degree in co-relation 7879. Up to 1116 conditions per place. [2025-02-06 12:41:37,412 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 74 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2025-02-06 12:41:37,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 400 flow [2025-02-06 12:41:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:41:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:41:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-02-06 12:41:37,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-06 12:41:37,416 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 135 transitions. [2025-02-06 12:41:37,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 400 flow [2025-02-06 12:41:37,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:41:37,419 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2025-02-06 12:41:37,419 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-02-06 12:41:37,419 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-02-06 12:41:37,419 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2025-02-06 12:41:37,419 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-02-06 12:41:37,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:37,421 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-02-06 12:41:37,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:41:37,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:37,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:37,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2037015085, now seen corresponding path program 1 times [2025-02-06 12:41:37,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:41:37,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735333532] [2025-02-06 12:41:37,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:37,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:37,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:37,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:41:37,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:41:37,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:41:37,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:41:37,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:37,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:37,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:41:37,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:41:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:37,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:41:37,760 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:41:37,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735333532] [2025-02-06 12:41:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735333532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:37,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:37,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:41:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614041383] [2025-02-06 12:41:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:37,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:41:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:41:37,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:41:37,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:41:37,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:37,762 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-02-06 12:41:37,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:37,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:37,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:38,030 INFO L124 PetriNetUnfolderBase]: 1331/2063 cut-off events. [2025-02-06 12:41:38,031 INFO L125 PetriNetUnfolderBase]: For 1354/1354 co-relation queries the response was YES. [2025-02-06 12:41:38,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5128 conditions, 2063 events. 1331/2063 cut-off events. For 1354/1354 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9252 event pairs, 369 based on Foata normal form. 60/2112 useless extension candidates. Maximal degree in co-relation 5117. Up to 776 conditions per place. [2025-02-06 12:41:38,039 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 62 selfloop transitions, 11 changer transitions 1/80 dead transitions. [2025-02-06 12:41:38,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 387 flow [2025-02-06 12:41:38,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:41:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:41:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-02-06 12:41:38,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-02-06 12:41:38,042 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 136 transitions. [2025-02-06 12:41:38,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 387 flow [2025-02-06 12:41:38,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 362 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 12:41:38,053 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2025-02-06 12:41:38,053 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-02-06 12:41:38,054 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-02-06 12:41:38,055 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2025-02-06 12:41:38,055 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-02-06 12:41:38,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:38,055 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-02-06 12:41:38,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:41:38,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:38,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:38,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash 242212390, now seen corresponding path program 1 times [2025-02-06 12:41:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:41:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896108124] [2025-02-06 12:41:38,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:41:38,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:38,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:38,261 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:41:38,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:41:38,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:41:38,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:41:38,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:38,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:38,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:41:38,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:41:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:38,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:41:38,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:41:38,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896108124] [2025-02-06 12:41:38,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896108124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:38,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:38,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:41:38,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136291667] [2025-02-06 12:41:38,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:38,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:41:38,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:41:38,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:41:38,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:41:38,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:38,496 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-02-06 12:41:38,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:38,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:38,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:38,906 INFO L124 PetriNetUnfolderBase]: 1735/2688 cut-off events. [2025-02-06 12:41:38,906 INFO L125 PetriNetUnfolderBase]: For 1864/1864 co-relation queries the response was YES. [2025-02-06 12:41:38,912 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 113. Compared 12797 event pairs, 245 based on Foata normal form. 8/2693 useless extension candidates. Maximal degree in co-relation 6810. Up to 1317 conditions per place. [2025-02-06 12:41:38,917 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 56 selfloop transitions, 7 changer transitions 41/110 dead transitions. [2025-02-06 12:41:38,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 110 transitions, 603 flow [2025-02-06 12:41:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:41:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:41:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2025-02-06 12:41:38,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-02-06 12:41:38,919 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 9 states and 189 transitions. [2025-02-06 12:41:38,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 110 transitions, 603 flow [2025-02-06 12:41:38,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 110 transitions, 486 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:41:38,929 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 153 flow [2025-02-06 12:41:38,929 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-02-06 12:41:38,930 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-02-06 12:41:38,930 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 153 flow [2025-02-06 12:41:38,930 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-02-06 12:41:38,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:38,930 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-02-06 12:41:38,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 12:41:39,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:39,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:39,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:39,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2049363192, now seen corresponding path program 2 times [2025-02-06 12:41:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:41:39,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1505854398] [2025-02-06 12:41:39,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:41:39,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:39,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:39,139 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:41:39,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:41:39,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:41:39,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:41:39,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:41:39,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:39,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:41:39,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:41:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:39,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:41:39,344 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:41:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505854398] [2025-02-06 12:41:39,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505854398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:39,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:39,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:41:39,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736080370] [2025-02-06 12:41:39,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:39,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:41:39,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:41:39,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:41:39,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:41:39,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:39,356 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-02-06 12:41:39,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:39,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:39,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:39,642 INFO L124 PetriNetUnfolderBase]: 1799/2807 cut-off events. [2025-02-06 12:41:39,642 INFO L125 PetriNetUnfolderBase]: For 814/814 co-relation queries the response was YES. [2025-02-06 12:41:39,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6843 conditions, 2807 events. 1799/2807 cut-off events. For 814/814 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13615 event pairs, 363 based on Foata normal form. 8/2804 useless extension candidates. Maximal degree in co-relation 6829. Up to 1109 conditions per place. [2025-02-06 12:41:39,654 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 60 selfloop transitions, 13 changer transitions 29/108 dead transitions. [2025-02-06 12:41:39,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 108 transitions, 549 flow [2025-02-06 12:41:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:41:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:41:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2025-02-06 12:41:39,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2025-02-06 12:41:39,655 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 153 flow. Second operand 8 states and 173 transitions. [2025-02-06 12:41:39,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 108 transitions, 549 flow [2025-02-06 12:41:39,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 108 transitions, 513 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-06 12:41:39,658 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 191 flow [2025-02-06 12:41:39,658 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=191, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2025-02-06 12:41:39,658 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-02-06 12:41:39,658 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 191 flow [2025-02-06 12:41:39,658 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-02-06 12:41:39,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:39,659 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-02-06 12:41:39,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:41:39,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:39,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:39,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:39,860 INFO L85 PathProgramCache]: Analyzing trace with hash -152176176, now seen corresponding path program 3 times [2025-02-06 12:41:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:41:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313678391] [2025-02-06 12:41:39,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:41:39,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:39,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:39,863 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:41:39,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:41:39,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:41:39,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:41:39,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:41:39,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:39,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 12:41:39,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:41:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:40,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:41:40,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:41:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313678391] [2025-02-06 12:41:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313678391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:41:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484626346] [2025-02-06 12:41:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:40,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:41:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:41:40,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:41:40,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:41:40,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:40,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 191 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-02-06 12:41:40,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:40,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:40,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:40,473 INFO L124 PetriNetUnfolderBase]: 1263/2027 cut-off events. [2025-02-06 12:41:40,474 INFO L125 PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES. [2025-02-06 12:41:40,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5135 conditions, 2027 events. 1263/2027 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9002 event pairs, 265 based on Foata normal form. 8/2032 useless extension candidates. Maximal degree in co-relation 5121. Up to 626 conditions per place. [2025-02-06 12:41:40,480 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 66 selfloop transitions, 5 changer transitions 46/123 dead transitions. [2025-02-06 12:41:40,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 123 transitions, 693 flow [2025-02-06 12:41:40,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:41:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:41:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2025-02-06 12:41:40,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41555555555555557 [2025-02-06 12:41:40,482 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 191 flow. Second operand 10 states and 187 transitions. [2025-02-06 12:41:40,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 123 transitions, 693 flow [2025-02-06 12:41:40,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 123 transitions, 669 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-06 12:41:40,485 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 209 flow [2025-02-06 12:41:40,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=209, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2025-02-06 12:41:40,485 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2025-02-06 12:41:40,485 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 209 flow [2025-02-06 12:41:40,486 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-02-06 12:41:40,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:40,486 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-02-06 12:41:40,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 12:41:40,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:40,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:40,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1927510118, now seen corresponding path program 4 times [2025-02-06 12:41:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:41:40,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1681140881] [2025-02-06 12:41:40,691 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:41:40,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:40,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:40,693 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:41:40,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:41:40,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-06 12:41:40,752 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-02-06 12:41:40,752 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 12:41:40,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:41:40,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 12:41:40,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:41:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:41:40,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:41:40,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:41:40,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681140881] [2025-02-06 12:41:40,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681140881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:41:40,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:41:40,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:41:40,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687705833] [2025-02-06 12:41:40,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:41:40,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:41:40,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:41:40,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:41:40,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:41:40,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-02-06 12:41:40,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 209 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-02-06 12:41:40,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:41:40,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-02-06 12:41:40,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:41:41,399 INFO L124 PetriNetUnfolderBase]: 1545/2529 cut-off events. [2025-02-06 12:41:41,399 INFO L125 PetriNetUnfolderBase]: For 1090/1090 co-relation queries the response was YES. [2025-02-06 12:41:41,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6719 conditions, 2529 events. 1545/2529 cut-off events. For 1090/1090 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 12110 event pairs, 589 based on Foata normal form. 8/2532 useless extension candidates. Maximal degree in co-relation 6701. Up to 1097 conditions per place. [2025-02-06 12:41:41,409 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 85 selfloop transitions, 4 changer transitions 35/130 dead transitions. [2025-02-06 12:41:41,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 130 transitions, 759 flow [2025-02-06 12:41:41,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:41:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:41:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2025-02-06 12:41:41,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-02-06 12:41:41,411 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 209 flow. Second operand 8 states and 168 transitions. [2025-02-06 12:41:41,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 130 transitions, 759 flow [2025-02-06 12:41:41,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 130 transitions, 730 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-02-06 12:41:41,414 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 232 flow [2025-02-06 12:41:41,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=232, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2025-02-06 12:41:41,415 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2025-02-06 12:41:41,415 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 232 flow [2025-02-06 12:41:41,415 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-02-06 12:41:41,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:41:41,415 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-02-06 12:41:41,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 12:41:41,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:41,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:41:41,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:41:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1835205236, now seen corresponding path program 5 times [2025-02-06 12:41:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:41:41,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625824751] [2025-02-06 12:41:41,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:41:41,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:41,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:41:41,627 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:41:41,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:41:41,698 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:41:41,716 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:41:41,716 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:41:41,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:41:41,717 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:41:41,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 12:41:41,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 12:41:41,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:41:41,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:41:41,799 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:41:41,802 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:41:41,803 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 12:41:41,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:41:41,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:41:41,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:41:41,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-06 12:41:41,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-06 12:41:41,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:41:41,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 12:41:42,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:41:42,006 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-02-06 12:41:42,079 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:41:42,079 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:41:42,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:41:42 BasicIcfg [2025-02-06 12:41:42,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:41:42,084 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:41:42,084 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:41:42,084 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:41:42,085 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:41:33" (3/4) ... [2025-02-06 12:41:42,086 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:41:42,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:41:42,088 INFO L158 Benchmark]: Toolchain (without parser) took 9801.11ms. Allocated memory was 83.9MB in the beginning and 620.8MB in the end (delta: 536.9MB). Free memory was 57.9MB in the beginning and 347.6MB in the end (delta: -289.7MB). Peak memory consumption was 248.4MB. Max. memory is 16.1GB. [2025-02-06 12:41:42,089 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 63.3MB in the beginning and 63.3MB in the end (delta: 35.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:41:42,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.82ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 33.7MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:41:42,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.46ms. Allocated memory is still 83.9MB. Free memory was 33.7MB in the beginning and 31.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:41:42,089 INFO L158 Benchmark]: Boogie Preprocessor took 51.49ms. Allocated memory is still 83.9MB. Free memory was 31.4MB in the beginning and 28.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:41:42,089 INFO L158 Benchmark]: IcfgBuilder took 637.69ms. Allocated memory is still 83.9MB. Free memory was 28.7MB in the beginning and 29.5MB in the end (delta: -771.3kB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2025-02-06 12:41:42,090 INFO L158 Benchmark]: TraceAbstraction took 8709.64ms. Allocated memory was 83.9MB in the beginning and 620.8MB in the end (delta: 536.9MB). Free memory was 29.0MB in the beginning and 347.7MB in the end (delta: -318.7MB). Peak memory consumption was 217.0MB. Max. memory is 16.1GB. [2025-02-06 12:41:42,090 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 620.8MB. Free memory was 347.7MB in the beginning and 347.6MB in the end (delta: 58.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:41:42,091 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.14ms. Allocated memory is still 83.9MB. Free memory was 63.3MB in the beginning and 63.3MB in the end (delta: 35.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.82ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 33.7MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.46ms. Allocated memory is still 83.9MB. Free memory was 33.7MB in the beginning and 31.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.49ms. Allocated memory is still 83.9MB. Free memory was 31.4MB in the beginning and 28.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 637.69ms. Allocated memory is still 83.9MB. Free memory was 28.7MB in the beginning and 29.5MB in the end (delta: -771.3kB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8709.64ms. Allocated memory was 83.9MB in the beginning and 620.8MB in the end (delta: 536.9MB). Free memory was 29.0MB in the beginning and 347.7MB in the end (delta: -318.7MB). Peak memory consumption was 217.0MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 620.8MB. Free memory was 347.7MB in the beginning and 347.6MB in the end (delta: 58.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t666; [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] 0 pthread_t t667; [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, t667=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] 0 pthread_t t668; [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L746] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L18] 0 __assert_fail ("0", "mix025_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 839]: 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: 835]: 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: 8.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 535 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 526 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2005 IncrementalHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 6 mSDtfsCounter, 2005 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=9, InterpolantAutomatonStates: 56, 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.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 236 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 887 SizeOfPredicates, 28 NumberOfNonLiveVariables, 910 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:41:42,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample