./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:51:05,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:51:05,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:51:05,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:51:05,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:51:05,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:51:05,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:51:05,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:51:05,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:51:05,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:51:05,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:51:05,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:51:05,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:51:05,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:51:05,727 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:51:05,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:51:05,728 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:51:05,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:51:05,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:51:05,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:51:05,730 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2025-02-06 12:51:05,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:51:05,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:51:05,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:51:05,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:51:05,971 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:51:05,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2025-02-06 12:51:07,105 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c02806db/1604b8fc4e2d433794fe5963afc6ff0a/FLAG4f7a5959b [2025-02-06 12:51:07,415 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:51:07,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2025-02-06 12:51:07,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c02806db/1604b8fc4e2d433794fe5963afc6ff0a/FLAG4f7a5959b [2025-02-06 12:51:07,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c02806db/1604b8fc4e2d433794fe5963afc6ff0a [2025-02-06 12:51:07,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:51:07,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:51:07,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:51:07,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:51:07,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:51:07,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9497a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07, skipping insertion in model container [2025-02-06 12:51:07,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:51:07,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:51:07,764 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:51:07,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:51:07,833 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:51:07,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07 WrapperNode [2025-02-06 12:51:07,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:51:07,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:51:07,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:51:07,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:51:07,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,867 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2025-02-06 12:51:07,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:51:07,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:51:07,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:51:07,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:51:07,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,891 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:51:07,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:51:07,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:51:07,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:51:07,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:51:07,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (1/1) ... [2025-02-06 12:51:07,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:51:07,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:07,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:51:07,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:51:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:51:07,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:51:07,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:51:07,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:51:07,957 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:51:08,064 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:51:08,065 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:51:08,287 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:51:08,287 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:51:08,454 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:51:08,455 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:51:08,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:08 BoogieIcfgContainer [2025-02-06 12:51:08,455 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:51:08,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:51:08,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:51:08,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:51:08,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:51:07" (1/3) ... [2025-02-06 12:51:08,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2398411f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:51:08, skipping insertion in model container [2025-02-06 12:51:08,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:07" (2/3) ... [2025-02-06 12:51:08,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2398411f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:51:08, skipping insertion in model container [2025-02-06 12:51:08,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:08" (3/3) ... [2025-02-06 12:51:08,464 INFO L128 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2025-02-06 12:51:08,474 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:51:08,476 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-02-06 12:51:08,477 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:51:08,517 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:51:08,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2025-02-06 12:51:08,565 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-02-06 12:51:08,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:08,571 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 53 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-02-06 12:51:08,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2025-02-06 12:51:08,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2025-02-06 12:51:08,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:51:08,591 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;@717db8e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:51:08,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:51:08,598 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:51:08,598 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-06 12:51:08,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:08,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:08,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:51:08,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:51:08,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:08,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1112811124, now seen corresponding path program 1 times [2025-02-06 12:51:08,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:08,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121707764] [2025-02-06 12:51:08,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:08,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:51:08,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:51:08,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:08,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121707764] [2025-02-06 12:51:08,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121707764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:08,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:08,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:51:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625657119] [2025-02-06 12:51:08,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:08,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:51:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:08,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:51:08,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:51:08,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:51:08,932 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-02-06 12:51:08,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:08,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:51:08,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:09,190 INFO L124 PetriNetUnfolderBase]: 575/975 cut-off events. [2025-02-06 12:51:09,191 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:51:09,194 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 4500 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-02-06 12:51:09,200 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2025-02-06 12:51:09,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 166 flow [2025-02-06 12:51:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:51:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:51:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-02-06 12:51:09,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-02-06 12:51:09,213 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 66 transitions. [2025-02-06 12:51:09,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 166 flow [2025-02-06 12:51:09,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:51:09,219 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-02-06 12:51:09,221 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-02-06 12:51:09,225 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-02-06 12:51:09,225 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-02-06 12:51:09,225 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-02-06 12:51:09,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:09,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:09,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:51:09,226 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-02-06 12:51:09,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1426089647, now seen corresponding path program 1 times [2025-02-06 12:51:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552911005] [2025-02-06 12:51:09,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:09,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:51:09,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:51:09,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:09,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:09,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:09,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552911005] [2025-02-06 12:51:09,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552911005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:09,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:09,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:51:09,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481248486] [2025-02-06 12:51:09,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:09,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:51:09,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:09,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:51:09,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:51:09,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 12:51:09,315 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-02-06 12:51:09,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:09,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 12:51:09,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:09,450 INFO L124 PetriNetUnfolderBase]: 515/957 cut-off events. [2025-02-06 12:51:09,450 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:51:09,455 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 4729 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-02-06 12:51:09,458 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-02-06 12:51:09,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 106 flow [2025-02-06 12:51:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:51:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:51:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-06 12:51:09,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2025-02-06 12:51:09,461 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 44 transitions. [2025-02-06 12:51:09,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 106 flow [2025-02-06 12:51:09,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:51:09,462 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2025-02-06 12:51:09,462 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-02-06 12:51:09,463 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-02-06 12:51:09,463 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2025-02-06 12:51:09,463 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-02-06 12:51:09,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:09,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:09,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:51:09,463 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-02-06 12:51:09,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1426088977, now seen corresponding path program 1 times [2025-02-06 12:51:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:09,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23681757] [2025-02-06 12:51:09,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:09,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:09,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:51:09,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:51:09,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:09,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:09,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:09,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23681757] [2025-02-06 12:51:09,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23681757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:09,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:09,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:51:09,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766699060] [2025-02-06 12:51:09,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:09,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:51:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:09,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:51:09,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:51:09,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 12:51:09,781 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-02-06 12:51:09,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:09,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 12:51:09,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:10,078 INFO L124 PetriNetUnfolderBase]: 645/1152 cut-off events. [2025-02-06 12:51:10,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:10,080 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 5741 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-02-06 12:51:10,083 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 27 selfloop transitions, 3 changer transitions 42/76 dead transitions. [2025-02-06 12:51:10,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 76 transitions, 304 flow [2025-02-06 12:51:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:51:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:51:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2025-02-06 12:51:10,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-02-06 12:51:10,086 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 8 states and 130 transitions. [2025-02-06 12:51:10,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 76 transitions, 304 flow [2025-02-06 12:51:10,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:51:10,088 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 90 flow [2025-02-06 12:51:10,088 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-02-06 12:51:10,089 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-02-06 12:51:10,090 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 90 flow [2025-02-06 12:51:10,090 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-02-06 12:51:10,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:10,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:10,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:51:10,090 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-02-06 12:51:10,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2026061838, now seen corresponding path program 1 times [2025-02-06 12:51:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:10,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144784858] [2025-02-06 12:51:10,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:10,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:51:10,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:51:10,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:10,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:10,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:10,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144784858] [2025-02-06 12:51:10,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144784858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:10,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:10,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:51:10,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198037043] [2025-02-06 12:51:10,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:10,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:51:10,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:10,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:51:10,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:51:10,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 12:51:10,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:10,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:10,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 12:51:10,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:10,841 INFO L124 PetriNetUnfolderBase]: 489/890 cut-off events. [2025-02-06 12:51:10,842 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2025-02-06 12:51:10,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 890 events. 489/890 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4103 event pairs, 75 based on Foata normal form. 30/917 useless extension candidates. Maximal degree in co-relation 2221. Up to 624 conditions per place. [2025-02-06 12:51:10,846 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 35 selfloop transitions, 4 changer transitions 33/76 dead transitions. [2025-02-06 12:51:10,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 365 flow [2025-02-06 12:51:10,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:51:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:51:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2025-02-06 12:51:10,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4085714285714286 [2025-02-06 12:51:10,848 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 90 flow. Second operand 10 states and 143 transitions. [2025-02-06 12:51:10,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 365 flow [2025-02-06 12:51:10,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 351 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-06 12:51:10,851 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 122 flow [2025-02-06 12:51:10,851 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=122, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2025-02-06 12:51:10,852 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2025-02-06 12:51:10,852 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 122 flow [2025-02-06 12:51:10,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:10,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:10,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:10,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:51:10,852 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-02-06 12:51:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1258341468, now seen corresponding path program 1 times [2025-02-06 12:51:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675532973] [2025-02-06 12:51:10,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:10,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:51:10,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:51:10,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:10,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675532973] [2025-02-06 12:51:11,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675532973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:11,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:11,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:51:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103033269] [2025-02-06 12:51:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:11,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:51:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:11,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:51:11,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:51:11,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 12:51:11,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 122 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-02-06 12:51:11,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:11,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 12:51:11,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:11,318 INFO L124 PetriNetUnfolderBase]: 721/1290 cut-off events. [2025-02-06 12:51:11,318 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2025-02-06 12:51:11,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3800 conditions, 1290 events. 721/1290 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6530 event pairs, 211 based on Foata normal form. 44/1331 useless extension candidates. Maximal degree in co-relation 3781. Up to 588 conditions per place. [2025-02-06 12:51:11,325 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 35 selfloop transitions, 3 changer transitions 33/75 dead transitions. [2025-02-06 12:51:11,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 436 flow [2025-02-06 12:51:11,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:51:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:51:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2025-02-06 12:51:11,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-02-06 12:51:11,326 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 122 flow. Second operand 7 states and 119 transitions. [2025-02-06 12:51:11,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 436 flow [2025-02-06 12:51:11,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 403 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-02-06 12:51:11,336 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 128 flow [2025-02-06 12:51:11,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2025-02-06 12:51:11,336 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2025-02-06 12:51:11,337 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 128 flow [2025-02-06 12:51:11,337 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-02-06 12:51:11,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:11,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:11,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:51:11,337 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-02-06 12:51:11,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:11,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1089107508, now seen corresponding path program 1 times [2025-02-06 12:51:11,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:11,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113628561] [2025-02-06 12:51:11,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:11,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:11,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:51:11,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:51:11,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:11,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:11,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113628561] [2025-02-06 12:51:11,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113628561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:11,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:11,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:51:11,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65735611] [2025-02-06 12:51:11,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:11,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:51:11,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:11,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:51:11,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:51:11,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 12:51:11,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 128 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-02-06 12:51:11,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:11,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 12:51:11,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:12,088 INFO L124 PetriNetUnfolderBase]: 673/1254 cut-off events. [2025-02-06 12:51:12,088 INFO L125 PetriNetUnfolderBase]: For 2620/2620 co-relation queries the response was YES. [2025-02-06 12:51:12,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 1254 events. 673/1254 cut-off events. For 2620/2620 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6360 event pairs, 309 based on Foata normal form. 45/1296 useless extension candidates. Maximal degree in co-relation 3581. Up to 914 conditions per place. [2025-02-06 12:51:12,096 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 34 selfloop transitions, 5 changer transitions 26/69 dead transitions. [2025-02-06 12:51:12,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 448 flow [2025-02-06 12:51:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:51:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:51:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2025-02-06 12:51:12,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2025-02-06 12:51:12,099 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 128 flow. Second operand 8 states and 121 transitions. [2025-02-06 12:51:12,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 448 flow [2025-02-06 12:51:12,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 415 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-02-06 12:51:12,104 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 158 flow [2025-02-06 12:51:12,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2025-02-06 12:51:12,107 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2025-02-06 12:51:12,107 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 158 flow [2025-02-06 12:51:12,107 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-02-06 12:51:12,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:12,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:12,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:51:12,107 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-02-06 12:51:12,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:12,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1208631182, now seen corresponding path program 1 times [2025-02-06 12:51:12,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:12,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201574133] [2025-02-06 12:51:12,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:12,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:51:12,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:51:12,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:12,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201574133] [2025-02-06 12:51:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201574133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:12,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:12,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:51:12,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097023770] [2025-02-06 12:51:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:12,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:51:12,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:12,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:51:12,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:51:12,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:51:12,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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-02-06 12:51:12,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:12,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:51:12,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:12,356 INFO L124 PetriNetUnfolderBase]: 423/829 cut-off events. [2025-02-06 12:51:12,356 INFO L125 PetriNetUnfolderBase]: For 1738/1738 co-relation queries the response was YES. [2025-02-06 12:51:12,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 829 events. 423/829 cut-off events. For 1738/1738 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3948 event pairs, 91 based on Foata normal form. 56/882 useless extension candidates. Maximal degree in co-relation 2499. Up to 404 conditions per place. [2025-02-06 12:51:12,360 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 42 selfloop transitions, 4 changer transitions 3/53 dead transitions. [2025-02-06 12:51:12,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 362 flow [2025-02-06 12:51:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:51:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:51:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-06 12:51:12,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-06 12:51:12,362 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 158 flow. Second operand 4 states and 77 transitions. [2025-02-06 12:51:12,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 362 flow [2025-02-06 12:51:12,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 345 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 12:51:12,367 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 167 flow [2025-02-06 12:51:12,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2025-02-06 12:51:12,369 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2025-02-06 12:51:12,369 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 167 flow [2025-02-06 12:51:12,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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-02-06 12:51:12,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:12,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:51:12,369 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-02-06 12:51:12,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1453489333, now seen corresponding path program 1 times [2025-02-06 12:51:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:12,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296670780] [2025-02-06 12:51:12,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:12,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:12,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:51:12,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:51:12,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:12,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296670780] [2025-02-06 12:51:13,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296670780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:13,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:13,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:51:13,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006035861] [2025-02-06 12:51:13,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:13,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:51:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:13,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:51:13,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:51:13,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 12:51:13,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:13,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:13,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 12:51:13,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:13,752 INFO L124 PetriNetUnfolderBase]: 438/843 cut-off events. [2025-02-06 12:51:13,753 INFO L125 PetriNetUnfolderBase]: For 1771/1771 co-relation queries the response was YES. [2025-02-06 12:51:13,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 843 events. 438/843 cut-off events. For 1771/1771 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3868 event pairs, 149 based on Foata normal form. 10/851 useless extension candidates. Maximal degree in co-relation 2822. Up to 598 conditions per place. [2025-02-06 12:51:13,757 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 41 selfloop transitions, 14 changer transitions 28/87 dead transitions. [2025-02-06 12:51:13,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 578 flow [2025-02-06 12:51:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:51:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 12:51:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2025-02-06 12:51:13,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2025-02-06 12:51:13,760 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 167 flow. Second operand 11 states and 155 transitions. [2025-02-06 12:51:13,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 578 flow [2025-02-06 12:51:13,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 540 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-02-06 12:51:13,767 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 255 flow [2025-02-06 12:51:13,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=255, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2025-02-06 12:51:13,769 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2025-02-06 12:51:13,769 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 255 flow [2025-02-06 12:51:13,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:13,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:13,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:13,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:51:13,770 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-02-06 12:51:13,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:13,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2071864533, now seen corresponding path program 2 times [2025-02-06 12:51:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:13,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28838648] [2025-02-06 12:51:13,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:51:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:13,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:51:13,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:51:13,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:51:13,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:13,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28838648] [2025-02-06 12:51:13,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28838648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:13,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:13,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:51:13,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477393046] [2025-02-06 12:51:13,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:13,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:51:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:13,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:51:13,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:51:13,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:51:13,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 41 transitions, 255 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-02-06 12:51:13,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:13,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:51:13,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:14,019 INFO L124 PetriNetUnfolderBase]: 213/429 cut-off events. [2025-02-06 12:51:14,019 INFO L125 PetriNetUnfolderBase]: For 1063/1063 co-relation queries the response was YES. [2025-02-06 12:51:14,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 429 events. 213/429 cut-off events. For 1063/1063 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1710 event pairs, 45 based on Foata normal form. 36/462 useless extension candidates. Maximal degree in co-relation 1435. Up to 188 conditions per place. [2025-02-06 12:51:14,021 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 31 selfloop transitions, 6 changer transitions 14/55 dead transitions. [2025-02-06 12:51:14,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 437 flow [2025-02-06 12:51:14,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:51:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:51:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-02-06 12:51:14,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-02-06 12:51:14,023 INFO L175 Difference]: Start difference. First operand has 65 places, 41 transitions, 255 flow. Second operand 5 states and 80 transitions. [2025-02-06 12:51:14,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 437 flow [2025-02-06 12:51:14,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 354 flow, removed 35 selfloop flow, removed 12 redundant places. [2025-02-06 12:51:14,026 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 156 flow [2025-02-06 12:51:14,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2025-02-06 12:51:14,027 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2025-02-06 12:51:14,027 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 156 flow [2025-02-06 12:51:14,027 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-02-06 12:51:14,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:14,027 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-02-06 12:51:14,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:51:14,027 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-02-06 12:51:14,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1573502019, now seen corresponding path program 1 times [2025-02-06 12:51:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742666984] [2025-02-06 12:51:14,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:14,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:51:14,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:51:14,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:14,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:14,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:51:14,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742666984] [2025-02-06 12:51:14,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742666984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:14,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:14,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:51:14,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919505962] [2025-02-06 12:51:14,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:14,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:51:14,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:51:14,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:51:14,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:51:14,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 12:51:14,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 156 flow. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:14,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:14,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 12:51:14,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:15,104 INFO L124 PetriNetUnfolderBase]: 121/254 cut-off events. [2025-02-06 12:51:15,105 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-02-06 12:51:15,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 254 events. 121/254 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 795 event pairs, 56 based on Foata normal form. 4/257 useless extension candidates. Maximal degree in co-relation 754. Up to 131 conditions per place. [2025-02-06 12:51:15,106 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 24 selfloop transitions, 3 changer transitions 24/55 dead transitions. [2025-02-06 12:51:15,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 362 flow [2025-02-06 12:51:15,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:51:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:51:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-02-06 12:51:15,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36428571428571427 [2025-02-06 12:51:15,107 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 156 flow. Second operand 8 states and 102 transitions. [2025-02-06 12:51:15,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 362 flow [2025-02-06 12:51:15,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 273 flow, removed 17 selfloop flow, removed 13 redundant places. [2025-02-06 12:51:15,108 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 99 flow [2025-02-06 12:51:15,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=99, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2025-02-06 12:51:15,109 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2025-02-06 12:51:15,109 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 99 flow [2025-02-06 12:51:15,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:51:15,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:15,109 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-02-06 12:51:15,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:51:15,109 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-02-06 12:51:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1507135559, now seen corresponding path program 2 times [2025-02-06 12:51:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:51:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364480523] [2025-02-06 12:51:15,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:51:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:51:15,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:51:15,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:51:15,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:51:15,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:51:15,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:51:15,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:51:15,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:51:15,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:15,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:51:15,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:51:15,214 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:51:15,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-06 12:51:15,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:51:15,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:51:15,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 12:51:15,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 12:51:15,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:51:15,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:51:15,218 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:15,268 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:51:15,268 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:51:15,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:51:15 BasicIcfg [2025-02-06 12:51:15,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:51:15,272 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:51:15,272 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:51:15,272 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:51:15,273 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:08" (3/4) ... [2025-02-06 12:51:15,274 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:51:15,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:51:15,276 INFO L158 Benchmark]: Toolchain (without parser) took 7817.42ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 111.7MB in the beginning and 169.0MB in the end (delta: -57.2MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. [2025-02-06 12:51:15,276 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:51:15,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.02ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 88.8MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:51:15,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.70ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 86.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:51:15,276 INFO L158 Benchmark]: Boogie Preprocessor took 32.40ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 84.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:51:15,277 INFO L158 Benchmark]: IcfgBuilder took 554.25ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 107.0MB in the end (delta: -22.9MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-02-06 12:51:15,277 INFO L158 Benchmark]: TraceAbstraction took 6815.38ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 106.3MB in the beginning and 169.0MB in the end (delta: -62.7MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB. [2025-02-06 12:51:15,277 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 327.2MB. Free memory was 169.0MB in the beginning and 169.0MB in the end (delta: 43.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:51:15,278 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.02ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 88.8MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.70ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 86.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.40ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 84.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 554.25ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 107.0MB in the end (delta: -22.9MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6815.38ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 106.3MB in the beginning and 169.0MB in the end (delta: -62.7MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 327.2MB. Free memory was 169.0MB in the beginning and 169.0MB in the end (delta: 43.0kB). 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}, 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=1, weak$$choice2=0, 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=0, 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=0, 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, 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: 6.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 388 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1275 IncrementalHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 2 mSDtfsCounter, 1275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=8, InterpolantAutomatonStates: 67, 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.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 1157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:51:15,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:51:17,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:51:17,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:51:17,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:51:17,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:51:17,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:51:17,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:51:17,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:51:17,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:51:17,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:51:17,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:51:17,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:51:17,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:51:17,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:51:17,281 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:51:17,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:51:17,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:51:17,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:51:17,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:51:17,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:51:17,282 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:51:17,282 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:51:17,282 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:51:17,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:51:17,282 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:51:17,282 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:51:17,283 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:51:17,283 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:51:17,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:51:17,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:51:17,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:51:17,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:51:17,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:51:17,284 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9df54eb091d78e0f82ec179542e5b1e4fed45243a056538ca557e474796bb018 [2025-02-06 12:51:17,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:51:17,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:51:17,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:51:17,541 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:51:17,541 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:51:17,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2025-02-06 12:51:18,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/968f063d6/faaaae867b2248cbb33c66f46623a9e5/FLAG67ebc476c [2025-02-06 12:51:19,004 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:51:19,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2025-02-06 12:51:19,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/968f063d6/faaaae867b2248cbb33c66f46623a9e5/FLAG67ebc476c [2025-02-06 12:51:19,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/968f063d6/faaaae867b2248cbb33c66f46623a9e5 [2025-02-06 12:51:19,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:51:19,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:51:19,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:51:19,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:51:19,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:51:19,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f1aceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19, skipping insertion in model container [2025-02-06 12:51:19,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:51:19,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:51:19,391 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:51:19,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:51:19,467 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:51:19,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19 WrapperNode [2025-02-06 12:51:19,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:51:19,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:51:19,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:51:19,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:51:19,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,519 INFO L138 Inliner]: procedures = 175, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2025-02-06 12:51:19,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:51:19,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:51:19,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:51:19,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:51:19,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,555 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:51:19,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:51:19,574 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:51:19,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:51:19,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:51:19,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (1/1) ... [2025-02-06 12:51:19,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:51:19,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:19,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:51:19,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:51:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:51:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:51:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:51:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:51:19,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:51:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:51:19,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:51:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:51:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:51:19,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:51:19,637 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:51:19,751 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:51:19,753 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:51:20,039 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:51:20,039 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:51:20,232 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:51:20,233 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:51:20,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:20 BoogieIcfgContainer [2025-02-06 12:51:20,233 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:51:20,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:51:20,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:51:20,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:51:20,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:51:19" (1/3) ... [2025-02-06 12:51:20,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ced9a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:51:20, skipping insertion in model container [2025-02-06 12:51:20,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:51:19" (2/3) ... [2025-02-06 12:51:20,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ced9a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:51:20, skipping insertion in model container [2025-02-06 12:51:20,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:20" (3/3) ... [2025-02-06 12:51:20,242 INFO L128 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2025-02-06 12:51:20,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:51:20,254 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-02-06 12:51:20,257 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:51:20,297 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:51:20,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2025-02-06 12:51:20,346 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-02-06 12:51:20,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:20,353 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 53 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-02-06 12:51:20,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2025-02-06 12:51:20,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2025-02-06 12:51:20,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:51:20,374 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;@68c7e580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:51:20,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:51:20,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:51:20,382 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-06 12:51:20,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:20,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:20,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:51:20,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:51:20,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:20,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1171978036, now seen corresponding path program 1 times [2025-02-06 12:51:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:51:20,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384800798] [2025-02-06 12:51:20,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:20,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:20,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:20,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:51:20,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:51:20,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:51:20,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:51:20,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:20,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:20,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:51:20,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:51:20,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-02-06 12:51:20,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:51:20,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:51:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384800798] [2025-02-06 12:51:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384800798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:20,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:20,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:51:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854065770] [2025-02-06 12:51:20,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:20,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:51:20,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:51:20,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:51:20,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:51:20,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:51:20,573 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-02-06 12:51:20,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:20,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:51:20,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:20,854 INFO L124 PetriNetUnfolderBase]: 575/975 cut-off events. [2025-02-06 12:51:20,854 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:51:20,856 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 4500 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-02-06 12:51:20,861 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2025-02-06 12:51:20,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 166 flow [2025-02-06 12:51:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:51:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:51:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-02-06 12:51:20,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-02-06 12:51:20,875 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 66 transitions. [2025-02-06 12:51:20,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 166 flow [2025-02-06 12:51:20,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:51:20,880 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-02-06 12:51:20,882 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-02-06 12:51:20,884 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-02-06 12:51:20,885 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-02-06 12:51:20,885 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-02-06 12:51:20,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:20,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:20,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:51:21,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:21,087 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-02-06 12:51:21,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash 258193363, now seen corresponding path program 1 times [2025-02-06 12:51:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:51:21,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956846806] [2025-02-06 12:51:21,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:21,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:21,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:21,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:51:21,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:51:21,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:51:21,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:51:21,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:21,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:21,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:51:21,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:51:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:21,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:51:21,195 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:51:21,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956846806] [2025-02-06 12:51:21,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956846806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:21,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:21,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:51:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666303891] [2025-02-06 12:51:21,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:21,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:51:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:51:21,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:51:21,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:51:21,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 12:51:21,200 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-02-06 12:51:21,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:21,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 12:51:21,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:21,325 INFO L124 PetriNetUnfolderBase]: 515/957 cut-off events. [2025-02-06 12:51:21,325 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:51:21,327 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 4729 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-02-06 12:51:21,330 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-02-06 12:51:21,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 106 flow [2025-02-06 12:51:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:51:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:51:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-06 12:51:21,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2025-02-06 12:51:21,331 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 44 transitions. [2025-02-06 12:51:21,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 106 flow [2025-02-06 12:51:21,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:51:21,332 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2025-02-06 12:51:21,333 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-02-06 12:51:21,333 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-02-06 12:51:21,333 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2025-02-06 12:51:21,333 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-02-06 12:51:21,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:21,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:21,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:51:21,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:21,534 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-02-06 12:51:21,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash 258194033, now seen corresponding path program 1 times [2025-02-06 12:51:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:51:21,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650752361] [2025-02-06 12:51:21,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:21,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:21,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:21,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:51:21,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:51:21,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:51:21,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:51:21,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:21,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:21,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:51:21,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:51:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:21,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:51:21,630 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:51:21,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650752361] [2025-02-06 12:51:21,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650752361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:21,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:21,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:51:21,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698223763] [2025-02-06 12:51:21,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:21,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:51:21,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:51:21,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:51:21,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:51:21,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:51:21,632 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-02-06 12:51:21,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:21,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:51:21,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:21,786 INFO L124 PetriNetUnfolderBase]: 303/607 cut-off events. [2025-02-06 12:51:21,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:51:21,788 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 2745 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-02-06 12:51:21,790 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 38 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-02-06 12:51:21,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 190 flow [2025-02-06 12:51:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:51:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:51:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-06 12:51:21,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-06 12:51:21,792 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 4 states and 77 transitions. [2025-02-06 12:51:21,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 190 flow [2025-02-06 12:51:21,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:51:21,795 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 83 flow [2025-02-06 12:51:21,796 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-02-06 12:51:21,796 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-02-06 12:51:21,796 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 83 flow [2025-02-06 12:51:21,796 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-02-06 12:51:21,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:21,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:51:21,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:51:21,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:21,997 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-02-06 12:51:21,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1877964217, now seen corresponding path program 1 times [2025-02-06 12:51:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:51:21,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514564330] [2025-02-06 12:51:21,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:21,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:21,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:22,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:51:22,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:51:22,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:51:22,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:51:22,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:22,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:22,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:51:22,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:51:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:22,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:51:22,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:51:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514564330] [2025-02-06 12:51:22,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514564330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:22,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:22,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:51:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145782757] [2025-02-06 12:51:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:22,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:51:22,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:51:22,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:51:22,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:51:22,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:51:22,122 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-02-06 12:51:22,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:22,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:51:22,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:22,225 INFO L124 PetriNetUnfolderBase]: 143/287 cut-off events. [2025-02-06 12:51:22,225 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:51:22,226 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 934 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-02-06 12:51:22,226 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 31 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2025-02-06 12:51:22,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 194 flow [2025-02-06 12:51:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:51:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:51:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-02-06 12:51:22,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-02-06 12:51:22,227 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 83 flow. Second operand 5 states and 80 transitions. [2025-02-06 12:51:22,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 194 flow [2025-02-06 12:51:22,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 185 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:51:22,229 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 99 flow [2025-02-06 12:51:22,229 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-02-06 12:51:22,229 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2025-02-06 12:51:22,229 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 99 flow [2025-02-06 12:51:22,229 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-02-06 12:51:22,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:22,230 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-02-06 12:51:22,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:51:22,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:22,430 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-02-06 12:51:22,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:22,431 INFO L85 PathProgramCache]: Analyzing trace with hash 933064631, now seen corresponding path program 1 times [2025-02-06 12:51:22,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:51:22,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132115214] [2025-02-06 12:51:22,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:51:22,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:22,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:22,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:51:22,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:51:22,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:51:22,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:51:22,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:22,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:22,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:51:22,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:51:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:22,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:51:22,636 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:51:22,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132115214] [2025-02-06 12:51:22,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132115214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:22,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:22,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:51:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264103601] [2025-02-06 12:51:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:22,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:51:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:51:22,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:51:22,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:51:22,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:51:22,645 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-02-06 12:51:22,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:22,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:51:22,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:22,958 INFO L124 PetriNetUnfolderBase]: 213/441 cut-off events. [2025-02-06 12:51:22,958 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2025-02-06 12:51:22,959 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 1723 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-02-06 12:51:22,961 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 26 selfloop transitions, 7 changer transitions 42/80 dead transitions. [2025-02-06 12:51:22,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 405 flow [2025-02-06 12:51:22,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:51:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:51:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 173 transitions. [2025-02-06 12:51:22,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4119047619047619 [2025-02-06 12:51:22,963 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 99 flow. Second operand 12 states and 173 transitions. [2025-02-06 12:51:22,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 405 flow [2025-02-06 12:51:22,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 80 transitions, 339 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-02-06 12:51:22,966 INFO L231 Difference]: Finished difference. Result has 54 places, 30 transitions, 111 flow [2025-02-06 12:51:22,966 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-02-06 12:51:22,967 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2025-02-06 12:51:22,967 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 30 transitions, 111 flow [2025-02-06 12:51:22,967 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-02-06 12:51:22,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:22,967 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-02-06 12:51:22,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:51:23,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:23,168 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-02-06 12:51:23,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash 866291417, now seen corresponding path program 2 times [2025-02-06 12:51:23,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:51:23,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825591195] [2025-02-06 12:51:23,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:51:23,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:23,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:23,174 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:51:23,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:51:23,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:51:23,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:51:23,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:51:23,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:51:23,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:51:23,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:51:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:51:23,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:51:23,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:51:23,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825591195] [2025-02-06 12:51:23,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825591195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:51:23,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:51:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:51:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456736600] [2025-02-06 12:51:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:51:23,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:51:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:51:23,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:51:23,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:51:23,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:51:23,456 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-02-06 12:51:23,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:51:23,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:51:23,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:51:23,629 INFO L124 PetriNetUnfolderBase]: 121/262 cut-off events. [2025-02-06 12:51:23,629 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-02-06 12:51:23,630 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 861 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-02-06 12:51:23,630 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 24 selfloop transitions, 3 changer transitions 18/50 dead transitions. [2025-02-06 12:51:23,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 268 flow [2025-02-06 12:51:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:51:23,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:51:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2025-02-06 12:51:23,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39183673469387753 [2025-02-06 12:51:23,632 INFO L175 Difference]: Start difference. First operand has 54 places, 30 transitions, 111 flow. Second operand 7 states and 96 transitions. [2025-02-06 12:51:23,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 268 flow [2025-02-06 12:51:23,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 222 flow, removed 16 selfloop flow, removed 10 redundant places. [2025-02-06 12:51:23,634 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 91 flow [2025-02-06 12:51:23,634 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-02-06 12:51:23,635 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-02-06 12:51:23,635 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 91 flow [2025-02-06 12:51:23,635 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-02-06 12:51:23,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:51:23,635 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-02-06 12:51:23,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:51:23,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:23,836 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-02-06 12:51:23,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:51:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1054275673, now seen corresponding path program 3 times [2025-02-06 12:51:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:51:23,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [358192430] [2025-02-06 12:51:23,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:51:23,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:23,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:51:23,839 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:51:23,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:51:23,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:51:23,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:51:23,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:51:23,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:51:23,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:51:23,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:51:23,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:51:23,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:51:23,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:51:23,961 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:51:23,961 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:51:23,961 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-06 12:51:23,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:51:23,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:51:23,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 12:51:23,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 12:51:23,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:51:23,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 12:51:24,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:51:24,164 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-02-06 12:51:24,221 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:51:24,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:51:24,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:51:24 BasicIcfg [2025-02-06 12:51:24,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:51:24,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:51:24,229 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:51:24,229 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:51:24,229 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:51:20" (3/4) ... [2025-02-06 12:51:24,234 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:51:24,234 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:51:24,235 INFO L158 Benchmark]: Toolchain (without parser) took 5205.93ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 91.0MB in the beginning and 74.6MB in the end (delta: 16.4MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2025-02-06 12:51:24,235 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:51:24,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.15ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 68.1MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:51:24,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.31ms. Allocated memory is still 117.4MB. Free memory was 68.1MB in the beginning and 65.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:51:24,235 INFO L158 Benchmark]: Boogie Preprocessor took 49.61ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 63.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:51:24,235 INFO L158 Benchmark]: IcfgBuilder took 658.88ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 57.7MB in the end (delta: 5.5MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2025-02-06 12:51:24,235 INFO L158 Benchmark]: TraceAbstraction took 3993.36ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 56.8MB in the beginning and 74.6MB in the end (delta: -17.9MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2025-02-06 12:51:24,236 INFO L158 Benchmark]: Witness Printer took 5.62ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 74.6MB in the end (delta: 9.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:51:24,238 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.24ms. Allocated memory is still 83.9MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.15ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 68.1MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.31ms. Allocated memory is still 117.4MB. Free memory was 68.1MB in the beginning and 65.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.61ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 63.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 658.88ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 57.7MB in the end (delta: 5.5MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3993.36ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 56.8MB in the beginning and 74.6MB in the end (delta: -17.9MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Witness Printer took 5.62ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 74.6MB in the end (delta: 9.8kB). 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, 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.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.6s 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, 646 IncrementalHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 0 mSDtfsCounter, 646 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, 394 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-02-06 12:51:24,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample