./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:54:29,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:54:29,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:54:29,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:54:29,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:54:29,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:54:29,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:54:29,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:54:29,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:54:29,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:54:29,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:54:29,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:54:29,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:54:29,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:54:29,505 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:54:29,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:54:29,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:54:29,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:54:29,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:54:29,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:54:29,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:54:29,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:54:29,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:54:29,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:54:29,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:54:29,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:54:29,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:54:29,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:54:29,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:54:29,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:54:29,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:54:29,508 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 -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2025-03-04 09:54:29,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:54:29,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:54:29,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:54:29,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:54:29,756 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:54:29,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:54:30,937 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165ebda34/699ce0401baf44118e8e5ad4d1733c30/FLAGf8ffad5db [2025-03-04 09:54:31,278 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:54:31,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:54:31,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165ebda34/699ce0401baf44118e8e5ad4d1733c30/FLAGf8ffad5db [2025-03-04 09:54:31,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/165ebda34/699ce0401baf44118e8e5ad4d1733c30 [2025-03-04 09:54:31,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:54:31,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:54:31,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:54:31,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:54:31,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:54:31,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758d9311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31, skipping insertion in model container [2025-03-04 09:54:31,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:54:31,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:54:31,798 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:54:31,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:54:31,879 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:54:31,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31 WrapperNode [2025-03-04 09:54:31,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:54:31,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:54:31,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:54:31,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:54:31,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,913 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2025-03-04 09:54:31,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:54:31,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:54:31,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:54:31,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:54:31,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,936 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:54:31,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:54:31,947 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:54:31,947 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:54:31,947 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:54:31,948 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (1/1) ... [2025-03-04 09:54:31,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:54:31,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:31,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:54:31,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:54:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:54:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:54:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:54:31,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:54:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:54:31,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:54:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:54:31,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:54:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:54:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:54:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:54:31,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:54:31,998 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:54:32,113 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:54:32,115 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:54:32,397 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:54:32,397 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:54:32,592 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:54:32,592 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:54:32,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:54:32 BoogieIcfgContainer [2025-03-04 09:54:32,593 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:54:32,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:54:32,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:54:32,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:54:32,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:54:31" (1/3) ... [2025-03-04 09:54:32,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37534d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:54:32, skipping insertion in model container [2025-03-04 09:54:32,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:31" (2/3) ... [2025-03-04 09:54:32,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37534d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:54:32, skipping insertion in model container [2025-03-04 09:54:32,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:54:32" (3/3) ... [2025-03-04 09:54:32,604 INFO L128 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:54:32,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:54:32,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:54:32,617 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:54:32,683 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:54:32,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:54:32,737 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-04 09:54:32,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:54:32,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-04 09:54:32,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:54:32,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2025-03-04 09:54:32,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:54:32,763 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;@32cfae2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:54:32,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 09:54:32,770 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:54:32,770 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-04 09:54:32,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:54:32,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:32,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:54:32,771 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-04 09:54:32,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1866467635, now seen corresponding path program 1 times [2025-03-04 09:54:32,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:32,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303699264] [2025-03-04 09:54:32,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:32,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:32,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:54:32,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:54:32,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:32,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:33,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303699264] [2025-03-04 09:54:33,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303699264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:33,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:33,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:54:33,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533685110] [2025-03-04 09:54:33,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:33,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:54:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:33,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:54:33,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:54:33,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:33,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:33,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:33,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:33,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:34,191 INFO L124 PetriNetUnfolderBase]: 6263/9057 cut-off events. [2025-03-04 09:54:34,192 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 09:54:34,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18044 conditions, 9057 events. 6263/9057 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 50962 event pairs, 693 based on Foata normal form. 504/9557 useless extension candidates. Maximal degree in co-relation 18033. Up to 7741 conditions per place. [2025-03-04 09:54:34,261 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-03-04 09:54:34,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 238 flow [2025-03-04 09:54:34,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:54:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:54:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-04 09:54:34,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2025-03-04 09:54:34,277 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 88 transitions. [2025-03-04 09:54:34,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 238 flow [2025-03-04 09:54:34,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:54:34,286 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-03-04 09:54:34,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-04 09:54:34,294 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-03-04 09:54:34,295 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-03-04 09:54:34,296 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-04 09:54:34,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:34,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:34,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:54:34,297 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-04 09:54:34,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash -468001032, now seen corresponding path program 1 times [2025-03-04 09:54:34,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:34,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244088520] [2025-03-04 09:54:34,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:34,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:34,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:54:34,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:54:34,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:34,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:34,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:34,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244088520] [2025-03-04 09:54:34,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244088520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:34,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:34,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:54:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197662874] [2025-03-04 09:54:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:34,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:54:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:34,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:54:34,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:54:34,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:54:34,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:34,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:34,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:54:34,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:35,134 INFO L124 PetriNetUnfolderBase]: 5627/8761 cut-off events. [2025-03-04 09:54:35,135 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-04 09:54:35,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17251 conditions, 8761 events. 5627/8761 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 52751 event pairs, 5627 based on Foata normal form. 252/9008 useless extension candidates. Maximal degree in co-relation 17241. Up to 7994 conditions per place. [2025-03-04 09:54:35,186 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-03-04 09:54:35,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 142 flow [2025-03-04 09:54:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:54:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:54:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 09:54:35,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-03-04 09:54:35,189 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 58 transitions. [2025-03-04 09:54:35,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 142 flow [2025-03-04 09:54:35,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:54:35,191 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2025-03-04 09:54:35,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-03-04 09:54:35,191 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-04 09:54:35,191 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2025-03-04 09:54:35,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:35,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:35,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:35,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:54:35,193 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-04 09:54:35,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:35,194 INFO L85 PathProgramCache]: Analyzing trace with hash -468000576, now seen corresponding path program 1 times [2025-03-04 09:54:35,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:35,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920296806] [2025-03-04 09:54:35,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:35,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:35,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:54:35,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:54:35,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:35,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:35,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:35,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920296806] [2025-03-04 09:54:35,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920296806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:35,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:35,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:54:35,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170484190] [2025-03-04 09:54:35,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:35,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:54:35,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:35,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:54:35,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:54:35,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:54:35,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:35,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:35,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:54:35,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:37,080 INFO L124 PetriNetUnfolderBase]: 12675/18592 cut-off events. [2025-03-04 09:54:37,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:54:37,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36894 conditions, 18592 events. 12675/18592 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 115609 event pairs, 2879 based on Foata normal form. 0/18171 useless extension candidates. Maximal degree in co-relation 36888. Up to 6462 conditions per place. [2025-03-04 09:54:37,162 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 48 selfloop transitions, 6 changer transitions 99/158 dead transitions. [2025-03-04 09:54:37,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 158 transitions, 634 flow [2025-03-04 09:54:37,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:54:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:54:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2025-03-04 09:54:37,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.582716049382716 [2025-03-04 09:54:37,167 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 9 states and 236 transitions. [2025-03-04 09:54:37,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 158 transitions, 634 flow [2025-03-04 09:54:37,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 158 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:54:37,172 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 149 flow [2025-03-04 09:54:37,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=149, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2025-03-04 09:54:37,173 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-03-04 09:54:37,174 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 149 flow [2025-03-04 09:54:37,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:37,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:37,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:54:37,174 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-04 09:54:37,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1569262751, now seen corresponding path program 1 times [2025-03-04 09:54:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520256670] [2025-03-04 09:54:37,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:37,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:37,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:54:37,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:54:37,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:37,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:37,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520256670] [2025-03-04 09:54:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520256670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:54:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140925187] [2025-03-04 09:54:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:37,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:54:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:37,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:54:37,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:54:37,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:54:37,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:37,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:37,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:54:37,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:38,458 INFO L124 PetriNetUnfolderBase]: 8649/12839 cut-off events. [2025-03-04 09:54:38,458 INFO L125 PetriNetUnfolderBase]: For 14223/14223 co-relation queries the response was YES. [2025-03-04 09:54:38,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34132 conditions, 12839 events. 8649/12839 cut-off events. For 14223/14223 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 74696 event pairs, 2057 based on Foata normal form. 372/13206 useless extension candidates. Maximal degree in co-relation 34117. Up to 3889 conditions per place. [2025-03-04 09:54:38,513 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 56 selfloop transitions, 6 changer transitions 89/156 dead transitions. [2025-03-04 09:54:38,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 156 transitions, 865 flow [2025-03-04 09:54:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:54:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:54:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 232 transitions. [2025-03-04 09:54:38,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2025-03-04 09:54:38,518 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 149 flow. Second operand 10 states and 232 transitions. [2025-03-04 09:54:38,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 156 transitions, 865 flow [2025-03-04 09:54:38,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 156 transitions, 791 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-03-04 09:54:38,569 INFO L231 Difference]: Finished difference. Result has 66 places, 40 transitions, 183 flow [2025-03-04 09:54:38,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=40} [2025-03-04 09:54:38,569 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2025-03-04 09:54:38,569 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 40 transitions, 183 flow [2025-03-04 09:54:38,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:38,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:38,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:38,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:54:38,570 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-04 09:54:38,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:38,570 INFO L85 PathProgramCache]: Analyzing trace with hash -345005718, now seen corresponding path program 1 times [2025-03-04 09:54:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:38,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112929095] [2025-03-04 09:54:38,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:38,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:38,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:54:38,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:54:38,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:38,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:38,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112929095] [2025-03-04 09:54:38,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112929095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:38,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:38,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:54:38,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478508717] [2025-03-04 09:54:38,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:38,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:54:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:38,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:54:38,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:54:38,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:54:38,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 40 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:38,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:38,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:54:38,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:40,078 INFO L124 PetriNetUnfolderBase]: 11530/16973 cut-off events. [2025-03-04 09:54:40,078 INFO L125 PetriNetUnfolderBase]: For 22610/22610 co-relation queries the response was YES. [2025-03-04 09:54:40,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45654 conditions, 16973 events. 11530/16973 cut-off events. For 22610/22610 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 101993 event pairs, 2675 based on Foata normal form. 240/17212 useless extension candidates. Maximal degree in co-relation 45632. Up to 7188 conditions per place. [2025-03-04 09:54:40,147 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 63 selfloop transitions, 10 changer transitions 49/127 dead transitions. [2025-03-04 09:54:40,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 127 transitions, 757 flow [2025-03-04 09:54:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:54:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:54:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-03-04 09:54:40,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5587301587301587 [2025-03-04 09:54:40,148 INFO L175 Difference]: Start difference. First operand has 66 places, 40 transitions, 183 flow. Second operand 7 states and 176 transitions. [2025-03-04 09:54:40,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 127 transitions, 757 flow [2025-03-04 09:54:40,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 127 transitions, 711 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-04 09:54:40,267 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 221 flow [2025-03-04 09:54:40,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-03-04 09:54:40,267 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2025-03-04 09:54:40,267 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 221 flow [2025-03-04 09:54:40,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:40,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:40,269 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] [2025-03-04 09:54:40,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:54:40,272 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-04 09:54:40,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash 879346621, now seen corresponding path program 1 times [2025-03-04 09:54:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:40,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309641721] [2025-03-04 09:54:40,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:40,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:54:40,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:54:40,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:40,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:40,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:40,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309641721] [2025-03-04 09:54:40,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309641721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:40,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:40,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:54:40,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847283186] [2025-03-04 09:54:40,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:40,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:54:40,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:40,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:54:40,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:54:40,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:54:40,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 221 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-04 09:54:40,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:40,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:54:40,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:41,704 INFO L124 PetriNetUnfolderBase]: 11271/16806 cut-off events. [2025-03-04 09:54:41,705 INFO L125 PetriNetUnfolderBase]: For 13550/13550 co-relation queries the response was YES. [2025-03-04 09:54:41,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42294 conditions, 16806 events. 11271/16806 cut-off events. For 13550/13550 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 102199 event pairs, 3297 based on Foata normal form. 224/17029 useless extension candidates. Maximal degree in co-relation 42271. Up to 4395 conditions per place. [2025-03-04 09:54:41,794 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 52 selfloop transitions, 4 changer transitions 81/142 dead transitions. [2025-03-04 09:54:41,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 142 transitions, 780 flow [2025-03-04 09:54:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:54:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:54:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2025-03-04 09:54:41,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.528395061728395 [2025-03-04 09:54:41,795 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 221 flow. Second operand 9 states and 214 transitions. [2025-03-04 09:54:41,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 142 transitions, 780 flow [2025-03-04 09:54:41,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 142 transitions, 722 flow, removed 27 selfloop flow, removed 7 redundant places. [2025-03-04 09:54:41,871 INFO L231 Difference]: Finished difference. Result has 71 places, 39 transitions, 178 flow [2025-03-04 09:54:41,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=71, PETRI_TRANSITIONS=39} [2025-03-04 09:54:41,872 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2025-03-04 09:54:41,872 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 39 transitions, 178 flow [2025-03-04 09:54:41,872 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-04 09:54:41,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:41,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:41,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:54:41,872 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-04 09:54:41,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2068335290, now seen corresponding path program 1 times [2025-03-04 09:54:41,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:41,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22305294] [2025-03-04 09:54:41,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:41,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:54:41,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:54:41,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:41,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:41,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:41,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22305294] [2025-03-04 09:54:41,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22305294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:41,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:41,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:54:41,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296496848] [2025-03-04 09:54:41,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:41,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:54:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:41,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:54:41,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:54:41,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:41,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 39 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:41,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:41,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:41,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:42,441 INFO L124 PetriNetUnfolderBase]: 4643/7311 cut-off events. [2025-03-04 09:54:42,442 INFO L125 PetriNetUnfolderBase]: For 6414/6414 co-relation queries the response was YES. [2025-03-04 09:54:42,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18195 conditions, 7311 events. 4643/7311 cut-off events. For 6414/6414 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 42272 event pairs, 687 based on Foata normal form. 354/7660 useless extension candidates. Maximal degree in co-relation 18171. Up to 3895 conditions per place. [2025-03-04 09:54:42,474 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 59 selfloop transitions, 5 changer transitions 11/80 dead transitions. [2025-03-04 09:54:42,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 80 transitions, 522 flow [2025-03-04 09:54:42,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:54:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:54:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 09:54:42,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-04 09:54:42,476 INFO L175 Difference]: Start difference. First operand has 71 places, 39 transitions, 178 flow. Second operand 4 states and 106 transitions. [2025-03-04 09:54:42,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 80 transitions, 522 flow [2025-03-04 09:54:42,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 443 flow, removed 12 selfloop flow, removed 13 redundant places. [2025-03-04 09:54:42,487 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 173 flow [2025-03-04 09:54:42,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2025-03-04 09:54:42,488 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-03-04 09:54:42,488 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 173 flow [2025-03-04 09:54:42,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:42,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:42,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:42,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:54:42,489 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-04 09:54:42,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash 840718331, now seen corresponding path program 1 times [2025-03-04 09:54:42,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:42,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621402548] [2025-03-04 09:54:42,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:42,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:42,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:54:42,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:54:42,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:42,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:42,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:42,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621402548] [2025-03-04 09:54:42,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621402548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:42,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:42,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:54:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933570921] [2025-03-04 09:54:42,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:42,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:54:42,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:42,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:54:42,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:54:42,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:42,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 173 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-04 09:54:42,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:42,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:42,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:42,986 INFO L124 PetriNetUnfolderBase]: 3011/4833 cut-off events. [2025-03-04 09:54:42,987 INFO L125 PetriNetUnfolderBase]: For 2913/2913 co-relation queries the response was YES. [2025-03-04 09:54:42,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12611 conditions, 4833 events. 3011/4833 cut-off events. For 2913/2913 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 25864 event pairs, 387 based on Foata normal form. 272/5100 useless extension candidates. Maximal degree in co-relation 12595. Up to 1705 conditions per place. [2025-03-04 09:54:43,004 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 68 selfloop transitions, 8 changer transitions 13/94 dead transitions. [2025-03-04 09:54:43,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 556 flow [2025-03-04 09:54:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:54:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:54:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-04 09:54:43,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822222222222222 [2025-03-04 09:54:43,006 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 173 flow. Second operand 5 states and 131 transitions. [2025-03-04 09:54:43,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 556 flow [2025-03-04 09:54:43,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 546 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 09:54:43,010 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 213 flow [2025-03-04 09:54:43,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2025-03-04 09:54:43,011 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-04 09:54:43,011 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 213 flow [2025-03-04 09:54:43,012 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-04 09:54:43,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:43,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:54:43,012 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-04 09:54:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash 575249636, now seen corresponding path program 1 times [2025-03-04 09:54:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986498124] [2025-03-04 09:54:43,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:43,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 09:54:43,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 09:54:43,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:43,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:43,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:43,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986498124] [2025-03-04 09:54:43,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986498124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:43,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:43,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:54:43,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805396882] [2025-03-04 09:54:43,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:43,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:54:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:43,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:54:43,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:54:43,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:43,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:43,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:43,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:43,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:43,403 INFO L124 PetriNetUnfolderBase]: 1817/2911 cut-off events. [2025-03-04 09:54:43,403 INFO L125 PetriNetUnfolderBase]: For 3289/3289 co-relation queries the response was YES. [2025-03-04 09:54:43,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8299 conditions, 2911 events. 1817/2911 cut-off events. For 3289/3289 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14080 event pairs, 327 based on Foata normal form. 124/3030 useless extension candidates. Maximal degree in co-relation 8281. Up to 916 conditions per place. [2025-03-04 09:54:43,411 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 59 selfloop transitions, 11 changer transitions 11/86 dead transitions. [2025-03-04 09:54:43,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 86 transitions, 524 flow [2025-03-04 09:54:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:54:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:54:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-03-04 09:54:43,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2025-03-04 09:54:43,412 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 213 flow. Second operand 6 states and 134 transitions. [2025-03-04 09:54:43,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 86 transitions, 524 flow [2025-03-04 09:54:43,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 477 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-04 09:54:43,420 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 215 flow [2025-03-04 09:54:43,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2025-03-04 09:54:43,421 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-04 09:54:43,421 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 215 flow [2025-03-04 09:54:43,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:43,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:43,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:43,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:54:43,421 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-04 09:54:43,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1945745680, now seen corresponding path program 1 times [2025-03-04 09:54:43,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:43,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383659168] [2025-03-04 09:54:43,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:43,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:54:43,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:54:43,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:43,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:43,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:43,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383659168] [2025-03-04 09:54:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383659168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:43,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:43,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:54:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211013736] [2025-03-04 09:54:43,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:43,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:54:43,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:43,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:54:43,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:54:43,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:54:43,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:43,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:43,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:54:43,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:43,888 INFO L124 PetriNetUnfolderBase]: 1593/2532 cut-off events. [2025-03-04 09:54:43,888 INFO L125 PetriNetUnfolderBase]: For 2883/2883 co-relation queries the response was YES. [2025-03-04 09:54:43,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7226 conditions, 2532 events. 1593/2532 cut-off events. For 2883/2883 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11851 event pairs, 489 based on Foata normal form. 8/2539 useless extension candidates. Maximal degree in co-relation 7210. Up to 1566 conditions per place. [2025-03-04 09:54:43,894 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 44 selfloop transitions, 3 changer transitions 33/85 dead transitions. [2025-03-04 09:54:43,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 85 transitions, 541 flow [2025-03-04 09:54:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:54:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:54:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-03-04 09:54:43,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2025-03-04 09:54:43,895 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 215 flow. Second operand 6 states and 122 transitions. [2025-03-04 09:54:43,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 85 transitions, 541 flow [2025-03-04 09:54:43,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 428 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-04 09:54:43,901 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 143 flow [2025-03-04 09:54:43,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2025-03-04 09:54:43,906 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-04 09:54:43,906 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 143 flow [2025-03-04 09:54:43,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:43,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:43,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:43,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:54:43,906 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-04 09:54:43,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash 820656542, now seen corresponding path program 2 times [2025-03-04 09:54:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:43,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743154631] [2025-03-04 09:54:43,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:54:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:43,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:54:43,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:54:43,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:54:43,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:44,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:54:44,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743154631] [2025-03-04 09:54:44,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743154631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:44,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:44,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 09:54:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354884621] [2025-03-04 09:54:44,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:44,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:54:44,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:54:44,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:54:44,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:54:44,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:54:44,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 143 flow. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:44,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:44,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:54:44,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:44,826 INFO L124 PetriNetUnfolderBase]: 741/1203 cut-off events. [2025-03-04 09:54:44,826 INFO L125 PetriNetUnfolderBase]: For 498/498 co-relation queries the response was YES. [2025-03-04 09:54:44,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 1203 events. 741/1203 cut-off events. For 498/498 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4758 event pairs, 108 based on Foata normal form. 8/1210 useless extension candidates. Maximal degree in co-relation 2887. Up to 580 conditions per place. [2025-03-04 09:54:44,829 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 46 selfloop transitions, 4 changer transitions 36/91 dead transitions. [2025-03-04 09:54:44,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 472 flow [2025-03-04 09:54:44,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:54:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:54:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2025-03-04 09:54:44,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3802469135802469 [2025-03-04 09:54:44,831 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 143 flow. Second operand 9 states and 154 transitions. [2025-03-04 09:54:44,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 472 flow [2025-03-04 09:54:44,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 421 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-03-04 09:54:44,834 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 130 flow [2025-03-04 09:54:44,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2025-03-04 09:54:44,836 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-04 09:54:44,836 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 130 flow [2025-03-04 09:54:44,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:44,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:44,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:44,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:54:44,836 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-04 09:54:44,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash 112059504, now seen corresponding path program 3 times [2025-03-04 09:54:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:54:44,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333463850] [2025-03-04 09:54:44,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:54:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:54:44,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:54:44,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:54:44,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:54:44,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:54:44,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:54:44,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:54:44,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:54:44,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:44,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:54:44,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 09:54:44,975 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:54:44,975 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 09:54:44,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 09:54:44,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-04 09:54:44,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 09:54:44,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 09:54:44,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 09:54:44,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 09:54:44,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:54:44,978 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:45,043 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:54:45,043 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:54:45,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:54:45 BasicIcfg [2025-03-04 09:54:45,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:54:45,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:54:45,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:54:45,049 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:54:45,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:54:32" (3/4) ... [2025-03-04 09:54:45,052 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:54:45,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:54:45,053 INFO L158 Benchmark]: Toolchain (without parser) took 13530.70ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 121.0MB in the beginning and 677.1MB in the end (delta: -556.1MB). Peak memory consumption was 708.4MB. Max. memory is 16.1GB. [2025-03-04 09:54:45,053 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:54:45,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.85ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 97.7MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:54:45,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.34ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 95.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:54:45,054 INFO L158 Benchmark]: Boogie Preprocessor took 31.98ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 93.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:54:45,054 INFO L158 Benchmark]: IcfgBuilder took 645.89ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 39.9MB in the end (delta: 53.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 09:54:45,055 INFO L158 Benchmark]: TraceAbstraction took 12454.72ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 39.2MB in the beginning and 677.3MB in the end (delta: -638.1MB). Peak memory consumption was 616.1MB. Max. memory is 16.1GB. [2025-03-04 09:54:45,055 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 1.4GB. Free memory was 677.3MB in the beginning and 677.1MB in the end (delta: 197.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:54:45,056 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.17ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.85ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 97.7MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.34ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 95.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.98ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 93.1MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 645.89ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 39.9MB in the end (delta: 53.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12454.72ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 39.2MB in the beginning and 677.3MB in the end (delta: -638.1MB). Peak memory consumption was 616.1MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 1.4GB. Free memory was 677.3MB in the beginning and 677.1MB in the end (delta: 197.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, 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] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, t1898=-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] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L809] 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) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 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, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-3, t1898=-2, t1899=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 744 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 741 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1947 IncrementalHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 3 mSDtfsCounter, 1947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=5, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 09:54:45,072 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:54:47,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:54:47,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 09:54:47,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:54:47,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:54:47,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:54:47,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:54:47,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:54:47,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:54:47,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:54:47,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:54:47,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:54:47,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:54:47,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:54:47,312 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:54:47,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:54:47,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:54:47,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:54:47,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:54:47,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:54:47,313 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:54:47,313 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:54:47,313 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:54:47,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:54:47,314 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:54:47,314 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 09:54:47,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 09:54:47,314 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:54:47,314 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:54:47,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:54:47,314 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:54:47,314 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:54:47,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:54:47,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:54:47,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:54:47,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:54:47,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:54:47,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:54:47,315 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 09:54:47,315 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 09:54:47,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:54:47,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:54:47,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:54:47,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:54:47,316 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 -> 40c6d23f476fb49e658cd83073483dddc1740bbd5f458e601d84fe47899d7237 [2025-03-04 09:54:47,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:54:47,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:54:47,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:54:47,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:54:47,601 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:54:47,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:54:48,831 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0443c3fc/a0fe0ff9ae354eb78afba3be4ee0dd59/FLAG982135545 [2025-03-04 09:54:49,062 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:54:49,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:54:49,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0443c3fc/a0fe0ff9ae354eb78afba3be4ee0dd59/FLAG982135545 [2025-03-04 09:54:49,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0443c3fc/a0fe0ff9ae354eb78afba3be4ee0dd59 [2025-03-04 09:54:49,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:54:49,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:54:49,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:54:49,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:54:49,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:54:49,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25cf2416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49, skipping insertion in model container [2025-03-04 09:54:49,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:54:49,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:54:49,725 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:54:49,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:54:49,812 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:54:49,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49 WrapperNode [2025-03-04 09:54:49,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:54:49,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:54:49,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:54:49,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:54:49,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,857 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2025-03-04 09:54:49,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:54:49,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:54:49,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:54:49,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:54:49,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,890 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:54:49,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:54:49,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:54:49,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:54:49,919 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:54:49,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (1/1) ... [2025-03-04 09:54:49,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:54:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:49,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:54:49,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:54:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:54:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:54:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 09:54:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:54:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:54:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:54:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:54:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:54:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:54:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:54:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:54:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:54:49,976 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:54:50,108 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:54:50,110 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:54:50,378 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:54:50,378 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:54:50,584 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:54:50,584 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:54:50,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:54:50 BoogieIcfgContainer [2025-03-04 09:54:50,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:54:50,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:54:50,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:54:50,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:54:50,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:54:49" (1/3) ... [2025-03-04 09:54:50,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dfb02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:54:50, skipping insertion in model container [2025-03-04 09:54:50,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:54:49" (2/3) ... [2025-03-04 09:54:50,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dfb02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:54:50, skipping insertion in model container [2025-03-04 09:54:50,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:54:50" (3/3) ... [2025-03-04 09:54:50,596 INFO L128 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-03-04 09:54:50,609 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:54:50,610 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:54:50,610 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:54:50,674 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:54:50,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:54:50,734 INFO L124 PetriNetUnfolderBase]: 2/42 cut-off events. [2025-03-04 09:54:50,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:54:50,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 81 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-04 09:54:50,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow [2025-03-04 09:54:50,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow [2025-03-04 09:54:50,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:54:50,772 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;@18e76a4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:54:50,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 09:54:50,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:54:50,782 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-04 09:54:50,782 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:54:50,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:50,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:54:50,783 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-04 09:54:50,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1807300723, now seen corresponding path program 1 times [2025-03-04 09:54:50,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [959646980] [2025-03-04 09:54:50,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:50,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:50,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:50,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:54:50,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:54:50,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:54:50,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:54:50,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:50,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:50,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:54:50,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:54:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:50,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:54:50,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:54:50,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959646980] [2025-03-04 09:54:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959646980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:50,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:50,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:54:50,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606836336] [2025-03-04 09:54:50,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:50,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:54:50,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:54:50,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:54:50,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:54:50,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:50,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:50,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:50,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:50,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:51,884 INFO L124 PetriNetUnfolderBase]: 6263/9057 cut-off events. [2025-03-04 09:54:51,884 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 09:54:51,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18044 conditions, 9057 events. 6263/9057 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 50962 event pairs, 693 based on Foata normal form. 504/9557 useless extension candidates. Maximal degree in co-relation 18033. Up to 7741 conditions per place. [2025-03-04 09:54:51,936 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 49 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2025-03-04 09:54:51,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 238 flow [2025-03-04 09:54:51,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:54:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:54:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-04 09:54:51,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2025-03-04 09:54:51,949 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 88 transitions. [2025-03-04 09:54:51,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 238 flow [2025-03-04 09:54:51,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:54:51,954 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow [2025-03-04 09:54:51,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-04 09:54:51,961 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2025-03-04 09:54:51,961 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow [2025-03-04 09:54:51,962 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-04 09:54:51,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:51,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:51,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:54:52,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:52,164 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-04 09:54:52,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1074698950, now seen corresponding path program 1 times [2025-03-04 09:54:52,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:52,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383725557] [2025-03-04 09:54:52,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:52,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:52,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:52,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:54:52,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:54:52,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:54:52,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:54:52,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:52,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:52,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 09:54:52,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:54:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:52,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:54:52,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:54:52,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383725557] [2025-03-04 09:54:52,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383725557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:52,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:52,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:54:52,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051605467] [2025-03-04 09:54:52,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:52,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:54:52,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:54:52,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:54:52,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:54:52,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 45 [2025-03-04 09:54:52,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:52,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:52,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 45 [2025-03-04 09:54:52,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:53,010 INFO L124 PetriNetUnfolderBase]: 5627/8761 cut-off events. [2025-03-04 09:54:53,010 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2025-03-04 09:54:53,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17251 conditions, 8761 events. 5627/8761 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 52712 event pairs, 5627 based on Foata normal form. 252/9008 useless extension candidates. Maximal degree in co-relation 17241. Up to 7994 conditions per place. [2025-03-04 09:54:53,064 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 28 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2025-03-04 09:54:53,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 142 flow [2025-03-04 09:54:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:54:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:54:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 09:54:53,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2025-03-04 09:54:53,066 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 58 transitions. [2025-03-04 09:54:53,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 142 flow [2025-03-04 09:54:53,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:54:53,069 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2025-03-04 09:54:53,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-03-04 09:54:53,071 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-04 09:54:53,071 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2025-03-04 09:54:53,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:53,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:53,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:53,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:54:53,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:53,273 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-04 09:54:53,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1074698494, now seen corresponding path program 1 times [2025-03-04 09:54:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:53,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465753707] [2025-03-04 09:54:53,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:53,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:53,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:53,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:54:53,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:54:53,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:54:53,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:54:53,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:53,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:53,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:54:53,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:54:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:53,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:54:53,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:54:53,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465753707] [2025-03-04 09:54:53,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465753707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:53,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:53,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:54:53,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181854297] [2025-03-04 09:54:53,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:53,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:54:53,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:54:53,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:54:53,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:54:53,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:53,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:53,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:53,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:53,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:53,893 INFO L124 PetriNetUnfolderBase]: 4015/6429 cut-off events. [2025-03-04 09:54:53,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:54:53,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12435 conditions, 6429 events. 4015/6429 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 38377 event pairs, 661 based on Foata normal form. 252/6676 useless extension candidates. Maximal degree in co-relation 12429. Up to 3409 conditions per place. [2025-03-04 09:54:53,921 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 58 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2025-03-04 09:54:53,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 280 flow [2025-03-04 09:54:53,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:54:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:54:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 09:54:53,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-04 09:54:53,924 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 106 transitions. [2025-03-04 09:54:53,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 280 flow [2025-03-04 09:54:53,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:54:53,926 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow [2025-03-04 09:54:53,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-03-04 09:54:53,928 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-03-04 09:54:53,928 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow [2025-03-04 09:54:53,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:53,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:53,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:53,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:54:54,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:54,134 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-04 09:54:54,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:54,135 INFO L85 PathProgramCache]: Analyzing trace with hash -211595293, now seen corresponding path program 1 times [2025-03-04 09:54:54,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:54,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70052134] [2025-03-04 09:54:54,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:54,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:54,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:54,146 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:54:54,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:54:54,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:54:54,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:54:54,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:54,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:54,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:54:54,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:54:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:54,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:54:54,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:54:54,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70052134] [2025-03-04 09:54:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70052134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:54,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:54:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995719449] [2025-03-04 09:54:54,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:54,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:54:54,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:54:54,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:54:54,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:54:54,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:54,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:54,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:54,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:54,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:54,607 INFO L124 PetriNetUnfolderBase]: 2207/3533 cut-off events. [2025-03-04 09:54:54,607 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2025-03-04 09:54:54,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7982 conditions, 3533 events. 2207/3533 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 18144 event pairs, 427 based on Foata normal form. 172/3700 useless extension candidates. Maximal degree in co-relation 7973. Up to 1128 conditions per place. [2025-03-04 09:54:54,620 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 74 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2025-03-04 09:54:54,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 400 flow [2025-03-04 09:54:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:54:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:54:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-04 09:54:54,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 09:54:54,629 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 135 transitions. [2025-03-04 09:54:54,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 400 flow [2025-03-04 09:54:54,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 09:54:54,632 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow [2025-03-04 09:54:54,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-03-04 09:54:54,633 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-04 09:54:54,633 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow [2025-03-04 09:54:54,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:54,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:54,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:54,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:54:54,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:54,835 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-04 09:54:54,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1546030343, now seen corresponding path program 1 times [2025-03-04 09:54:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416505580] [2025-03-04 09:54:54,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:54,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:54,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:54,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:54:54,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:54:54,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:54:54,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:54:54,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:54,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:54,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:54:54,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:54:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:54,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:54:54,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:54:54,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416505580] [2025-03-04 09:54:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416505580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:54:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552175307] [2025-03-04 09:54:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:54,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:54:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:54:54,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:54:54,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:54:54,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:54,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:54,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:54,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:54,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:55,259 INFO L124 PetriNetUnfolderBase]: 1355/2101 cut-off events. [2025-03-04 09:54:55,259 INFO L125 PetriNetUnfolderBase]: For 1232/1232 co-relation queries the response was YES. [2025-03-04 09:54:55,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5224 conditions, 2101 events. 1355/2101 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9410 event pairs, 385 based on Foata normal form. 60/2156 useless extension candidates. Maximal degree in co-relation 5213. Up to 788 conditions per place. [2025-03-04 09:54:55,270 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 62 selfloop transitions, 11 changer transitions 1/80 dead transitions. [2025-03-04 09:54:55,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 387 flow [2025-03-04 09:54:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:54:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:54:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-03-04 09:54:55,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-03-04 09:54:55,272 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 136 transitions. [2025-03-04 09:54:55,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 387 flow [2025-03-04 09:54:55,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 362 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 09:54:55,285 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow [2025-03-04 09:54:55,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2025-03-04 09:54:55,286 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-03-04 09:54:55,287 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow [2025-03-04 09:54:55,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:55,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:55,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:55,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 09:54:55,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:55,488 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-04 09:54:55,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1478925176, now seen corresponding path program 1 times [2025-03-04 09:54:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:55,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744844275] [2025-03-04 09:54:55,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:54:55,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:55,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:55,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:54:55,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:54:55,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:54:55,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:54:55,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:55,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:55,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 09:54:55,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:54:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:55,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:54:55,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:54:55,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744844275] [2025-03-04 09:54:55,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744844275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:55,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:55,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 09:54:55,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119776350] [2025-03-04 09:54:55,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:55,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 09:54:55,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:54:55,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 09:54:55,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:54:55,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:55,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:55,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:55,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:55,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:56,356 INFO L124 PetriNetUnfolderBase]: 2327/3546 cut-off events. [2025-03-04 09:54:56,356 INFO L125 PetriNetUnfolderBase]: For 2676/2676 co-relation queries the response was YES. [2025-03-04 09:54:56,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9086 conditions, 3546 events. 2327/3546 cut-off events. For 2676/2676 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17370 event pairs, 339 based on Foata normal form. 8/3553 useless extension candidates. Maximal degree in co-relation 9074. Up to 1405 conditions per place. [2025-03-04 09:54:56,372 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 57 selfloop transitions, 9 changer transitions 55/127 dead transitions. [2025-03-04 09:54:56,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 127 transitions, 695 flow [2025-03-04 09:54:56,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:54:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:54:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2025-03-04 09:54:56,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-04 09:54:56,374 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 10 states and 216 transitions. [2025-03-04 09:54:56,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 127 transitions, 695 flow [2025-03-04 09:54:56,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 127 transitions, 562 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-04 09:54:56,388 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 170 flow [2025-03-04 09:54:56,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=170, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-03-04 09:54:56,389 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2025-03-04 09:54:56,389 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 170 flow [2025-03-04 09:54:56,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:56,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:56,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:56,397 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-04 09:54:56,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:56,594 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-04 09:54:56,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:56,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2011862096, now seen corresponding path program 2 times [2025-03-04 09:54:56,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:56,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241763223] [2025-03-04 09:54:56,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:54:56,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:56,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:56,597 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:54:56,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:54:56,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:54:56,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:54:56,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:54:56,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:56,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 09:54:56,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:54:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:56,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:54:56,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:54:56,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241763223] [2025-03-04 09:54:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241763223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:56,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:54:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246499038] [2025-03-04 09:54:56,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:56,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:54:56,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:54:56,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:54:56,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:54:56,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:56,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 170 flow. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:56,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:56,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:56,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:57,263 INFO L124 PetriNetUnfolderBase]: 2193/3368 cut-off events. [2025-03-04 09:54:57,263 INFO L125 PetriNetUnfolderBase]: For 1264/1264 co-relation queries the response was YES. [2025-03-04 09:54:57,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8583 conditions, 3368 events. 2193/3368 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16361 event pairs, 343 based on Foata normal form. 8/3375 useless extension candidates. Maximal degree in co-relation 8568. Up to 1300 conditions per place. [2025-03-04 09:54:57,276 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 67 selfloop transitions, 9 changer transitions 26/108 dead transitions. [2025-03-04 09:54:57,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 108 transitions, 582 flow [2025-03-04 09:54:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:54:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:54:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-03-04 09:54:57,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2025-03-04 09:54:57,278 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 170 flow. Second operand 7 states and 157 transitions. [2025-03-04 09:54:57,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 108 transitions, 582 flow [2025-03-04 09:54:57,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 534 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-04 09:54:57,284 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 237 flow [2025-03-04 09:54:57,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=237, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2025-03-04 09:54:57,284 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-04 09:54:57,285 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 237 flow [2025-03-04 09:54:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:57,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:57,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:57,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 09:54:57,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:57,489 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-04 09:54:57,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:57,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1533434942, now seen corresponding path program 3 times [2025-03-04 09:54:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:57,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2099634454] [2025-03-04 09:54:57,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:54:57,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:57,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:57,496 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:54:57,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:54:57,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:54:57,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:54:57,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:54:57,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:57,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:54:57,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:54:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:57,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:54:57,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:54:57,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099634454] [2025-03-04 09:54:57,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099634454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:57,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:57,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:54:57,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664326456] [2025-03-04 09:54:57,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:57,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:54:57,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:54:57,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:54:57,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:54:57,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:57,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:57,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:57,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:57,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:57,927 INFO L124 PetriNetUnfolderBase]: 1669/2639 cut-off events. [2025-03-04 09:54:57,927 INFO L125 PetriNetUnfolderBase]: For 1161/1161 co-relation queries the response was YES. [2025-03-04 09:54:57,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6810 conditions, 2639 events. 1669/2639 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12374 event pairs, 419 based on Foata normal form. 8/2644 useless extension candidates. Maximal degree in co-relation 6795. Up to 1069 conditions per place. [2025-03-04 09:54:57,938 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 56 selfloop transitions, 12 changer transitions 33/107 dead transitions. [2025-03-04 09:54:57,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 107 transitions, 577 flow [2025-03-04 09:54:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:54:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:54:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-03-04 09:54:57,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-04 09:54:57,939 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 237 flow. Second operand 8 states and 171 transitions. [2025-03-04 09:54:57,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 107 transitions, 577 flow [2025-03-04 09:54:57,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 107 transitions, 555 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 09:54:57,942 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 220 flow [2025-03-04 09:54:57,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2025-03-04 09:54:57,943 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2025-03-04 09:54:57,943 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 220 flow [2025-03-04 09:54:57,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:57,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:57,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:57,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:54:58,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:58,144 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-04 09:54:58,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash -237960564, now seen corresponding path program 4 times [2025-03-04 09:54:58,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:58,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206712906] [2025-03-04 09:54:58,145 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:54:58,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:58,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:58,147 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-04 09:54:58,148 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-04 09:54:58,193 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 09:54:58,205 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-03-04 09:54:58,205 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 09:54:58,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:58,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 09:54:58,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:54:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:58,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:54:58,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:54:58,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206712906] [2025-03-04 09:54:58,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206712906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:58,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:58,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:54:58,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123512743] [2025-03-04 09:54:58,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:58,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:54:58,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:54:58,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:54:58,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:54:58,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:58,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:58,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:58,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:58,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:58,575 INFO L124 PetriNetUnfolderBase]: 1217/1936 cut-off events. [2025-03-04 09:54:58,576 INFO L125 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2025-03-04 09:54:58,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 1936 events. 1217/1936 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8381 event pairs, 299 based on Foata normal form. 8/1943 useless extension candidates. Maximal degree in co-relation 4958. Up to 1076 conditions per place. [2025-03-04 09:54:58,582 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 2 changer transitions 38/91 dead transitions. [2025-03-04 09:54:58,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 525 flow [2025-03-04 09:54:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:54:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:54:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2025-03-04 09:54:58,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43492063492063493 [2025-03-04 09:54:58,584 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 220 flow. Second operand 7 states and 137 transitions. [2025-03-04 09:54:58,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 525 flow [2025-03-04 09:54:58,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 91 transitions, 462 flow, removed 12 selfloop flow, removed 10 redundant places. [2025-03-04 09:54:58,587 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 171 flow [2025-03-04 09:54:58,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2025-03-04 09:54:58,588 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2025-03-04 09:54:58,588 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 171 flow [2025-03-04 09:54:58,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:58,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:58,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:58,595 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-04 09:54:58,789 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-04 09:54:58,789 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-04 09:54:58,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:58,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1041425594, now seen corresponding path program 5 times [2025-03-04 09:54:58,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:58,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257710185] [2025-03-04 09:54:58,790 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 09:54:58,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:58,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:58,792 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-04 09:54:58,793 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-04 09:54:58,848 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:54:58,866 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:54:58,866 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:54:58,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:54:58,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 09:54:58,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:54:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:54:59,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:54:59,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:54:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257710185] [2025-03-04 09:54:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257710185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:54:59,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:54:59,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:54:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915447849] [2025-03-04 09:54:59,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:54:59,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:54:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:54:59,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:54:59,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:54:59,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2025-03-04 09:54:59,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 171 flow. Second operand has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:59,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:54:59,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2025-03-04 09:54:59,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:54:59,498 INFO L124 PetriNetUnfolderBase]: 949/1587 cut-off events. [2025-03-04 09:54:59,498 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-03-04 09:54:59,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 1587 events. 949/1587 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7136 event pairs, 126 based on Foata normal form. 8/1594 useless extension candidates. Maximal degree in co-relation 3805. Up to 748 conditions per place. [2025-03-04 09:54:59,502 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 48 selfloop transitions, 4 changer transitions 47/105 dead transitions. [2025-03-04 09:54:59,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 563 flow [2025-03-04 09:54:59,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:54:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:54:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2025-03-04 09:54:59,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3977777777777778 [2025-03-04 09:54:59,504 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 171 flow. Second operand 10 states and 179 transitions. [2025-03-04 09:54:59,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 563 flow [2025-03-04 09:54:59,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 545 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-04 09:54:59,506 INFO L231 Difference]: Finished difference. Result has 69 places, 43 transitions, 163 flow [2025-03-04 09:54:59,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=10, PETRI_FLOW=163, PETRI_PLACES=69, PETRI_TRANSITIONS=43} [2025-03-04 09:54:59,507 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2025-03-04 09:54:59,507 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 43 transitions, 163 flow [2025-03-04 09:54:59,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:54:59,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:54:59,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:54:59,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 09:54:59,708 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-04 09:54:59,708 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-04 09:54:59,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:54:59,709 INFO L85 PathProgramCache]: Analyzing trace with hash 392032812, now seen corresponding path program 6 times [2025-03-04 09:54:59,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:54:59,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506363892] [2025-03-04 09:54:59,709 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 09:54:59,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:54:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:54:59,715 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-04 09:54:59,718 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-04 09:54:59,771 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:54:59,787 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:54:59,788 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 09:54:59,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:54:59,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 09:54:59,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 09:54:59,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 09:54:59,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:54:59,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 09:54:59,863 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 09:54:59,863 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 09:54:59,864 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 09:54:59,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 09:54:59,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-04 09:54:59,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 09:54:59,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-04 09:54:59,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-04 09:54:59,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 09:54:59,880 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-04 09:55:00,072 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-04 09:55:00,072 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2025-03-04 09:55:00,125 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:55:00,125 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:55:00,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:55:00 BasicIcfg [2025-03-04 09:55:00,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:55:00,130 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:55:00,130 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:55:00,131 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:55:00,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:54:50" (3/4) ... [2025-03-04 09:55:00,135 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 09:55:00,135 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:55:00,136 INFO L158 Benchmark]: Toolchain (without parser) took 10746.24ms. Allocated memory was 117.4MB in the beginning and 738.2MB in the end (delta: 620.8MB). Free memory was 90.4MB in the beginning and 493.3MB in the end (delta: -402.9MB). Peak memory consumption was 222.4MB. Max. memory is 16.1GB. [2025-03-04 09:55:00,137 INFO L158 Benchmark]: CDTParser took 1.36ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:00,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.28ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 67.1MB in the end (delta: 23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 09:55:00,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.77ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 65.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:00,137 INFO L158 Benchmark]: Boogie Preprocessor took 56.10ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 62.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:00,137 INFO L158 Benchmark]: IcfgBuilder took 668.60ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 46.8MB in the end (delta: 15.4MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2025-03-04 09:55:00,138 INFO L158 Benchmark]: TraceAbstraction took 9541.76ms. Allocated memory was 117.4MB in the beginning and 738.2MB in the end (delta: 620.8MB). Free memory was 46.1MB in the beginning and 493.3MB in the end (delta: -447.2MB). Peak memory consumption was 167.3MB. Max. memory is 16.1GB. [2025-03-04 09:55:00,138 INFO L158 Benchmark]: Witness Printer took 5.07ms. Allocated memory is still 738.2MB. Free memory was 493.3MB in the beginning and 493.3MB in the end (delta: 46.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:55:00,139 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.28ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 67.1MB in the end (delta: 23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.77ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 65.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.10ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 62.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 668.60ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 46.8MB in the end (delta: 15.4MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9541.76ms. Allocated memory was 117.4MB in the beginning and 738.2MB in the end (delta: 620.8MB). Free memory was 46.1MB in the beginning and 493.3MB in the end (delta: -447.2MB). Peak memory consumption was 167.3MB. Max. memory is 16.1GB. * Witness Printer took 5.07ms. Allocated memory is still 738.2MB. Free memory was 493.3MB in the beginning and 493.3MB in the end (delta: 46.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-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] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-1, t1898=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] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897=-1, t1898=0, t1899=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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 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, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L809] 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) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 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, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-1, t1898=0, t1899=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-1, t1898=0, t1899=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897=-1, t1898=0, t1899=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 610 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 599 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2102 IncrementalHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 2 mSDtfsCounter, 2102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=7, InterpolantAutomatonStates: 63, 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.0s InterpolantComputationTime, 267 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 1042 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1023 ConjunctsInSsa, 76 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-04 09:55:00,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample