./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:13:57,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:13:57,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:13:57,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:13:57,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:13:57,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:13:57,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:13:57,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:13:57,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:13:57,369 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:13:57,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:13:57,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:13:57,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:13:57,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:13:57,369 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:13:57,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:13:57,369 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:13:57,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:13:57,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:13:57,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:13:57,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:13:57,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:13:57,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:13:57,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:13:57,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:13:57,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:13:57,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:13:57,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:13:57,371 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2025-03-17 14:13:57,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:13:57,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:13:57,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:13:57,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:13:57,612 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:13:57,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:13:58,738 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3358628/932465e403a748d294f8f0995ca50a9b/FLAGdc5284f21 [2025-03-17 14:13:58,978 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:13:58,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:13:58,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3358628/932465e403a748d294f8f0995ca50a9b/FLAGdc5284f21 [2025-03-17 14:13:59,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3358628/932465e403a748d294f8f0995ca50a9b [2025-03-17 14:13:59,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:13:59,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:13:59,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:13:59,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:13:59,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:13:59,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cbc53c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59, skipping insertion in model container [2025-03-17 14:13:59,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:13:59,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:13:59,339 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:13:59,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:13:59,412 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:13:59,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59 WrapperNode [2025-03-17 14:13:59,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:13:59,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:13:59,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:13:59,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:13:59,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,444 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2025-03-17 14:13:59,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:13:59,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:13:59,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:13:59,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:13:59,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,476 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:13:59,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:13:59,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:13:59,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:13:59,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:13:59,497 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (1/1) ... [2025-03-17 14:13:59,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:13:59,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:13:59,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:13:59,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:13:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:13:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:13:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:13:59,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:13:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:13:59,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:13:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:13:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:13:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:13:59,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:13:59,548 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:13:59,634 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:13:59,635 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:13:59,862 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:13:59,863 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:14:00,030 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:14:00,031 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:14:00,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:00 BoogieIcfgContainer [2025-03-17 14:14:00,031 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:14:00,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:14:00,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:14:00,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:14:00,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:13:59" (1/3) ... [2025-03-17 14:14:00,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307116a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:14:00, skipping insertion in model container [2025-03-17 14:14:00,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:13:59" (2/3) ... [2025-03-17 14:14:00,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307116a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:14:00, skipping insertion in model container [2025-03-17 14:14:00,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:00" (3/3) ... [2025-03-17 14:14:00,040 INFO L128 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:14:00,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:14:00,055 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe029_power.opt_pso.opt_rmo.opt.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-17 14:14:00,055 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:14:00,098 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:14:00,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2025-03-17 14:14:00,153 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-03-17 14:14:00,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:14:00,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-17 14:14:00,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2025-03-17 14:14:00,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2025-03-17 14:14:00,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:14:00,179 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;@3d327484, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:14:00,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:14:00,183 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:14:00,183 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-17 14:14:00,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:14:00,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:00,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:14:00,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:00,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:00,187 INFO L85 PathProgramCache]: Analyzing trace with hash 993556694, now seen corresponding path program 1 times [2025-03-17 14:14:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:00,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927950520] [2025-03-17 14:14:00,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:00,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:14:00,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:14:00,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:00,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927950520] [2025-03-17 14:14:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927950520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:00,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:00,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:14:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736853241] [2025-03-17 14:14:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:00,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:14:00,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:00,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:14:00,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:14:00,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-17 14:14:00,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:00,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:00,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-17 14:14:00,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:00,793 INFO L124 PetriNetUnfolderBase]: 575/975 cut-off events. [2025-03-17 14:14:00,793 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:14:00,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 975 events. 575/975 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4509 event pairs, 55 based on Foata normal form. 72/1044 useless extension candidates. Maximal degree in co-relation 1931. Up to 821 conditions per place. [2025-03-17 14:14:00,802 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2025-03-17 14:14:00,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 166 flow [2025-03-17 14:14:00,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:14:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:14:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-17 14:14:00,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-17 14:14:00,816 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 66 transitions. [2025-03-17 14:14:00,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 166 flow [2025-03-17 14:14:00,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:14:00,821 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-03-17 14:14:00,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-03-17 14:14:00,826 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-03-17 14:14:00,827 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-03-17 14:14:00,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:00,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:00,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:00,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:14:00,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:00,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash 178616611, now seen corresponding path program 1 times [2025-03-17 14:14:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:00,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147402005] [2025-03-17 14:14:00,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:00,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:00,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:14:00,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:14:00,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:00,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147402005] [2025-03-17 14:14:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147402005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:00,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:14:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987559799] [2025-03-17 14:14:00,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:00,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:14:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:00,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:14:00,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:14:00,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:00,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:00,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:00,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:00,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:01,013 INFO L124 PetriNetUnfolderBase]: 515/957 cut-off events. [2025-03-17 14:14:01,014 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-17 14:14:01,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 957 events. 515/957 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4714 event pairs, 515 based on Foata normal form. 36/984 useless extension candidates. Maximal degree in co-relation 1871. Up to 852 conditions per place. [2025-03-17 14:14:01,020 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-03-17 14:14:01,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 106 flow [2025-03-17 14:14:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:14:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:14:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-17 14:14:01,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2025-03-17 14:14:01,021 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 44 transitions. [2025-03-17 14:14:01,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 106 flow [2025-03-17 14:14:01,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:14:01,022 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2025-03-17 14:14:01,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-03-17 14:14:01,022 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-03-17 14:14:01,022 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2025-03-17 14:14:01,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:01,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:01,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:01,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:14:01,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:01,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash 178617879, now seen corresponding path program 1 times [2025-03-17 14:14:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:01,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364055562] [2025-03-17 14:14:01,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:01,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:14:01,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:14:01,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:01,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:01,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:01,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364055562] [2025-03-17 14:14:01,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364055562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:01,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:01,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:14:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481093661] [2025-03-17 14:14:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:01,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:14:01,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:01,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:14:01,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:14:01,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:01,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:01,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:01,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:01,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:01,568 INFO L124 PetriNetUnfolderBase]: 645/1152 cut-off events. [2025-03-17 14:14:01,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:14:01,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2252 conditions, 1152 events. 645/1152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5738 event pairs, 273 based on Foata normal form. 0/1116 useless extension candidates. Maximal degree in co-relation 2246. Up to 722 conditions per place. [2025-03-17 14:14:01,573 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 27 selfloop transitions, 3 changer transitions 42/76 dead transitions. [2025-03-17 14:14:01,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 76 transitions, 304 flow [2025-03-17 14:14:01,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:14:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:14:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2025-03-17 14:14:01,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-17 14:14:01,575 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 8 states and 130 transitions. [2025-03-17 14:14:01,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 76 transitions, 304 flow [2025-03-17 14:14:01,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:14:01,577 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 90 flow [2025-03-17 14:14:01,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2025-03-17 14:14:01,579 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-03-17 14:14:01,579 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 90 flow [2025-03-17 14:14:01,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:01,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:01,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:01,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:14:01,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:01,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1407814442, now seen corresponding path program 1 times [2025-03-17 14:14:01,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:01,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831310276] [2025-03-17 14:14:01,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:01,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:01,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:14:01,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:14:01,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:01,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:02,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:02,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831310276] [2025-03-17 14:14:02,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831310276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:02,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:02,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:14:02,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568864187] [2025-03-17 14:14:02,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:02,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:14:02,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:02,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:14:02,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:14:02,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:02,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:02,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:02,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:02,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:02,290 INFO L124 PetriNetUnfolderBase]: 506/927 cut-off events. [2025-03-17 14:14:02,290 INFO L125 PetriNetUnfolderBase]: For 543/543 co-relation queries the response was YES. [2025-03-17 14:14:02,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 927 events. 506/927 cut-off events. For 543/543 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4429 event pairs, 232 based on Foata normal form. 30/954 useless extension candidates. Maximal degree in co-relation 2303. Up to 709 conditions per place. [2025-03-17 14:14:02,295 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 29 selfloop transitions, 3 changer transitions 25/61 dead transitions. [2025-03-17 14:14:02,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 299 flow [2025-03-17 14:14:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:14:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:14:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2025-03-17 14:14:02,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4326530612244898 [2025-03-17 14:14:02,297 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 90 flow. Second operand 7 states and 106 transitions. [2025-03-17 14:14:02,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 299 flow [2025-03-17 14:14:02,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 287 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-17 14:14:02,305 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 118 flow [2025-03-17 14:14:02,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=118, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2025-03-17 14:14:02,306 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2025-03-17 14:14:02,306 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 118 flow [2025-03-17 14:14:02,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:02,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:02,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:14:02,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash -153433689, now seen corresponding path program 1 times [2025-03-17 14:14:02,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:02,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820229586] [2025-03-17 14:14:02,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:02,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:14:02,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:14:02,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:02,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:02,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:02,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820229586] [2025-03-17 14:14:02,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820229586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:02,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:02,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:14:02,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537798948] [2025-03-17 14:14:02,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:02,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:14:02,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:02,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:14:02,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:14:02,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:02,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 118 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:02,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:02,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:02,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:02,830 INFO L124 PetriNetUnfolderBase]: 491/867 cut-off events. [2025-03-17 14:14:02,830 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2025-03-17 14:14:02,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2599 conditions, 867 events. 491/867 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3978 event pairs, 61 based on Foata normal form. 24/888 useless extension candidates. Maximal degree in co-relation 2583. Up to 637 conditions per place. [2025-03-17 14:14:02,835 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 45 selfloop transitions, 9 changer transitions 28/86 dead transitions. [2025-03-17 14:14:02,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 504 flow [2025-03-17 14:14:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:14:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:14:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 159 transitions. [2025-03-17 14:14:02,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.412987012987013 [2025-03-17 14:14:02,836 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 118 flow. Second operand 11 states and 159 transitions. [2025-03-17 14:14:02,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 504 flow [2025-03-17 14:14:02,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 483 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-03-17 14:14:02,843 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 186 flow [2025-03-17 14:14:02,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=186, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2025-03-17 14:14:02,843 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2025-03-17 14:14:02,843 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 186 flow [2025-03-17 14:14:02,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:02,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:02,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:02,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:14:02,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1874750625, now seen corresponding path program 2 times [2025-03-17 14:14:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538491958] [2025-03-17 14:14:02,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:14:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:02,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:14:02,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:14:02,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:14:02,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:03,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:03,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538491958] [2025-03-17 14:14:03,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538491958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:03,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:03,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:14:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419710012] [2025-03-17 14:14:03,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:03,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:14:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:03,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:14:03,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:14:03,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:03,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 186 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:03,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:03,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:03,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:03,634 INFO L124 PetriNetUnfolderBase]: 473/863 cut-off events. [2025-03-17 14:14:03,635 INFO L125 PetriNetUnfolderBase]: For 2363/2363 co-relation queries the response was YES. [2025-03-17 14:14:03,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 863 events. 473/863 cut-off events. For 2363/2363 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3917 event pairs, 81 based on Foata normal form. 24/884 useless extension candidates. Maximal degree in co-relation 3017. Up to 625 conditions per place. [2025-03-17 14:14:03,641 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 39 selfloop transitions, 9 changer transitions 29/81 dead transitions. [2025-03-17 14:14:03,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 560 flow [2025-03-17 14:14:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:14:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:14:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 154 transitions. [2025-03-17 14:14:03,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-17 14:14:03,643 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 186 flow. Second operand 11 states and 154 transitions. [2025-03-17 14:14:03,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 560 flow [2025-03-17 14:14:03,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 513 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-17 14:14:03,649 INFO L231 Difference]: Finished difference. Result has 64 places, 34 transitions, 206 flow [2025-03-17 14:14:03,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=206, PETRI_PLACES=64, PETRI_TRANSITIONS=34} [2025-03-17 14:14:03,652 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2025-03-17 14:14:03,652 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 34 transitions, 206 flow [2025-03-17 14:14:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:03,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:03,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:03,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:14:03,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:03,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:03,653 INFO L85 PathProgramCache]: Analyzing trace with hash -314603071, now seen corresponding path program 1 times [2025-03-17 14:14:03,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:03,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781257406] [2025-03-17 14:14:03,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:03,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:03,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:14:03,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:14:03,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:03,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:03,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-17 14:14:03,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:03,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781257406] [2025-03-17 14:14:03,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781257406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:03,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:03,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:14:03,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428177022] [2025-03-17 14:14:03,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:03,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:14:03,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:03,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:14:03,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:14:03,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:03,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 34 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:03,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:03,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:03,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:04,315 INFO L124 PetriNetUnfolderBase]: 551/991 cut-off events. [2025-03-17 14:14:04,315 INFO L125 PetriNetUnfolderBase]: For 3693/3693 co-relation queries the response was YES. [2025-03-17 14:14:04,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3633 conditions, 991 events. 551/991 cut-off events. For 3693/3693 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4662 event pairs, 116 based on Foata normal form. 29/1018 useless extension candidates. Maximal degree in co-relation 3605. Up to 699 conditions per place. [2025-03-17 14:14:04,320 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 37 selfloop transitions, 9 changer transitions 31/81 dead transitions. [2025-03-17 14:14:04,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 625 flow [2025-03-17 14:14:04,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:14:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:14:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2025-03-17 14:14:04,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2025-03-17 14:14:04,321 INFO L175 Difference]: Start difference. First operand has 64 places, 34 transitions, 206 flow. Second operand 7 states and 118 transitions. [2025-03-17 14:14:04,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 625 flow [2025-03-17 14:14:04,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 563 flow, removed 21 selfloop flow, removed 10 redundant places. [2025-03-17 14:14:04,327 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 260 flow [2025-03-17 14:14:04,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2025-03-17 14:14:04,327 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2025-03-17 14:14:04,327 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 260 flow [2025-03-17 14:14:04,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:04,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:04,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:04,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:14:04,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:04,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1678805445, now seen corresponding path program 2 times [2025-03-17 14:14:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:04,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107017410] [2025-03-17 14:14:04,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:14:04,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:04,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:14:04,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:14:04,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:14:04,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:04,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:04,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107017410] [2025-03-17 14:14:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107017410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:04,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:04,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:14:04,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704221897] [2025-03-17 14:14:04,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:04,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:14:04,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:04,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:14:04,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:14:04,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:04,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:04,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:04,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:04,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:04,711 INFO L124 PetriNetUnfolderBase]: 759/1356 cut-off events. [2025-03-17 14:14:04,712 INFO L125 PetriNetUnfolderBase]: For 5442/5442 co-relation queries the response was YES. [2025-03-17 14:14:04,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5590 conditions, 1356 events. 759/1356 cut-off events. For 5442/5442 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6855 event pairs, 187 based on Foata normal form. 44/1397 useless extension candidates. Maximal degree in co-relation 5563. Up to 591 conditions per place. [2025-03-17 14:14:04,720 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 46 selfloop transitions, 4 changer transitions 33/87 dead transitions. [2025-03-17 14:14:04,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 735 flow [2025-03-17 14:14:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:14:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:14:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2025-03-17 14:14:04,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-03-17 14:14:04,723 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 260 flow. Second operand 7 states and 119 transitions. [2025-03-17 14:14:04,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 735 flow [2025-03-17 14:14:04,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 699 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-17 14:14:04,733 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 261 flow [2025-03-17 14:14:04,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=7, PETRI_FLOW=261, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2025-03-17 14:14:04,733 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2025-03-17 14:14:04,733 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 261 flow [2025-03-17 14:14:04,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:04,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:04,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:04,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:14:04,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:04,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1943574284, now seen corresponding path program 1 times [2025-03-17 14:14:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:04,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787693288] [2025-03-17 14:14:04,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:04,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:14:04,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:14:04,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:04,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:05,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787693288] [2025-03-17 14:14:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787693288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:05,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:14:05,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783744858] [2025-03-17 14:14:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:05,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:14:05,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:05,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:14:05,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:14:05,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:05,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 40 transitions, 261 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:05,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:05,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:05,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:05,477 INFO L124 PetriNetUnfolderBase]: 774/1442 cut-off events. [2025-03-17 14:14:05,477 INFO L125 PetriNetUnfolderBase]: For 6994/6994 co-relation queries the response was YES. [2025-03-17 14:14:05,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5883 conditions, 1442 events. 774/1442 cut-off events. For 6994/6994 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7544 event pairs, 263 based on Foata normal form. 48/1487 useless extension candidates. Maximal degree in co-relation 5853. Up to 1024 conditions per place. [2025-03-17 14:14:05,486 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 51 selfloop transitions, 15 changer transitions 47/117 dead transitions. [2025-03-17 14:14:05,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 117 transitions, 1023 flow [2025-03-17 14:14:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:14:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:14:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 163 transitions. [2025-03-17 14:14:05,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42337662337662335 [2025-03-17 14:14:05,487 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 261 flow. Second operand 11 states and 163 transitions. [2025-03-17 14:14:05,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 117 transitions, 1023 flow [2025-03-17 14:14:05,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 972 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-17 14:14:05,496 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 421 flow [2025-03-17 14:14:05,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=421, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2025-03-17 14:14:05,497 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 35 predicate places. [2025-03-17 14:14:05,497 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 421 flow [2025-03-17 14:14:05,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:05,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:05,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:05,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:14:05,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:05,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:05,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2128543760, now seen corresponding path program 2 times [2025-03-17 14:14:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216518827] [2025-03-17 14:14:05,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:14:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:05,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:14:05,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:14:05,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:14:05,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:05,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:05,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216518827] [2025-03-17 14:14:05,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216518827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:05,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:05,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:14:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443730620] [2025-03-17 14:14:05,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:05,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:14:05,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:05,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:14:05,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:14:05,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:05,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 50 transitions, 421 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:05,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:05,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:05,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:06,206 INFO L124 PetriNetUnfolderBase]: 733/1371 cut-off events. [2025-03-17 14:14:06,206 INFO L125 PetriNetUnfolderBase]: For 10595/10595 co-relation queries the response was YES. [2025-03-17 14:14:06,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6687 conditions, 1371 events. 733/1371 cut-off events. For 10595/10595 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7139 event pairs, 229 based on Foata normal form. 48/1416 useless extension candidates. Maximal degree in co-relation 6651. Up to 1007 conditions per place. [2025-03-17 14:14:06,216 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 12 changer transitions 33/97 dead transitions. [2025-03-17 14:14:06,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 1047 flow [2025-03-17 14:14:06,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:14:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:14:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2025-03-17 14:14:06,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2025-03-17 14:14:06,218 INFO L175 Difference]: Start difference. First operand has 73 places, 50 transitions, 421 flow. Second operand 8 states and 121 transitions. [2025-03-17 14:14:06,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 1047 flow [2025-03-17 14:14:06,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 1023 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-17 14:14:06,230 INFO L231 Difference]: Finished difference. Result has 77 places, 53 transitions, 502 flow [2025-03-17 14:14:06,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=502, PETRI_PLACES=77, PETRI_TRANSITIONS=53} [2025-03-17 14:14:06,231 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 39 predicate places. [2025-03-17 14:14:06,231 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 502 flow [2025-03-17 14:14:06,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:06,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:06,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:06,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:14:06,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:06,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1337526975, now seen corresponding path program 1 times [2025-03-17 14:14:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:06,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398676795] [2025-03-17 14:14:06,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:06,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:14:06,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:14:06,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:06,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398676795] [2025-03-17 14:14:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398676795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:06,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:06,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:14:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208219637] [2025-03-17 14:14:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:06,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:14:06,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:06,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:14:06,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:14:06,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:06,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 53 transitions, 502 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:06,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:06,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:06,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:06,964 INFO L124 PetriNetUnfolderBase]: 732/1352 cut-off events. [2025-03-17 14:14:06,964 INFO L125 PetriNetUnfolderBase]: For 13996/13996 co-relation queries the response was YES. [2025-03-17 14:14:06,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7120 conditions, 1352 events. 732/1352 cut-off events. For 13996/13996 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6908 event pairs, 184 based on Foata normal form. 45/1394 useless extension candidates. Maximal degree in co-relation 7079. Up to 834 conditions per place. [2025-03-17 14:14:06,971 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 43 selfloop transitions, 17 changer transitions 52/116 dead transitions. [2025-03-17 14:14:06,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 116 transitions, 1285 flow [2025-03-17 14:14:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:14:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:14:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2025-03-17 14:14:06,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-03-17 14:14:06,973 INFO L175 Difference]: Start difference. First operand has 77 places, 53 transitions, 502 flow. Second operand 10 states and 155 transitions. [2025-03-17 14:14:06,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 116 transitions, 1285 flow [2025-03-17 14:14:06,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 116 transitions, 1212 flow, removed 29 selfloop flow, removed 6 redundant places. [2025-03-17 14:14:06,987 INFO L231 Difference]: Finished difference. Result has 81 places, 50 transitions, 516 flow [2025-03-17 14:14:06,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=516, PETRI_PLACES=81, PETRI_TRANSITIONS=50} [2025-03-17 14:14:06,988 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2025-03-17 14:14:06,988 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 50 transitions, 516 flow [2025-03-17 14:14:06,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:06,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:06,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:06,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:14:06,988 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:06,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2091952389, now seen corresponding path program 1 times [2025-03-17 14:14:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:06,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532822818] [2025-03-17 14:14:06,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:06,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:14:07,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:14:07,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:07,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:07,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:07,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532822818] [2025-03-17 14:14:07,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532822818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:07,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:07,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:14:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536818875] [2025-03-17 14:14:07,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:07,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:14:07,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:07,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:14:07,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:14:07,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:07,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 50 transitions, 516 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:07,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:07,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:07,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:07,869 INFO L124 PetriNetUnfolderBase]: 600/1129 cut-off events. [2025-03-17 14:14:07,869 INFO L125 PetriNetUnfolderBase]: For 12397/12397 co-relation queries the response was YES. [2025-03-17 14:14:07,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6001 conditions, 1129 events. 600/1129 cut-off events. For 12397/12397 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5674 event pairs, 193 based on Foata normal form. 15/1141 useless extension candidates. Maximal degree in co-relation 5959. Up to 787 conditions per place. [2025-03-17 14:14:07,876 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 43 selfloop transitions, 15 changer transitions 35/97 dead transitions. [2025-03-17 14:14:07,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 1078 flow [2025-03-17 14:14:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:14:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:14:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2025-03-17 14:14:07,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4085714285714286 [2025-03-17 14:14:07,877 INFO L175 Difference]: Start difference. First operand has 81 places, 50 transitions, 516 flow. Second operand 10 states and 143 transitions. [2025-03-17 14:14:07,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 1078 flow [2025-03-17 14:14:07,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 979 flow, removed 34 selfloop flow, removed 9 redundant places. [2025-03-17 14:14:07,894 INFO L231 Difference]: Finished difference. Result has 80 places, 48 transitions, 500 flow [2025-03-17 14:14:07,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=500, PETRI_PLACES=80, PETRI_TRANSITIONS=48} [2025-03-17 14:14:07,894 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2025-03-17 14:14:07,894 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 48 transitions, 500 flow [2025-03-17 14:14:07,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:07,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:07,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:07,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:14:07,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2014798285, now seen corresponding path program 2 times [2025-03-17 14:14:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:07,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660506454] [2025-03-17 14:14:07,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:14:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:07,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:14:07,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:14:07,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:14:07,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:08,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:08,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660506454] [2025-03-17 14:14:08,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660506454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:08,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:08,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:14:08,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062028671] [2025-03-17 14:14:08,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:08,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:14:08,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:08,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:14:08,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:14:08,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:08,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 48 transitions, 500 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:08,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:08,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:08,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:08,392 INFO L124 PetriNetUnfolderBase]: 522/1012 cut-off events. [2025-03-17 14:14:08,393 INFO L125 PetriNetUnfolderBase]: For 10097/10097 co-relation queries the response was YES. [2025-03-17 14:14:08,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5106 conditions, 1012 events. 522/1012 cut-off events. For 10097/10097 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5253 event pairs, 79 based on Foata normal form. 53/1062 useless extension candidates. Maximal degree in co-relation 5065. Up to 630 conditions per place. [2025-03-17 14:14:08,400 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 46 selfloop transitions, 4 changer transitions 8/62 dead transitions. [2025-03-17 14:14:08,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 62 transitions, 708 flow [2025-03-17 14:14:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:14:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:14:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-17 14:14:08,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2025-03-17 14:14:08,402 INFO L175 Difference]: Start difference. First operand has 80 places, 48 transitions, 500 flow. Second operand 5 states and 76 transitions. [2025-03-17 14:14:08,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 62 transitions, 708 flow [2025-03-17 14:14:08,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 591 flow, removed 26 selfloop flow, removed 16 redundant places. [2025-03-17 14:14:08,416 INFO L231 Difference]: Finished difference. Result has 66 places, 37 transitions, 302 flow [2025-03-17 14:14:08,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=66, PETRI_TRANSITIONS=37} [2025-03-17 14:14:08,417 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2025-03-17 14:14:08,417 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 37 transitions, 302 flow [2025-03-17 14:14:08,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:08,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:08,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:08,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:14:08,418 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash 174726617, now seen corresponding path program 3 times [2025-03-17 14:14:08,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:08,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573225099] [2025-03-17 14:14:08,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:14:08,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:08,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:14:08,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:14:08,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:14:08,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:08,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573225099] [2025-03-17 14:14:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573225099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:08,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:08,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:14:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788150131] [2025-03-17 14:14:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:08,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:14:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:08,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:14:08,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:14:08,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:08,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 37 transitions, 302 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:08,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:08,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:08,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:09,313 INFO L124 PetriNetUnfolderBase]: 674/1239 cut-off events. [2025-03-17 14:14:09,313 INFO L125 PetriNetUnfolderBase]: For 7840/7840 co-relation queries the response was YES. [2025-03-17 14:14:09,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5556 conditions, 1239 events. 674/1239 cut-off events. For 7840/7840 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6391 event pairs, 131 based on Foata normal form. 39/1275 useless extension candidates. Maximal degree in co-relation 5524. Up to 473 conditions per place. [2025-03-17 14:14:09,319 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 39 selfloop transitions, 10 changer transitions 40/93 dead transitions. [2025-03-17 14:14:09,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 93 transitions, 900 flow [2025-03-17 14:14:09,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:14:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:14:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2025-03-17 14:14:09,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2025-03-17 14:14:09,321 INFO L175 Difference]: Start difference. First operand has 66 places, 37 transitions, 302 flow. Second operand 12 states and 164 transitions. [2025-03-17 14:14:09,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 93 transitions, 900 flow [2025-03-17 14:14:09,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 781 flow, removed 46 selfloop flow, removed 9 redundant places. [2025-03-17 14:14:09,329 INFO L231 Difference]: Finished difference. Result has 73 places, 33 transitions, 274 flow [2025-03-17 14:14:09,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=274, PETRI_PLACES=73, PETRI_TRANSITIONS=33} [2025-03-17 14:14:09,330 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 35 predicate places. [2025-03-17 14:14:09,330 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 33 transitions, 274 flow [2025-03-17 14:14:09,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:09,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:09,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:09,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:14:09,331 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:09,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:09,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1954066709, now seen corresponding path program 1 times [2025-03-17 14:14:09,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:09,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354334853] [2025-03-17 14:14:09,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:09,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:14:09,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:14:09,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:09,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:09,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:09,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354334853] [2025-03-17 14:14:09,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354334853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:09,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:09,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:14:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184031394] [2025-03-17 14:14:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:09,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:14:09,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:09,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:14:09,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:14:09,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-17 14:14:09,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 33 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:09,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:09,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-17 14:14:09,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:09,517 INFO L124 PetriNetUnfolderBase]: 282/578 cut-off events. [2025-03-17 14:14:09,517 INFO L125 PetriNetUnfolderBase]: For 3970/3970 co-relation queries the response was YES. [2025-03-17 14:14:09,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 578 events. 282/578 cut-off events. For 3970/3970 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2615 event pairs, 49 based on Foata normal form. 37/614 useless extension candidates. Maximal degree in co-relation 2429. Up to 314 conditions per place. [2025-03-17 14:14:09,521 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 37 selfloop transitions, 4 changer transitions 5/50 dead transitions. [2025-03-17 14:14:09,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 50 transitions, 551 flow [2025-03-17 14:14:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:14:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:14:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-17 14:14:09,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-03-17 14:14:09,522 INFO L175 Difference]: Start difference. First operand has 73 places, 33 transitions, 274 flow. Second operand 4 states and 71 transitions. [2025-03-17 14:14:09,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 50 transitions, 551 flow [2025-03-17 14:14:09,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 442 flow, removed 51 selfloop flow, removed 14 redundant places. [2025-03-17 14:14:09,526 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 239 flow [2025-03-17 14:14:09,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2025-03-17 14:14:09,527 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-03-17 14:14:09,527 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 239 flow [2025-03-17 14:14:09,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:09,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:09,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:09,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:14:09,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:09,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1193680785, now seen corresponding path program 1 times [2025-03-17 14:14:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:09,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821905104] [2025-03-17 14:14:09,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:09,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:09,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:14:09,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:14:09,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:09,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:09,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:14:09,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821905104] [2025-03-17 14:14:09,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821905104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:09,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:14:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708828187] [2025-03-17 14:14:09,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:09,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:14:09,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:14:09,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:14:09,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:14:09,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-17 14:14:09,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 34 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:09,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:09,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-17 14:14:09,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:09,690 INFO L124 PetriNetUnfolderBase]: 140/291 cut-off events. [2025-03-17 14:14:09,690 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2025-03-17 14:14:09,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 291 events. 140/291 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1002 event pairs, 20 based on Foata normal form. 26/316 useless extension candidates. Maximal degree in co-relation 1056. Up to 111 conditions per place. [2025-03-17 14:14:09,692 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 27 selfloop transitions, 6 changer transitions 9/46 dead transitions. [2025-03-17 14:14:09,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 46 transitions, 399 flow [2025-03-17 14:14:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:14:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:14:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-17 14:14:09,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2025-03-17 14:14:09,694 INFO L175 Difference]: Start difference. First operand has 58 places, 34 transitions, 239 flow. Second operand 5 states and 76 transitions. [2025-03-17 14:14:09,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 46 transitions, 399 flow [2025-03-17 14:14:09,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 311 flow, removed 36 selfloop flow, removed 11 redundant places. [2025-03-17 14:14:09,696 INFO L231 Difference]: Finished difference. Result has 53 places, 29 transitions, 154 flow [2025-03-17 14:14:09,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=29} [2025-03-17 14:14:09,696 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-03-17 14:14:09,696 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 29 transitions, 154 flow [2025-03-17 14:14:09,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:09,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:09,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:09,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:14:09,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:09,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:09,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1595054207, now seen corresponding path program 1 times [2025-03-17 14:14:09,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:14:09,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828112925] [2025-03-17 14:14:09,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:14:09,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:14:09,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:14:09,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:09,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:14:09,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:14:09,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:14:09,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:14:09,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:09,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:14:09,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:14:09,792 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:14:09,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-03-17 14:14:09,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-17 14:14:09,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-17 14:14:09,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-17 14:14:09,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-17 14:14:09,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-17 14:14:09,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:14:09,799 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:09,845 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:14:09,845 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:14:09,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:14:09 BasicIcfg [2025-03-17 14:14:09,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:14:09,850 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:14:09,850 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:14:09,850 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:14:09,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:00" (3/4) ... [2025-03-17 14:14:09,852 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:14:09,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:14:09,853 INFO L158 Benchmark]: Toolchain (without parser) took 10849.43ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 104.6MB in the beginning and 170.8MB in the end (delta: -66.3MB). Peak memory consumption was 270.1MB. Max. memory is 16.1GB. [2025-03-17 14:14:09,853 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:14:09,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.34ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 82.4MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:14:09,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.57ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 79.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:14:09,854 INFO L158 Benchmark]: Boogie Preprocessor took 50.74ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:14:09,854 INFO L158 Benchmark]: IcfgBuilder took 535.53ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 99.6MB in the end (delta: -22.7MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2025-03-17 14:14:09,855 INFO L158 Benchmark]: TraceAbstraction took 9815.82ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 99.6MB in the beginning and 170.9MB in the end (delta: -71.4MB). Peak memory consumption was 264.2MB. Max. memory is 16.1GB. [2025-03-17 14:14:09,855 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 478.2MB. Free memory was 170.9MB in the beginning and 170.8MB in the end (delta: 99.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:14:09,856 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.34ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 82.4MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.57ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 79.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.74ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 535.53ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 99.6MB in the end (delta: -22.7MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9815.82ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 99.6MB in the beginning and 170.9MB in the end (delta: -71.4MB). Peak memory consumption was 264.2MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 478.2MB. Free memory was 170.9MB in the beginning and 170.8MB in the end (delta: 99.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-2, t2476=-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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 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) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 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 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 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}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 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}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe029_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 50 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 697 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 689 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2544 IncrementalHoareTripleChecker+Invalid, 2645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 3 mSDtfsCounter, 2544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=516occurred in iteration=11, InterpolantAutomatonStates: 122, 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, 4.2s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 1973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 14:14:09,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:14:11,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:14:11,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 14:14:11,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:14:11,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:14:11,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:14:11,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:14:11,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:14:11,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:14:11,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:14:11,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:14:11,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:14:11,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:14:11,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:14:11,770 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:14:11,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:14:11,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:14:11,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:14:11,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:14:11,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:14:11,773 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:14:11,773 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:14:11,773 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:14:11,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:14:11,773 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:14:11,773 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:14:11,773 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:14:11,773 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:14:11,773 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:14:11,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:14:11,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:14:11,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:14:11,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:14:11,774 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 -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2025-03-17 14:14:12,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:14:12,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:14:12,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:14:12,014 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:14:12,014 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:14:12,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:14:13,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44123962f/57116a4dbd004cd19f03aa9afc7b4a99/FLAG7fbf1f04f [2025-03-17 14:14:13,474 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:14:13,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:14:13,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44123962f/57116a4dbd004cd19f03aa9afc7b4a99/FLAG7fbf1f04f [2025-03-17 14:14:13,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44123962f/57116a4dbd004cd19f03aa9afc7b4a99 [2025-03-17 14:14:13,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:14:13,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:14:13,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:14:13,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:14:13,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:14:13,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:14:13" (1/1) ... [2025-03-17 14:14:13,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e1b7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:13, skipping insertion in model container [2025-03-17 14:14:13,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:14:13" (1/1) ... [2025-03-17 14:14:13,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:14:14,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:14:14,132 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:14:14,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:14:14,218 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:14:14,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14 WrapperNode [2025-03-17 14:14:14,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:14:14,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:14:14,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:14:14,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:14:14,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,253 INFO L138 Inliner]: procedures = 175, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2025-03-17 14:14:14,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:14:14,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:14:14,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:14:14,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:14:14,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,270 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:14:14,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:14:14,287 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:14:14,287 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:14:14,287 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:14:14,288 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (1/1) ... [2025-03-17 14:14:14,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:14:14,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:14:14,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:14:14,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:14:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:14:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:14:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 14:14:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:14:14,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:14:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:14:14,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:14:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:14:14,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:14:14,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:14:14,339 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:14:14,452 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:14:14,454 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:14:14,722 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:14:14,722 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:14:14,879 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:14:14,880 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:14:14,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:14 BoogieIcfgContainer [2025-03-17 14:14:14,880 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:14:14,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:14:14,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:14:14,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:14:14,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:14:13" (1/3) ... [2025-03-17 14:14:14,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6743ffdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:14:14, skipping insertion in model container [2025-03-17 14:14:14,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:14:14" (2/3) ... [2025-03-17 14:14:14,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6743ffdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:14:14, skipping insertion in model container [2025-03-17 14:14:14,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:14" (3/3) ... [2025-03-17 14:14:14,887 INFO L128 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2025-03-17 14:14:14,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:14:14,898 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe029_power.opt_pso.opt_rmo.opt.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-17 14:14:14,898 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:14:14,932 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:14:14,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2025-03-17 14:14:14,971 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-03-17 14:14:14,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:14:14,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-17 14:14:14,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2025-03-17 14:14:14,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2025-03-17 14:14:14,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:14:14,996 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;@73e7f564, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:14:14,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:14:14,999 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:14:15,013 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-17 14:14:15,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:14:15,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:15,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:14:15,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:15,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1052723606, now seen corresponding path program 1 times [2025-03-17 14:14:15,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:14:15,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [276689486] [2025-03-17 14:14:15,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:15,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:15,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:14:15,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:14:15,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:14:15,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:14:15,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:14:15,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:15,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:15,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:14:15,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:14:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:15,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:14:15,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:14:15,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276689486] [2025-03-17 14:14:15,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276689486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:15,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:15,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:14:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966813665] [2025-03-17 14:14:15,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:15,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:14:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:14:15,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:14:15,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:14:15,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-17 14:14:15,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:15,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:15,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-17 14:14:15,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:15,384 INFO L124 PetriNetUnfolderBase]: 575/975 cut-off events. [2025-03-17 14:14:15,385 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:14:15,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 975 events. 575/975 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4509 event pairs, 55 based on Foata normal form. 72/1044 useless extension candidates. Maximal degree in co-relation 1931. Up to 821 conditions per place. [2025-03-17 14:14:15,392 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2025-03-17 14:14:15,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 166 flow [2025-03-17 14:14:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:14:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:14:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-17 14:14:15,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-17 14:14:15,408 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 66 transitions. [2025-03-17 14:14:15,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 166 flow [2025-03-17 14:14:15,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:14:15,415 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-03-17 14:14:15,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-03-17 14:14:15,420 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-03-17 14:14:15,422 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-03-17 14:14:15,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:15,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:15,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:15,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:14:15,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:15,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:15,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:15,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1862899621, now seen corresponding path program 1 times [2025-03-17 14:14:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:14:15,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509346294] [2025-03-17 14:14:15,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:15,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:15,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:14:15,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:14:15,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:14:15,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:14:15,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:14:15,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:15,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:15,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:14:15,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:14:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:15,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:14:15,723 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:14:15,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509346294] [2025-03-17 14:14:15,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509346294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:15,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:15,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:14:15,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743607825] [2025-03-17 14:14:15,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:15,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:14:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:14:15,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:14:15,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:14:15,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-03-17 14:14:15,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:15,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:15,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-03-17 14:14:15,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:15,833 INFO L124 PetriNetUnfolderBase]: 515/957 cut-off events. [2025-03-17 14:14:15,833 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-17 14:14:15,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 957 events. 515/957 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4720 event pairs, 515 based on Foata normal form. 36/984 useless extension candidates. Maximal degree in co-relation 1871. Up to 852 conditions per place. [2025-03-17 14:14:15,839 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-03-17 14:14:15,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 106 flow [2025-03-17 14:14:15,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:14:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:14:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-17 14:14:15,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2025-03-17 14:14:15,842 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 44 transitions. [2025-03-17 14:14:15,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 106 flow [2025-03-17 14:14:15,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:14:15,843 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2025-03-17 14:14:15,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-03-17 14:14:15,844 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-03-17 14:14:15,844 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2025-03-17 14:14:15,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:15,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:15,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:15,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:14:16,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:16,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:16,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1862900889, now seen corresponding path program 1 times [2025-03-17 14:14:16,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:14:16,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [130882693] [2025-03-17 14:14:16,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:16,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:16,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:14:16,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:14:16,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:14:16,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:14:16,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:14:16,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:16,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:16,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:14:16,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:14:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:16,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:14:16,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:14:16,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130882693] [2025-03-17 14:14:16,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130882693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:16,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:16,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:14:16,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216170577] [2025-03-17 14:14:16,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:16,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:14:16,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:14:16,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:14:16,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:14:16,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-17 14:14:16,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:16,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:16,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-17 14:14:16,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:16,282 INFO L124 PetriNetUnfolderBase]: 303/607 cut-off events. [2025-03-17 14:14:16,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:14:16,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 607 events. 303/607 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2742 event pairs, 69 based on Foata normal form. 36/640 useless extension candidates. Maximal degree in co-relation 1163. Up to 289 conditions per place. [2025-03-17 14:14:16,285 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 38 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-03-17 14:14:16,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 190 flow [2025-03-17 14:14:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:14:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:14:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-03-17 14:14:16,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-17 14:14:16,289 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 4 states and 77 transitions. [2025-03-17 14:14:16,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 190 flow [2025-03-17 14:14:16,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:14:16,291 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 83 flow [2025-03-17 14:14:16,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-03-17 14:14:16,292 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-03-17 14:14:16,292 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 83 flow [2025-03-17 14:14:16,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:16,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:16,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:16,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:14:16,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:16,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:16,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2004592968, now seen corresponding path program 1 times [2025-03-17 14:14:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:14:16,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221760929] [2025-03-17 14:14:16,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:16,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:16,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:14:16,496 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:14:16,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:14:16,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:14:16,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:14:16,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:16,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:16,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:14:16,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:14:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:16,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:14:16,594 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:14:16,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221760929] [2025-03-17 14:14:16,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221760929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:16,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:16,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:14:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698830561] [2025-03-17 14:14:16,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:16,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:14:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:14:16,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:14:16,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:14:16,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-17 14:14:16,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:16,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:16,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-17 14:14:16,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:16,706 INFO L124 PetriNetUnfolderBase]: 143/287 cut-off events. [2025-03-17 14:14:16,707 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-17 14:14:16,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 287 events. 143/287 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 941 event pairs, 47 based on Foata normal form. 20/304 useless extension candidates. Maximal degree in co-relation 667. Up to 116 conditions per place. [2025-03-17 14:14:16,708 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 31 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2025-03-17 14:14:16,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 194 flow [2025-03-17 14:14:16,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:14:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:14:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-17 14:14:16,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-03-17 14:14:16,709 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 83 flow. Second operand 5 states and 80 transitions. [2025-03-17 14:14:16,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 194 flow [2025-03-17 14:14:16,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 185 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:14:16,711 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 99 flow [2025-03-17 14:14:16,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2025-03-17 14:14:16,712 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2025-03-17 14:14:16,712 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 99 flow [2025-03-17 14:14:16,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:16,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:16,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:16,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:14:16,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:16,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:16,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1447939455, now seen corresponding path program 1 times [2025-03-17 14:14:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:14:16,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664750794] [2025-03-17 14:14:16,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:14:16,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:16,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:14:16,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:14:16,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:14:16,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:14:16,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:14:16,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:16,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:16,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:14:16,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:14:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:17,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:14:17,109 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:14:17,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664750794] [2025-03-17 14:14:17,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664750794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:17,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:17,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:14:17,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639957766] [2025-03-17 14:14:17,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:17,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:14:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:14:17,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:14:17,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:14:17,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-17 14:14:17,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 99 flow. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:17,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:17,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-17 14:14:17,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:17,386 INFO L124 PetriNetUnfolderBase]: 213/441 cut-off events. [2025-03-17 14:14:17,388 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2025-03-17 14:14:17,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 441 events. 213/441 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1713 event pairs, 59 based on Foata normal form. 8/446 useless extension candidates. Maximal degree in co-relation 1075. Up to 139 conditions per place. [2025-03-17 14:14:17,390 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 26 selfloop transitions, 7 changer transitions 42/80 dead transitions. [2025-03-17 14:14:17,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 405 flow [2025-03-17 14:14:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:14:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:14:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 173 transitions. [2025-03-17 14:14:17,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4119047619047619 [2025-03-17 14:14:17,391 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 99 flow. Second operand 12 states and 173 transitions. [2025-03-17 14:14:17,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 405 flow [2025-03-17 14:14:17,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 80 transitions, 339 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-17 14:14:17,394 INFO L231 Difference]: Finished difference. Result has 54 places, 30 transitions, 111 flow [2025-03-17 14:14:17,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=111, PETRI_PLACES=54, PETRI_TRANSITIONS=30} [2025-03-17 14:14:17,394 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2025-03-17 14:14:17,394 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 30 transitions, 111 flow [2025-03-17 14:14:17,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:17,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:17,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:17,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:14:17,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:17,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:17,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:17,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1393810561, now seen corresponding path program 2 times [2025-03-17 14:14:17,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:14:17,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [169883314] [2025-03-17 14:14:17,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:14:17,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:17,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:14:17,605 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:14:17,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:14:17,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:14:17,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:14:17,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:14:17,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:14:17,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:14:17,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:14:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:14:17,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:14:17,930 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:14:17,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169883314] [2025-03-17 14:14:17,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169883314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:14:17,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:14:17,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:14:17,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902385596] [2025-03-17 14:14:17,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:14:17,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:14:17,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:14:17,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:14:17,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:14:17,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-03-17 14:14:17,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 30 transitions, 111 flow. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:17,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:14:17,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-03-17 14:14:17,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:14:18,119 INFO L124 PetriNetUnfolderBase]: 121/262 cut-off events. [2025-03-17 14:14:18,119 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-17 14:14:18,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 262 events. 121/262 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 852 event pairs, 51 based on Foata normal form. 4/265 useless extension candidates. Maximal degree in co-relation 638. Up to 140 conditions per place. [2025-03-17 14:14:18,121 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 24 selfloop transitions, 3 changer transitions 18/50 dead transitions. [2025-03-17 14:14:18,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 268 flow [2025-03-17 14:14:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:14:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:14:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2025-03-17 14:14:18,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39183673469387753 [2025-03-17 14:14:18,123 INFO L175 Difference]: Start difference. First operand has 54 places, 30 transitions, 111 flow. Second operand 7 states and 96 transitions. [2025-03-17 14:14:18,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 268 flow [2025-03-17 14:14:18,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 222 flow, removed 16 selfloop flow, removed 10 redundant places. [2025-03-17 14:14:18,126 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 91 flow [2025-03-17 14:14:18,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=91, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2025-03-17 14:14:18,127 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-03-17 14:14:18,128 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 91 flow [2025-03-17 14:14:18,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:14:18,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:14:18,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:14:18,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:14:18,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:18,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-03-17 14:14:18,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:14:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1689823969, now seen corresponding path program 3 times [2025-03-17 14:14:18,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:14:18,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675797989] [2025-03-17 14:14:18,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:14:18,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:18,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:14:18,333 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:14:18,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:14:18,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:14:18,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:14:18,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:14:18,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:14:18,389 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:14:18,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:14:18,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:14:18,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:14:18,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:14:18,442 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 14:14:18,442 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:14:18,442 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-03-17 14:14:18,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-17 14:14:18,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-03-17 14:14:18,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-17 14:14:18,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-17 14:14:18,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-03-17 14:14:18,450 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-17 14:14:18,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:14:18,645 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-03-17 14:14:18,692 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:14:18,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:14:18,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:14:18 BasicIcfg [2025-03-17 14:14:18,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:14:18,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:14:18,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:14:18,697 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:14:18,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:14:14" (3/4) ... [2025-03-17 14:14:18,701 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:14:18,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:14:18,703 INFO L158 Benchmark]: Toolchain (without parser) took 4913.93ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 89.7MB in the beginning and 91.5MB in the end (delta: -1.8MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2025-03-17 14:14:18,703 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:14:18,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.59ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 66.9MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:14:18,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.14ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 64.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:14:18,703 INFO L158 Benchmark]: Boogie Preprocessor took 32.97ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 62.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:14:18,703 INFO L158 Benchmark]: IcfgBuilder took 592.76ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 56.3MB in the end (delta: 5.9MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2025-03-17 14:14:18,703 INFO L158 Benchmark]: TraceAbstraction took 3815.41ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 56.3MB in the beginning and 91.5MB in the end (delta: -35.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:14:18,704 INFO L158 Benchmark]: Witness Printer took 4.57ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 91.5MB in the end (delta: 8.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:14:18,705 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.79ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.59ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 66.9MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.14ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 64.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.97ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 62.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 592.76ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 56.3MB in the end (delta: 5.9MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3815.41ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 56.3MB in the beginning and 91.5MB in the end (delta: -35.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.57ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 91.5MB in the end (delta: 8.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, t2476=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 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) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 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 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 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}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 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}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe029_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 locations, 50 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 193 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 647 IncrementalHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 0 mSDtfsCounter, 647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 13 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 14:14:18,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample