./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:10:12,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:10:12,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:10:12,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:10:12,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:10:12,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:10:12,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:10:12,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:10:12,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:10:12,388 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:10:12,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:10:12,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:10:12,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:10:12,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:10:12,390 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:10:12,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:10:12,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:10:12,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:10:12,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:10:12,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:10:12,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:10:12,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:10:12,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:10:12,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:10:12,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:10:12,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:10:12,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:10:12,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:10:12,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:10:12,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:10:12,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:10:12,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:10:12,393 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2025-03-17 14:10:12,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:10:12,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:10:12,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:10:12,645 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:10:12,646 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:10:12,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-03-17 14:10:13,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46352fa64/fbc40b72bd384ed5be77d4f6ef467e60/FLAGe26ade24e [2025-03-17 14:10:14,109 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:10:14,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-03-17 14:10:14,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46352fa64/fbc40b72bd384ed5be77d4f6ef467e60/FLAGe26ade24e [2025-03-17 14:10:14,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46352fa64/fbc40b72bd384ed5be77d4f6ef467e60 [2025-03-17 14:10:14,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:10:14,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:10:14,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:10:14,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:10:14,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:10:14,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691524d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14, skipping insertion in model container [2025-03-17 14:10:14,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:10:14,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:10:14,440 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:10:14,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:10:14,529 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:10:14,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14 WrapperNode [2025-03-17 14:10:14,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:10:14,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:10:14,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:10:14,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:10:14,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,561 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2025-03-17 14:10:14,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:10:14,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:10:14,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:10:14,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:10:14,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,582 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:10:14,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:10:14,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:10:14,596 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:10:14,596 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:10:14,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (1/1) ... [2025-03-17 14:10:14,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:10:14,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:14,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:10:14,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:10:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:10:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:10:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:10:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:10:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:10:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:10:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 14:10:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 14:10:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:10:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:10:14,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:10:14,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:10:14,643 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:10:14,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:10:14,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:10:14,985 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:10:14,985 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:10:15,164 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:10:15,165 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:10:15,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:10:15 BoogieIcfgContainer [2025-03-17 14:10:15,166 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:10:15,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:10:15,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:10:15,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:10:15,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:10:14" (1/3) ... [2025-03-17 14:10:15,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc0fe32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:10:15, skipping insertion in model container [2025-03-17 14:10:15,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:14" (2/3) ... [2025-03-17 14:10:15,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc0fe32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:10:15, skipping insertion in model container [2025-03-17 14:10:15,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:10:15" (3/3) ... [2025-03-17 14:10:15,175 INFO L128 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-03-17 14:10:15,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:10:15,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-17 14:10:15,209 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:10:15,250 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:10:15,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2025-03-17 14:10:15,300 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-03-17 14:10:15,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:10:15,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-03-17 14:10:15,307 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2025-03-17 14:10:15,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2025-03-17 14:10:15,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:10:15,326 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;@6610c76c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:10:15,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 14:10:15,331 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:10:15,331 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-17 14:10:15,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:10:15,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:15,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:10:15,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:10:15,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1897631007, now seen corresponding path program 1 times [2025-03-17 14:10:15,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:15,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491411341] [2025-03-17 14:10:15,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:15,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:10:15,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:10:15,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:15,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:15,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491411341] [2025-03-17 14:10:15,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491411341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:15,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:15,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:10:15,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141942298] [2025-03-17 14:10:15,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:15,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:10:15,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:15,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:10:15,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:10:15,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:15,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 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-03-17 14:10:15,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:15,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:15,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:16,630 INFO L124 PetriNetUnfolderBase]: 5315/7699 cut-off events. [2025-03-17 14:10:16,631 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-17 14:10:16,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15350 conditions, 7699 events. 5315/7699 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 42906 event pairs, 585 based on Foata normal form. 432/8119 useless extension candidates. Maximal degree in co-relation 15339. Up to 6591 conditions per place. [2025-03-17 14:10:16,671 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-03-17 14:10:16,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 230 flow [2025-03-17 14:10:16,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:10:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:10:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-17 14:10:16,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-17 14:10:16,682 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 86 transitions. [2025-03-17 14:10:16,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 230 flow [2025-03-17 14:10:16,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:10:16,686 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-03-17 14:10:16,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-17 14:10:16,690 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-03-17 14:10:16,690 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-03-17 14:10:16,690 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-03-17 14:10:16,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:16,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:16,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:10:16,692 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-03-17 14:10:16,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash -651707563, now seen corresponding path program 1 times [2025-03-17 14:10:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:16,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88852875] [2025-03-17 14:10:16,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:16,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:10:16,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:10:16,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:16,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:16,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:16,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88852875] [2025-03-17 14:10:16,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88852875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:16,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:16,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:10:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187402243] [2025-03-17 14:10:16,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:16,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:10:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:16,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:10:16,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:10:16,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:16,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:16,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:16,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:16,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:17,385 INFO L124 PetriNetUnfolderBase]: 4775/7427 cut-off events. [2025-03-17 14:10:17,385 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-03-17 14:10:17,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14657 conditions, 7427 events. 4775/7427 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43908 event pairs, 4775 based on Foata normal form. 216/7592 useless extension candidates. Maximal degree in co-relation 14647. Up to 6804 conditions per place. [2025-03-17 14:10:17,417 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-03-17 14:10:17,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 138 flow [2025-03-17 14:10:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:10:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:10:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-17 14:10:17,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-17 14:10:17,418 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 57 transitions. [2025-03-17 14:10:17,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 138 flow [2025-03-17 14:10:17,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:10:17,420 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-03-17 14:10:17,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-03-17 14:10:17,420 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-03-17 14:10:17,420 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-03-17 14:10:17,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:17,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:17,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:17,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:10:17,421 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-03-17 14:10:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash -651707251, now seen corresponding path program 1 times [2025-03-17 14:10:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732453113] [2025-03-17 14:10:17,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:17,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:10:17,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:10:17,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:17,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:17,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:17,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732453113] [2025-03-17 14:10:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732453113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:17,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:17,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:10:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173017836] [2025-03-17 14:10:17,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:17,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:10:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:17,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:10:17,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:10:17,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:17,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:17,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:17,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:17,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:18,496 INFO L124 PetriNetUnfolderBase]: 5931/8907 cut-off events. [2025-03-17 14:10:18,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:10:18,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17509 conditions, 8907 events. 5931/8907 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 51667 event pairs, 1535 based on Foata normal form. 0/8704 useless extension candidates. Maximal degree in co-relation 17503. Up to 5377 conditions per place. [2025-03-17 14:10:18,526 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 40 selfloop transitions, 3 changer transitions 69/117 dead transitions. [2025-03-17 14:10:18,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 117 transitions, 468 flow [2025-03-17 14:10:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:10:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:10:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-03-17 14:10:18,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284090909090909 [2025-03-17 14:10:18,530 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 186 transitions. [2025-03-17 14:10:18,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 117 transitions, 468 flow [2025-03-17 14:10:18,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 117 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:10:18,532 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 108 flow [2025-03-17 14:10:18,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=108, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2025-03-17 14:10:18,532 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-03-17 14:10:18,532 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 108 flow [2025-03-17 14:10:18,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:18,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:18,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:18,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:10:18,533 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-03-17 14:10:18,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:18,533 INFO L85 PathProgramCache]: Analyzing trace with hash 216017059, now seen corresponding path program 1 times [2025-03-17 14:10:18,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:18,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078138210] [2025-03-17 14:10:18,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:18,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:18,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:10:18,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:10:18,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:18,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:18,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:18,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078138210] [2025-03-17 14:10:18,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078138210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:18,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:18,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:10:18,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529846261] [2025-03-17 14:10:18,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:18,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:18,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:18,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:18,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:18,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:18,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:18,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:18,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:18,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:19,953 INFO L124 PetriNetUnfolderBase]: 5744/8592 cut-off events. [2025-03-17 14:10:19,953 INFO L125 PetriNetUnfolderBase]: For 4520/4520 co-relation queries the response was YES. [2025-03-17 14:10:19,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20859 conditions, 8592 events. 5744/8592 cut-off events. For 4520/4520 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 49052 event pairs, 639 based on Foata normal form. 237/8826 useless extension candidates. Maximal degree in co-relation 20847. Up to 5171 conditions per place. [2025-03-17 14:10:19,990 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 61 selfloop transitions, 12 changer transitions 79/157 dead transitions. [2025-03-17 14:10:19,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 157 transitions, 776 flow [2025-03-17 14:10:19,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:10:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:10:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 240 transitions. [2025-03-17 14:10:19,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-17 14:10:19,994 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 108 flow. Second operand 10 states and 240 transitions. [2025-03-17 14:10:19,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 157 transitions, 776 flow [2025-03-17 14:10:20,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 157 transitions, 755 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-17 14:10:20,054 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 245 flow [2025-03-17 14:10:20,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=245, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-03-17 14:10:20,055 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-03-17 14:10:20,055 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 245 flow [2025-03-17 14:10:20,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:20,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:20,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] [2025-03-17 14:10:20,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:10:20,056 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-03-17 14:10:20,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:20,056 INFO L85 PathProgramCache]: Analyzing trace with hash -660567604, now seen corresponding path program 1 times [2025-03-17 14:10:20,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:20,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681725201] [2025-03-17 14:10:20,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:20,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:10:20,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:10:20,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:20,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681725201] [2025-03-17 14:10:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681725201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:20,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:10:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501621460] [2025-03-17 14:10:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:20,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:20,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:20,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:20,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:20,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:20,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:20,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:20,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:20,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:21,303 INFO L124 PetriNetUnfolderBase]: 6727/10000 cut-off events. [2025-03-17 14:10:21,304 INFO L125 PetriNetUnfolderBase]: For 19779/19779 co-relation queries the response was YES. [2025-03-17 14:10:21,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33429 conditions, 10000 events. 6727/10000 cut-off events. For 19779/19779 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 56308 event pairs, 1463 based on Foata normal form. 220/10219 useless extension candidates. Maximal degree in co-relation 33409. Up to 4173 conditions per place. [2025-03-17 14:10:21,342 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 61 selfloop transitions, 17 changer transitions 54/137 dead transitions. [2025-03-17 14:10:21,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 137 transitions, 941 flow [2025-03-17 14:10:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:10:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:10:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2025-03-17 14:10:21,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-03-17 14:10:21,344 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 245 flow. Second operand 8 states and 187 transitions. [2025-03-17 14:10:21,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 137 transitions, 941 flow [2025-03-17 14:10:21,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 137 transitions, 895 flow, removed 21 selfloop flow, removed 3 redundant places. [2025-03-17 14:10:21,402 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 358 flow [2025-03-17 14:10:21,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=358, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2025-03-17 14:10:21,403 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2025-03-17 14:10:21,403 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 358 flow [2025-03-17 14:10:21,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:21,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:21,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:21,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:10:21,404 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-03-17 14:10:21,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash -424795913, now seen corresponding path program 1 times [2025-03-17 14:10:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:21,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156844330] [2025-03-17 14:10:21,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:21,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:21,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:10:21,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:10:21,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:21,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156844330] [2025-03-17 14:10:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156844330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:21,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:21,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:10:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302487206] [2025-03-17 14:10:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:21,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:21,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:21,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:21,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:21,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:21,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:21,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:21,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:22,949 INFO L124 PetriNetUnfolderBase]: 9561/14358 cut-off events. [2025-03-17 14:10:22,949 INFO L125 PetriNetUnfolderBase]: For 35914/35923 co-relation queries the response was YES. [2025-03-17 14:10:22,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49287 conditions, 14358 events. 9561/14358 cut-off events. For 35914/35923 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 86717 event pairs, 1854 based on Foata normal form. 220/14567 useless extension candidates. Maximal degree in co-relation 49268. Up to 6830 conditions per place. [2025-03-17 14:10:22,994 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 57 selfloop transitions, 6 changer transitions 55/123 dead transitions. [2025-03-17 14:10:22,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 123 transitions, 971 flow [2025-03-17 14:10:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:10:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:10:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-03-17 14:10:22,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-17 14:10:22,999 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 358 flow. Second operand 6 states and 144 transitions. [2025-03-17 14:10:22,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 123 transitions, 971 flow [2025-03-17 14:10:23,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 123 transitions, 937 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-03-17 14:10:23,072 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 288 flow [2025-03-17 14:10:23,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-03-17 14:10:23,073 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2025-03-17 14:10:23,073 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 288 flow [2025-03-17 14:10:23,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:23,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:23,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:23,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:10:23,074 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-03-17 14:10:23,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash 443409719, now seen corresponding path program 2 times [2025-03-17 14:10:23,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:23,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309033535] [2025-03-17 14:10:23,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:10:23,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:23,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:10:23,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:10:23,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:10:23,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:23,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:23,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309033535] [2025-03-17 14:10:23,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309033535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:23,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:23,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:10:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695092782] [2025-03-17 14:10:23,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:23,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:23,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:23,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:23,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:23,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:23,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:23,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:23,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:24,041 INFO L124 PetriNetUnfolderBase]: 6355/9428 cut-off events. [2025-03-17 14:10:24,041 INFO L125 PetriNetUnfolderBase]: For 19725/19734 co-relation queries the response was YES. [2025-03-17 14:10:24,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31929 conditions, 9428 events. 6355/9428 cut-off events. For 19725/19734 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 52298 event pairs, 1891 based on Foata normal form. 220/9646 useless extension candidates. Maximal degree in co-relation 31911. Up to 4688 conditions per place. [2025-03-17 14:10:24,067 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 49 selfloop transitions, 4 changer transitions 47/105 dead transitions. [2025-03-17 14:10:24,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 105 transitions, 792 flow [2025-03-17 14:10:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:10:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:10:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-17 14:10:24,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-03-17 14:10:24,068 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 288 flow. Second operand 6 states and 135 transitions. [2025-03-17 14:10:24,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 105 transitions, 792 flow [2025-03-17 14:10:24,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 744 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-03-17 14:10:24,099 INFO L231 Difference]: Finished difference. Result has 68 places, 40 transitions, 218 flow [2025-03-17 14:10:24,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=68, PETRI_TRANSITIONS=40} [2025-03-17 14:10:24,101 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2025-03-17 14:10:24,101 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 40 transitions, 218 flow [2025-03-17 14:10:24,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:24,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:24,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:24,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:10:24,102 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-03-17 14:10:24,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2068589741, now seen corresponding path program 1 times [2025-03-17 14:10:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:24,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404879772] [2025-03-17 14:10:24,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:24,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:10:24,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:10:24,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:24,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:24,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:24,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404879772] [2025-03-17 14:10:24,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404879772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:24,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:24,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:10:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685548254] [2025-03-17 14:10:24,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:24,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:24,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:24,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:24,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:24,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:24,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 40 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:24,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:24,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:24,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:24,745 INFO L124 PetriNetUnfolderBase]: 3680/5529 cut-off events. [2025-03-17 14:10:24,745 INFO L125 PetriNetUnfolderBase]: For 10392/10397 co-relation queries the response was YES. [2025-03-17 14:10:24,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18096 conditions, 5529 events. 3680/5529 cut-off events. For 10392/10397 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 27511 event pairs, 1136 based on Foata normal form. 81/5610 useless extension candidates. Maximal degree in co-relation 18078. Up to 2340 conditions per place. [2025-03-17 14:10:24,764 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 37 selfloop transitions, 2 changer transitions 56/100 dead transitions. [2025-03-17 14:10:24,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 648 flow [2025-03-17 14:10:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:10:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:10:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2025-03-17 14:10:24,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967532467532468 [2025-03-17 14:10:24,765 INFO L175 Difference]: Start difference. First operand has 68 places, 40 transitions, 218 flow. Second operand 7 states and 153 transitions. [2025-03-17 14:10:24,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 648 flow [2025-03-17 14:10:24,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 590 flow, removed 14 selfloop flow, removed 12 redundant places. [2025-03-17 14:10:24,786 INFO L231 Difference]: Finished difference. Result has 64 places, 35 transitions, 153 flow [2025-03-17 14:10:24,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=64, PETRI_TRANSITIONS=35} [2025-03-17 14:10:24,787 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2025-03-17 14:10:24,787 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 35 transitions, 153 flow [2025-03-17 14:10:24,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:24,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:24,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:24,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:10:24,787 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-03-17 14:10:24,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash 243833253, now seen corresponding path program 2 times [2025-03-17 14:10:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:24,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951908543] [2025-03-17 14:10:24,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:10:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:24,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:10:24,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:10:24,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:10:24,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:25,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:25,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951908543] [2025-03-17 14:10:25,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951908543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:25,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:25,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:10:25,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826517729] [2025-03-17 14:10:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:25,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:10:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:25,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:10:25,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:10:25,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:25,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 35 transitions, 153 flow. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:25,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:25,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:25,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:25,845 INFO L124 PetriNetUnfolderBase]: 1962/3081 cut-off events. [2025-03-17 14:10:25,845 INFO L125 PetriNetUnfolderBase]: For 4726/4726 co-relation queries the response was YES. [2025-03-17 14:10:25,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9457 conditions, 3081 events. 1962/3081 cut-off events. For 4726/4726 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14841 event pairs, 984 based on Foata normal form. 80/3161 useless extension candidates. Maximal degree in co-relation 9442. Up to 2366 conditions per place. [2025-03-17 14:10:25,856 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 45 selfloop transitions, 12 changer transitions 37/99 dead transitions. [2025-03-17 14:10:25,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 666 flow [2025-03-17 14:10:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:10:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:10:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2025-03-17 14:10:25,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40289256198347106 [2025-03-17 14:10:25,858 INFO L175 Difference]: Start difference. First operand has 64 places, 35 transitions, 153 flow. Second operand 11 states and 195 transitions. [2025-03-17 14:10:25,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 666 flow [2025-03-17 14:10:25,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 625 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-17 14:10:25,867 INFO L231 Difference]: Finished difference. Result has 71 places, 44 transitions, 278 flow [2025-03-17 14:10:25,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=278, PETRI_PLACES=71, PETRI_TRANSITIONS=44} [2025-03-17 14:10:25,867 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2025-03-17 14:10:25,868 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 44 transitions, 278 flow [2025-03-17 14:10:25,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:25,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:25,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:25,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:10:25,868 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-03-17 14:10:25,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:25,869 INFO L85 PathProgramCache]: Analyzing trace with hash -254312998, now seen corresponding path program 1 times [2025-03-17 14:10:25,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:25,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034055875] [2025-03-17 14:10:25,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:25,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:25,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:10:25,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:10:25,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:25,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034055875] [2025-03-17 14:10:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034055875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:10:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425009676] [2025-03-17 14:10:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:25,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:10:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:25,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:10:25,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:10:25,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:25,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 44 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-03-17 14:10:25,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:25,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:25,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:26,218 INFO L124 PetriNetUnfolderBase]: 1550/2494 cut-off events. [2025-03-17 14:10:26,218 INFO L125 PetriNetUnfolderBase]: For 7477/7479 co-relation queries the response was YES. [2025-03-17 14:10:26,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8876 conditions, 2494 events. 1550/2494 cut-off events. For 7477/7479 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 12250 event pairs, 152 based on Foata normal form. 109/2603 useless extension candidates. Maximal degree in co-relation 8858. Up to 1462 conditions per place. [2025-03-17 14:10:26,228 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 60 selfloop transitions, 5 changer transitions 1/71 dead transitions. [2025-03-17 14:10:26,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 591 flow [2025-03-17 14:10:26,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:10:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:10:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-03-17 14:10:26,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5511363636363636 [2025-03-17 14:10:26,229 INFO L175 Difference]: Start difference. First operand has 71 places, 44 transitions, 278 flow. Second operand 4 states and 97 transitions. [2025-03-17 14:10:26,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 591 flow [2025-03-17 14:10:26,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 523 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-03-17 14:10:26,238 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 255 flow [2025-03-17 14:10:26,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-03-17 14:10:26,239 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-03-17 14:10:26,239 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 255 flow [2025-03-17 14:10:26,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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-03-17 14:10:26,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:26,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:26,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:10:26,240 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-03-17 14:10:26,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1144207888, now seen corresponding path program 1 times [2025-03-17 14:10:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:26,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594355782] [2025-03-17 14:10:26,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:26,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:10:26,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:10:26,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:26,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:26,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:26,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594355782] [2025-03-17 14:10:26,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594355782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:26,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:26,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:10:26,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496448301] [2025-03-17 14:10:26,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:26,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:10:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:26,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:10:26,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:10:26,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:26,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:26,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:26,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:26,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:26,558 INFO L124 PetriNetUnfolderBase]: 969/1592 cut-off events. [2025-03-17 14:10:26,558 INFO L125 PetriNetUnfolderBase]: For 3569/3571 co-relation queries the response was YES. [2025-03-17 14:10:26,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5584 conditions, 1592 events. 969/1592 cut-off events. For 3569/3571 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6965 event pairs, 75 based on Foata normal form. 86/1678 useless extension candidates. Maximal degree in co-relation 5567. Up to 661 conditions per place. [2025-03-17 14:10:26,563 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 65 selfloop transitions, 8 changer transitions 1/79 dead transitions. [2025-03-17 14:10:26,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 611 flow [2025-03-17 14:10:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:10:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:10:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-03-17 14:10:26,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-03-17 14:10:26,564 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 255 flow. Second operand 5 states and 117 transitions. [2025-03-17 14:10:26,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 611 flow [2025-03-17 14:10:26,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 601 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:10:26,566 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 289 flow [2025-03-17 14:10:26,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2025-03-17 14:10:26,567 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2025-03-17 14:10:26,567 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 289 flow [2025-03-17 14:10:26,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:26,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:26,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:26,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:10:26,568 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-03-17 14:10:26,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1043338661, now seen corresponding path program 1 times [2025-03-17 14:10:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:26,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328278831] [2025-03-17 14:10:26,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:26,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:10:26,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:10:26,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:26,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:26,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:26,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328278831] [2025-03-17 14:10:26,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328278831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:26,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:10:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057151150] [2025-03-17 14:10:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:26,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:26,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:26,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:26,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:26,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:26,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:26,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:26,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:26,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:26,873 INFO L124 PetriNetUnfolderBase]: 532/873 cut-off events. [2025-03-17 14:10:26,873 INFO L125 PetriNetUnfolderBase]: For 2558/2560 co-relation queries the response was YES. [2025-03-17 14:10:26,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 873 events. 532/873 cut-off events. For 2558/2560 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3169 event pairs, 56 based on Foata normal form. 40/913 useless extension candidates. Maximal degree in co-relation 3234. Up to 284 conditions per place. [2025-03-17 14:10:26,877 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 58 selfloop transitions, 11 changer transitions 1/75 dead transitions. [2025-03-17 14:10:26,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 582 flow [2025-03-17 14:10:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:10:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:10:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-03-17 14:10:26,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2025-03-17 14:10:26,878 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 289 flow. Second operand 6 states and 123 transitions. [2025-03-17 14:10:26,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 582 flow [2025-03-17 14:10:26,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 511 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-03-17 14:10:26,882 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 271 flow [2025-03-17 14:10:26,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2025-03-17 14:10:26,883 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2025-03-17 14:10:26,883 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 271 flow [2025-03-17 14:10:26,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:26,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:26,883 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] [2025-03-17 14:10:26,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:10:26,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:10:26,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash 90621473, now seen corresponding path program 1 times [2025-03-17 14:10:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:26,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896627547] [2025-03-17 14:10:26,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:26,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:26,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:26,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:26,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:27,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:10:27,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896627547] [2025-03-17 14:10:27,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896627547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:27,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:27,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:10:27,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259760218] [2025-03-17 14:10:27,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:27,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:10:27,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:10:27,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:10:27,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:10:27,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:27,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 271 flow. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:27,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:27,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:27,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:28,335 INFO L124 PetriNetUnfolderBase]: 717/1171 cut-off events. [2025-03-17 14:10:28,335 INFO L125 PetriNetUnfolderBase]: For 2814/2814 co-relation queries the response was YES. [2025-03-17 14:10:28,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4138 conditions, 1171 events. 717/1171 cut-off events. For 2814/2814 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4555 event pairs, 136 based on Foata normal form. 8/1179 useless extension candidates. Maximal degree in co-relation 4123. Up to 481 conditions per place. [2025-03-17 14:10:28,338 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 41 selfloop transitions, 4 changer transitions 52/102 dead transitions. [2025-03-17 14:10:28,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 102 transitions, 767 flow [2025-03-17 14:10:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:10:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:10:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2025-03-17 14:10:28,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39646464646464646 [2025-03-17 14:10:28,339 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 271 flow. Second operand 9 states and 157 transitions. [2025-03-17 14:10:28,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 102 transitions, 767 flow [2025-03-17 14:10:28,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 570 flow, removed 46 selfloop flow, removed 10 redundant places. [2025-03-17 14:10:28,343 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 192 flow [2025-03-17 14:10:28,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2025-03-17 14:10:28,344 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2025-03-17 14:10:28,344 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 192 flow [2025-03-17 14:10:28,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:28,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:28,344 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] [2025-03-17 14:10:28,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:10:28,344 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:10:28,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:28,345 INFO L85 PathProgramCache]: Analyzing trace with hash -314164285, now seen corresponding path program 2 times [2025-03-17 14:10:28,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:10:28,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131505430] [2025-03-17 14:10:28,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:10:28,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:10:28,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:28,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:28,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:10:28,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:10:28,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:10:28,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:28,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:28,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:28,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:10:28,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:10:28,454 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:10:28,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-17 14:10:28,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-17 14:10:28,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-17 14:10:28,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-17 14:10:28,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-17 14:10:28,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-17 14:10:28,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-17 14:10:28,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:10:28,457 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:28,527 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:10:28,527 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:10:28,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:10:28 BasicIcfg [2025-03-17 14:10:28,532 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:10:28,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:10:28,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:10:28,532 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:10:28,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:10:15" (3/4) ... [2025-03-17 14:10:28,534 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:10:28,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:10:28,535 INFO L158 Benchmark]: Toolchain (without parser) took 14390.58ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 121.2MB in the beginning and 429.2MB in the end (delta: -308.0MB). Peak memory consumption was 614.9MB. Max. memory is 16.1GB. [2025-03-17 14:10:28,535 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:28,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.57ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 98.1MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:10:28,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.63ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 95.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:28,536 INFO L158 Benchmark]: Boogie Preprocessor took 33.47ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 92.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:28,536 INFO L158 Benchmark]: IcfgBuilder took 570.10ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 35.6MB in the end (delta: 57.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-17 14:10:28,536 INFO L158 Benchmark]: TraceAbstraction took 13363.84ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 35.2MB in the beginning and 429.4MB in the end (delta: -394.2MB). Peak memory consumption was 531.0MB. Max. memory is 16.1GB. [2025-03-17 14:10:28,536 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 1.1GB. Free memory was 429.4MB in the beginning and 429.2MB in the end (delta: 230.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:28,538 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.21ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.57ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 98.1MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.63ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 95.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.47ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 92.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 570.10ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 35.6MB in the end (delta: 57.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13363.84ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 35.2MB in the beginning and 429.4MB in the end (delta: -394.2MB). Peak memory consumption was 531.0MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 1.1GB. Free memory was 429.4MB in the beginning and 429.2MB in the end (delta: 230.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-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] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, t1805=-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] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((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, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 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, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 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, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L796] 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) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 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 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 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=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 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=2, __unbuffered_p2_EAX=1, arg={0: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 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=2, __unbuffered_p2_EAX=1, arg={0: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 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=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe001_power.opt_pso.oepc_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 823]: 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, 68 locations, 66 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 796 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 793 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2414 IncrementalHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 2 mSDtfsCounter, 2414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=5, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 14:10:28,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:10:30,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:10:30,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 14:10:30,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:10:30,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:10:30,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:10:30,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:10:30,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:10:30,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:10:30,733 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:10:30,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:10:30,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:10:30,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:10:30,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:10:30,734 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:10:30,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:10:30,735 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:10:30,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:10:30,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:10:30,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:10:30,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:10:30,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:10:30,736 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:10:30,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:10:30,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:10:30,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:10:30,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:10:30,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:10:30,737 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2025-03-17 14:10:30,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:10:31,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:10:31,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:10:31,005 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:10:31,005 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:10:31,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-03-17 14:10:32,169 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce6e00e5/b6ecbd58c89543608655f60a9677305f/FLAG5abffb87d [2025-03-17 14:10:32,361 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:10:32,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-03-17 14:10:32,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce6e00e5/b6ecbd58c89543608655f60a9677305f/FLAG5abffb87d [2025-03-17 14:10:32,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ce6e00e5/b6ecbd58c89543608655f60a9677305f [2025-03-17 14:10:32,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:10:32,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:10:32,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:10:32,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:10:32,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:10:32,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e9e2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32, skipping insertion in model container [2025-03-17 14:10:32,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:10:32,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:10:32,677 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:10:32,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:10:32,772 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:10:32,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32 WrapperNode [2025-03-17 14:10:32,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:10:32,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:10:32,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:10:32,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:10:32,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,827 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2025-03-17 14:10:32,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:10:32,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:10:32,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:10:32,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:10:32,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,865 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:10:32,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:10:32,886 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:10:32,886 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:10:32,886 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:10:32,887 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (1/1) ... [2025-03-17 14:10:32,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:10:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:32,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:10:32,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:10:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:10:32,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:10:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 14:10:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:10:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:10:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:10:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:10:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 14:10:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 14:10:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:10:32,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:10:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:10:32,948 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:10:33,067 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:10:33,069 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:10:33,357 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:10:33,357 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:10:33,538 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:10:33,539 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:10:33,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:10:33 BoogieIcfgContainer [2025-03-17 14:10:33,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:10:33,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:10:33,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:10:33,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:10:33,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:10:32" (1/3) ... [2025-03-17 14:10:33,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373ee3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:10:33, skipping insertion in model container [2025-03-17 14:10:33,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:10:32" (2/3) ... [2025-03-17 14:10:33,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373ee3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:10:33, skipping insertion in model container [2025-03-17 14:10:33,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:10:33" (3/3) ... [2025-03-17 14:10:33,547 INFO L128 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-03-17 14:10:33,557 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:10:33,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-17 14:10:33,558 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:10:33,611 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:10:33,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2025-03-17 14:10:33,676 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-03-17 14:10:33,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:10:33,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-03-17 14:10:33,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2025-03-17 14:10:33,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2025-03-17 14:10:33,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:10:33,708 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;@10b468de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:10:33,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 14:10:33,714 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:10:33,714 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-17 14:10:33,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:10:33,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:33,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:10:33,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:10:33,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:33,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1838464095, now seen corresponding path program 1 times [2025-03-17 14:10:33,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:33,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619955197] [2025-03-17 14:10:33,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:33,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:33,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:33,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:10:33,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:10:33,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:10:33,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:33,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:33,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:10:33,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:10:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:33,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:10:33,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:10:33,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619955197] [2025-03-17 14:10:33,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619955197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:33,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:33,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:10:33,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443746777] [2025-03-17 14:10:33,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:33,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:10:33,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:10:33,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:10:33,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:10:33,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:33,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 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-03-17 14:10:33,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:33,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:33,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:34,779 INFO L124 PetriNetUnfolderBase]: 5315/7699 cut-off events. [2025-03-17 14:10:34,780 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-17 14:10:34,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15350 conditions, 7699 events. 5315/7699 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 42906 event pairs, 585 based on Foata normal form. 432/8119 useless extension candidates. Maximal degree in co-relation 15339. Up to 6591 conditions per place. [2025-03-17 14:10:34,821 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-03-17 14:10:34,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 230 flow [2025-03-17 14:10:34,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:10:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:10:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-17 14:10:34,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-17 14:10:34,830 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 86 transitions. [2025-03-17 14:10:34,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 230 flow [2025-03-17 14:10:34,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:10:34,836 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-03-17 14:10:34,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-17 14:10:34,841 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-03-17 14:10:34,842 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-03-17 14:10:34,842 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-03-17 14:10:34,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:34,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:34,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:10:35,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:35,044 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-03-17 14:10:35,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1258405481, now seen corresponding path program 1 times [2025-03-17 14:10:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1965354889] [2025-03-17 14:10:35,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:35,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:35,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:35,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:35,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:10:35,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:10:35,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:10:35,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:35,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:35,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:10:35,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:10:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:35,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:10:35,156 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:10:35,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965354889] [2025-03-17 14:10:35,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965354889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:35,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:10:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956680690] [2025-03-17 14:10:35,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:35,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:10:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:10:35,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:10:35,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:10:35,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-03-17 14:10:35,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:35,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:35,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-03-17 14:10:35,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:35,671 INFO L124 PetriNetUnfolderBase]: 4775/7427 cut-off events. [2025-03-17 14:10:35,671 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-03-17 14:10:35,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14657 conditions, 7427 events. 4775/7427 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43908 event pairs, 4775 based on Foata normal form. 216/7592 useless extension candidates. Maximal degree in co-relation 14647. Up to 6804 conditions per place. [2025-03-17 14:10:35,705 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-03-17 14:10:35,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 138 flow [2025-03-17 14:10:35,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:10:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:10:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-17 14:10:35,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-17 14:10:35,706 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 57 transitions. [2025-03-17 14:10:35,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 138 flow [2025-03-17 14:10:35,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:10:35,708 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-03-17 14:10:35,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-03-17 14:10:35,708 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-03-17 14:10:35,708 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-03-17 14:10:35,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:35,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:35,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:35,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:10:35,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:35,909 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-03-17 14:10:35,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1258405169, now seen corresponding path program 1 times [2025-03-17 14:10:35,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:35,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012729005] [2025-03-17 14:10:35,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:35,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:35,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:35,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:35,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:10:35,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:10:35,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:10:35,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:35,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:35,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:10:35,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:10:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:36,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:10:36,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:10:36,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012729005] [2025-03-17 14:10:36,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012729005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:36,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:36,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:10:36,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682415939] [2025-03-17 14:10:36,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:36,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:10:36,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:10:36,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:10:36,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:10:36,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:36,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:36,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:36,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:36,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:36,464 INFO L124 PetriNetUnfolderBase]: 3471/5583 cut-off events. [2025-03-17 14:10:36,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:10:36,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10789 conditions, 5583 events. 3471/5583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 33238 event pairs, 535 based on Foata normal form. 216/5786 useless extension candidates. Maximal degree in co-relation 10783. Up to 3001 conditions per place. [2025-03-17 14:10:36,500 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 55 selfloop transitions, 5 changer transitions 1/67 dead transitions. [2025-03-17 14:10:36,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 268 flow [2025-03-17 14:10:36,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:10:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:10:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-03-17 14:10:36,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727 [2025-03-17 14:10:36,505 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 103 transitions. [2025-03-17 14:10:36,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 268 flow [2025-03-17 14:10:36,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:10:36,506 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2025-03-17 14:10:36,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-17 14:10:36,507 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-03-17 14:10:36,507 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2025-03-17 14:10:36,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:36,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:36,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:36,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:10:36,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:36,713 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-03-17 14:10:36,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:36,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1751317738, now seen corresponding path program 1 times [2025-03-17 14:10:36,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:36,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158300670] [2025-03-17 14:10:36,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:36,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:36,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:36,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:36,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:10:36,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:10:36,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:10:36,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:36,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:36,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:10:36,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:10:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:36,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:10:36,816 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:10:36,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158300670] [2025-03-17 14:10:36,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158300670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:36,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:36,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:10:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514025006] [2025-03-17 14:10:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:36,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:10:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:10:36,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:10:36,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:10:36,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:36,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:36,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:36,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:36,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:37,105 INFO L124 PetriNetUnfolderBase]: 1935/3119 cut-off events. [2025-03-17 14:10:37,105 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2025-03-17 14:10:37,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7056 conditions, 3119 events. 1935/3119 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 15968 event pairs, 339 based on Foata normal form. 152/3258 useless extension candidates. Maximal degree in co-relation 7047. Up to 985 conditions per place. [2025-03-17 14:10:37,117 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 70 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-03-17 14:10:37,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 384 flow [2025-03-17 14:10:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:10:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:10:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-17 14:10:37,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5954545454545455 [2025-03-17 14:10:37,119 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 131 transitions. [2025-03-17 14:10:37,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 384 flow [2025-03-17 14:10:37,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 374 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:10:37,121 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2025-03-17 14:10:37,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-03-17 14:10:37,122 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2025-03-17 14:10:37,122 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2025-03-17 14:10:37,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:37,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:37,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:10:37,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:10:37,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:37,323 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-03-17 14:10:37,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:37,324 INFO L85 PathProgramCache]: Analyzing trace with hash 302377765, now seen corresponding path program 1 times [2025-03-17 14:10:37,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:37,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561596546] [2025-03-17 14:10:37,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:37,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:37,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:37,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:37,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:10:37,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:10:37,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:10:37,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:37,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:37,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:10:37,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:10:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:37,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:10:37,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:10:37,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561596546] [2025-03-17 14:10:37,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561596546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:37,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:37,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:10:37,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527039011] [2025-03-17 14:10:37,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:37,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:10:37,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:10:37,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:10:37,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:10:37,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:37,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:37,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:37,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:37,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:37,745 INFO L124 PetriNetUnfolderBase]: 1167/1823 cut-off events. [2025-03-17 14:10:37,745 INFO L125 PetriNetUnfolderBase]: For 1138/1138 co-relation queries the response was YES. [2025-03-17 14:10:37,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4568 conditions, 1823 events. 1167/1823 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8113 event pairs, 303 based on Foata normal form. 56/1866 useless extension candidates. Maximal degree in co-relation 4557. Up to 672 conditions per place. [2025-03-17 14:10:37,756 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 59 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2025-03-17 14:10:37,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 375 flow [2025-03-17 14:10:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:10:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:10:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-03-17 14:10:37,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2025-03-17 14:10:37,758 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 133 transitions. [2025-03-17 14:10:37,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 375 flow [2025-03-17 14:10:37,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 350 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-17 14:10:37,769 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2025-03-17 14:10:37,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-03-17 14:10:37,770 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-03-17 14:10:37,771 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2025-03-17 14:10:37,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:37,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:37,772 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] [2025-03-17 14:10:37,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:10:37,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:37,976 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-03-17 14:10:37,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:37,977 INFO L85 PathProgramCache]: Analyzing trace with hash -305707513, now seen corresponding path program 1 times [2025-03-17 14:10:37,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:37,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578326907] [2025-03-17 14:10:37,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:10:37,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:37,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:37,980 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:37,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:10:38,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:38,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:38,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:38,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:38,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:10:38,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:10:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:38,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:10:38,223 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:10:38,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578326907] [2025-03-17 14:10:38,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578326907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:38,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:38,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:10:38,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976485023] [2025-03-17 14:10:38,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:38,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:10:38,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:10:38,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:10:38,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:10:38,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:38,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:38,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:38,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:38,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:38,528 INFO L124 PetriNetUnfolderBase]: 1651/2579 cut-off events. [2025-03-17 14:10:38,528 INFO L125 PetriNetUnfolderBase]: For 1812/1812 co-relation queries the response was YES. [2025-03-17 14:10:38,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6549 conditions, 2579 events. 1651/2579 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12150 event pairs, 315 based on Foata normal form. 8/2578 useless extension candidates. Maximal degree in co-relation 6537. Up to 1084 conditions per place. [2025-03-17 14:10:38,537 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 59 selfloop transitions, 7 changer transitions 25/97 dead transitions. [2025-03-17 14:10:38,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 543 flow [2025-03-17 14:10:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:10:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:10:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2025-03-17 14:10:38,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967532467532468 [2025-03-17 14:10:38,538 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 7 states and 153 transitions. [2025-03-17 14:10:38,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 543 flow [2025-03-17 14:10:38,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 430 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-17 14:10:38,545 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 164 flow [2025-03-17 14:10:38,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-03-17 14:10:38,546 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2025-03-17 14:10:38,546 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 164 flow [2025-03-17 14:10:38,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:38,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:38,546 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] [2025-03-17 14:10:38,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:10:38,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:38,751 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-03-17 14:10:38,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:38,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1834988455, now seen corresponding path program 2 times [2025-03-17 14:10:38,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:38,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707041591] [2025-03-17 14:10:38,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:10:38,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:38,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:38,754 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:38,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:10:38,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:38,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:38,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:10:38,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:38,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:10:38,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:10:38,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-03-17 14:10:38,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:10:38,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:10:38,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707041591] [2025-03-17 14:10:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707041591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:38,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:10:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783467714] [2025-03-17 14:10:38,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:38,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:10:38,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:10:38,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:10:38,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:10:38,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:38,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 164 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:38,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:38,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:38,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:39,222 INFO L124 PetriNetUnfolderBase]: 1441/2289 cut-off events. [2025-03-17 14:10:39,222 INFO L125 PetriNetUnfolderBase]: For 722/736 co-relation queries the response was YES. [2025-03-17 14:10:39,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 2289 events. 1441/2289 cut-off events. For 722/736 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10464 event pairs, 487 based on Foata normal form. 16/2304 useless extension candidates. Maximal degree in co-relation 5621. Up to 971 conditions per place. [2025-03-17 14:10:39,229 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 55 selfloop transitions, 7 changer transitions 30/98 dead transitions. [2025-03-17 14:10:39,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 513 flow [2025-03-17 14:10:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:10:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:10:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2025-03-17 14:10:39,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4837662337662338 [2025-03-17 14:10:39,231 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 164 flow. Second operand 7 states and 149 transitions. [2025-03-17 14:10:39,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 513 flow [2025-03-17 14:10:39,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 98 transitions, 496 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-17 14:10:39,233 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 203 flow [2025-03-17 14:10:39,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2025-03-17 14:10:39,234 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-03-17 14:10:39,234 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 203 flow [2025-03-17 14:10:39,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:39,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:39,234 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] [2025-03-17 14:10:39,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:10:39,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:39,435 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-03-17 14:10:39,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1096878411, now seen corresponding path program 3 times [2025-03-17 14:10:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:39,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293495834] [2025-03-17 14:10:39,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:10:39,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:39,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:39,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:39,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:10:39,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:39,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:39,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:10:39,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:39,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:10:39,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:10:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:39,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:10:39,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:10:39,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293495834] [2025-03-17 14:10:39,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293495834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:39,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:39,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:10:39,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431480653] [2025-03-17 14:10:39,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:39,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:10:39,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:10:39,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:10:39,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:10:39,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:39,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 203 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:39,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:39,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:39,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:40,010 INFO L124 PetriNetUnfolderBase]: 1099/1762 cut-off events. [2025-03-17 14:10:40,010 INFO L125 PetriNetUnfolderBase]: For 849/851 co-relation queries the response was YES. [2025-03-17 14:10:40,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 1762 events. 1099/1762 cut-off events. For 849/851 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7938 event pairs, 389 based on Foata normal form. 8/1770 useless extension candidates. Maximal degree in co-relation 4500. Up to 1034 conditions per place. [2025-03-17 14:10:40,015 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 57 selfloop transitions, 4 changer transitions 17/84 dead transitions. [2025-03-17 14:10:40,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 491 flow [2025-03-17 14:10:40,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:10:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:10:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2025-03-17 14:10:40,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41233766233766234 [2025-03-17 14:10:40,017 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 203 flow. Second operand 7 states and 127 transitions. [2025-03-17 14:10:40,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 491 flow [2025-03-17 14:10:40,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 464 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-17 14:10:40,019 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 209 flow [2025-03-17 14:10:40,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2025-03-17 14:10:40,019 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-03-17 14:10:40,019 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 209 flow [2025-03-17 14:10:40,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:40,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:40,020 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] [2025-03-17 14:10:40,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:10:40,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:40,221 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-03-17 14:10:40,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1940091197, now seen corresponding path program 4 times [2025-03-17 14:10:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2045162869] [2025-03-17 14:10:40,221 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:10:40,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:40,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:40,223 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:40,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:10:40,271 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:10:40,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 30 statements. [2025-03-17 14:10:40,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:10:40,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:40,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:10:40,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:10:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:40,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:10:40,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:10:40,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045162869] [2025-03-17 14:10:40,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045162869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:40,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:40,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:10:40,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163077525] [2025-03-17 14:10:40,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:40,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:10:40,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:10:40,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:10:40,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:10:40,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:40,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:40,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:40,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:40,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:40,716 INFO L124 PetriNetUnfolderBase]: 1593/2536 cut-off events. [2025-03-17 14:10:40,716 INFO L125 PetriNetUnfolderBase]: For 1477/1479 co-relation queries the response was YES. [2025-03-17 14:10:40,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6773 conditions, 2536 events. 1593/2536 cut-off events. For 1477/1479 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12136 event pairs, 471 based on Foata normal form. 9/2545 useless extension candidates. Maximal degree in co-relation 6758. Up to 1013 conditions per place. [2025-03-17 14:10:40,723 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 45 selfloop transitions, 2 changer transitions 53/106 dead transitions. [2025-03-17 14:10:40,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 106 transitions, 618 flow [2025-03-17 14:10:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:10:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:10:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2025-03-17 14:10:40,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4346590909090909 [2025-03-17 14:10:40,725 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 209 flow. Second operand 8 states and 153 transitions. [2025-03-17 14:10:40,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 106 transitions, 618 flow [2025-03-17 14:10:40,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 598 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-17 14:10:40,728 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 198 flow [2025-03-17 14:10:40,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=198, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2025-03-17 14:10:40,729 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2025-03-17 14:10:40,729 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 198 flow [2025-03-17 14:10:40,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:40,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:40,729 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] [2025-03-17 14:10:40,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:10:40,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:40,930 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-03-17 14:10:40,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash -357914189, now seen corresponding path program 5 times [2025-03-17 14:10:40,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:40,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796091128] [2025-03-17 14:10:40,931 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:10:40,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:40,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:40,939 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:40,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:10:40,994 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:41,015 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:41,015 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:10:41,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:10:41,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:10:41,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:10:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:10:41,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:10:41,409 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:10:41,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796091128] [2025-03-17 14:10:41,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796091128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:10:41,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:10:41,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:10:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464883757] [2025-03-17 14:10:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:10:41,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:10:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:10:41,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:10:41,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:10:41,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:10:41,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 198 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:41,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:10:41,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:10:41,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:10:41,687 INFO L124 PetriNetUnfolderBase]: 837/1380 cut-off events. [2025-03-17 14:10:41,687 INFO L125 PetriNetUnfolderBase]: For 757/759 co-relation queries the response was YES. [2025-03-17 14:10:41,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 1380 events. 837/1380 cut-off events. For 757/759 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5831 event pairs, 347 based on Foata normal form. 8/1388 useless extension candidates. Maximal degree in co-relation 3540. Up to 660 conditions per place. [2025-03-17 14:10:41,693 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 42 selfloop transitions, 4 changer transitions 24/76 dead transitions. [2025-03-17 14:10:41,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 76 transitions, 437 flow [2025-03-17 14:10:41,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:10:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:10:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2025-03-17 14:10:41,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39935064935064934 [2025-03-17 14:10:41,695 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 198 flow. Second operand 7 states and 123 transitions. [2025-03-17 14:10:41,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 76 transitions, 437 flow [2025-03-17 14:10:41,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 76 transitions, 404 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-17 14:10:41,698 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 174 flow [2025-03-17 14:10:41,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2025-03-17 14:10:41,701 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2025-03-17 14:10:41,702 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 174 flow [2025-03-17 14:10:41,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:10:41,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:10:41,702 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] [2025-03-17 14:10:41,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:10:41,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:41,907 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-03-17 14:10:41,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:10:41,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1226262997, now seen corresponding path program 6 times [2025-03-17 14:10:41,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:10:41,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393389668] [2025-03-17 14:10:41,910 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:10:41,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:41,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:10:41,913 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:10:41,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:10:41,965 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:41,986 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:41,986 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 14:10:41,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:10:41,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:10:42,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:10:42,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:10:42,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:10:42,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:10:42,056 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 14:10:42,057 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:10:42,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-17 14:10:42,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-17 14:10:42,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-17 14:10:42,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-17 14:10:42,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-17 14:10:42,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-17 14:10:42,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-17 14:10:42,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:10:42,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:10:42,261 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2025-03-17 14:10:42,319 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:10:42,319 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:10:42,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:10:42 BasicIcfg [2025-03-17 14:10:42,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:10:42,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:10:42,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:10:42,325 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:10:42,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:10:33" (3/4) ... [2025-03-17 14:10:42,327 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:10:42,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:10:42,328 INFO L158 Benchmark]: Toolchain (without parser) took 9937.77ms. Allocated memory was 83.9MB in the beginning and 671.1MB in the end (delta: 587.2MB). Free memory was 58.2MB in the beginning and 281.0MB in the end (delta: -222.8MB). Peak memory consumption was 364.8MB. Max. memory is 16.1GB. [2025-03-17 14:10:42,328 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:42,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.66ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 34.8MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:10:42,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.60ms. Allocated memory is still 83.9MB. Free memory was 34.8MB in the beginning and 32.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:42,328 INFO L158 Benchmark]: Boogie Preprocessor took 54.01ms. Allocated memory is still 83.9MB. Free memory was 32.2MB in the beginning and 29.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:42,329 INFO L158 Benchmark]: IcfgBuilder took 653.37ms. Allocated memory is still 83.9MB. Free memory was 29.5MB in the beginning and 25.7MB in the end (delta: 3.8MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2025-03-17 14:10:42,329 INFO L158 Benchmark]: TraceAbstraction took 8784.18ms. Allocated memory was 83.9MB in the beginning and 671.1MB in the end (delta: 587.2MB). Free memory was 25.2MB in the beginning and 281.1MB in the end (delta: -255.9MB). Peak memory consumption was 333.7MB. Max. memory is 16.1GB. [2025-03-17 14:10:42,329 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 671.1MB. Free memory was 281.1MB in the beginning and 281.0MB in the end (delta: 23.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:10:42,330 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.66ms. Allocated memory is still 83.9MB. Free memory was 57.9MB in the beginning and 34.8MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.60ms. Allocated memory is still 83.9MB. Free memory was 34.8MB in the beginning and 32.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.01ms. Allocated memory is still 83.9MB. Free memory was 32.2MB in the beginning and 29.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 653.37ms. Allocated memory is still 83.9MB. Free memory was 29.5MB in the beginning and 25.7MB in the end (delta: 3.8MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8784.18ms. Allocated memory was 83.9MB in the beginning and 671.1MB in the end (delta: 587.2MB). Free memory was 25.2MB in the beginning and 281.1MB in the end (delta: -255.9MB). Peak memory consumption was 333.7MB. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 671.1MB. Free memory was 281.1MB in the beginning and 281.0MB in the end (delta: 23.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-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] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, t1805=-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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((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, main$tmp_guard0=0, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 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, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L796] 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) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 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 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 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=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 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) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 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 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 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=2, __unbuffered_p2_EAX=1, arg={0: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 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=2, __unbuffered_p2_EAX=1, arg={0: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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 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) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 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=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=-2, t1805=-1, t1806=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe001_power.opt_pso.oepc_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, 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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 823]: 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, 68 locations, 66 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 574 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 563 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1544 IncrementalHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 1 mSDtfsCounter, 1544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=8, InterpolantAutomatonStates: 57, 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, 1.2s InterpolantComputationTime, 261 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1254 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1070 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 14:10:42,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample