./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix044.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix044.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:04:07,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:04:08,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:04:08,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:04:08,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:04:08,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:04:08,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:04:08,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:04:08,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:04:08,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:04:08,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:04:08,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:04:08,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:04:08,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:04:08,069 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:04:08,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:04:08,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:04:08,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:04:08,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:04:08,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:04:08,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:04:08,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:04:08,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:04:08,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:04:08,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:04:08,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:04:08,071 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 [2025-03-09 01:04:08,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:04:08,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:04:08,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:04:08,326 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:04:08,326 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:04:08,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix044.opt.i [2025-03-09 01:04:09,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d74cf80f/3844b025b93c40f39dc0f05185032910/FLAG26f0de90b [2025-03-09 01:04:09,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:04:09,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix044.opt.i [2025-03-09 01:04:09,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d74cf80f/3844b025b93c40f39dc0f05185032910/FLAG26f0de90b [2025-03-09 01:04:09,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d74cf80f/3844b025b93c40f39dc0f05185032910 [2025-03-09 01:04:09,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:04:09,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:04:09,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:04:09,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:04:09,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:04:09,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:04:09" (1/1) ... [2025-03-09 01:04:09,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67de3d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:09, skipping insertion in model container [2025-03-09 01:04:09,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:04:09" (1/1) ... [2025-03-09 01:04:09,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:04:10,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:04:10,062 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:04:10,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:04:10,142 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:04:10,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10 WrapperNode [2025-03-09 01:04:10,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:04:10,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:04:10,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:04:10,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:04:10,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,184 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2025-03-09 01:04:10,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:04:10,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:04:10,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:04:10,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:04:10,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,213 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:04:10,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:04:10,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:04:10,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:04:10,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:04:10,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (1/1) ... [2025-03-09 01:04:10,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:04:10,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:04:10,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:04:10,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:04:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:04:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:04:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-09 01:04:10,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-09 01:04:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-09 01:04:10,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-09 01:04:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-09 01:04:10,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-09 01:04:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-09 01:04:10,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-09 01:04:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:04:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:04:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:04:10,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:04:10,282 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:04:10,402 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:04:10,404 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:04:10,650 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:04:10,651 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:04:10,814 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:04:10,815 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:04:10,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:04:10 BoogieIcfgContainer [2025-03-09 01:04:10,816 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:04:10,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:04:10,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:04:10,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:04:10,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:04:09" (1/3) ... [2025-03-09 01:04:10,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432106df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:04:10, skipping insertion in model container [2025-03-09 01:04:10,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:10" (2/3) ... [2025-03-09 01:04:10,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432106df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:04:10, skipping insertion in model container [2025-03-09 01:04:10,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:04:10" (3/3) ... [2025-03-09 01:04:10,826 INFO L128 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2025-03-09 01:04:10,838 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:04:10,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix044.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-09 01:04:10,840 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:04:10,893 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:04:10,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-03-09 01:04:10,952 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-03-09 01:04:10,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:04:10,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-03-09 01:04:10,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-03-09 01:04:10,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-03-09 01:04:10,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:04:10,984 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;@2b572f8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:04:10,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 01:04:10,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:04:10,995 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-09 01:04:10,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:04:10,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:10,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:10,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:11,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:11,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1247279364, now seen corresponding path program 1 times [2025-03-09 01:04:11,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:11,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891130733] [2025-03-09 01:04:11,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:11,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:04:11,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:04:11,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:11,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:11,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:04:11,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891130733] [2025-03-09 01:04:11,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891130733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:11,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:11,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:04:11,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373677994] [2025-03-09 01:04:11,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:11,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:04:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:04:11,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:04:11,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:04:11,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:11,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:11,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:11,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:11,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:15,733 INFO L124 PetriNetUnfolderBase]: 57803/76511 cut-off events. [2025-03-09 01:04:15,733 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-03-09 01:04:15,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152635 conditions, 76511 events. 57803/76511 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 2139. Compared 453356 event pairs, 6395 based on Foata normal form. 3456/79932 useless extension candidates. Maximal degree in co-relation 152623. Up to 66529 conditions per place. [2025-03-09 01:04:16,126 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 59 selfloop transitions, 2 changer transitions 2/71 dead transitions. [2025-03-09 01:04:16,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 280 flow [2025-03-09 01:04:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:04:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:04:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-09 01:04:16,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2025-03-09 01:04:16,139 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 104 transitions. [2025-03-09 01:04:16,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 280 flow [2025-03-09 01:04:16,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:04:16,149 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-03-09 01:04:16,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-03-09 01:04:16,156 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-03-09 01:04:16,156 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-03-09 01:04:16,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:16,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:16,156 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:16,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:04:16,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:16,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash -238709156, now seen corresponding path program 1 times [2025-03-09 01:04:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:16,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173299668] [2025-03-09 01:04:16,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:16,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:04:16,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:04:16,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:16,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:16,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:04:16,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173299668] [2025-03-09 01:04:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173299668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:16,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:16,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:04:16,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492761980] [2025-03-09 01:04:16,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:16,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:04:16,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:04:16,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:04:16,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:04:16,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-09 01:04:16,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:16,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:16,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-09 01:04:16,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:19,946 INFO L124 PetriNetUnfolderBase]: 51971/72407 cut-off events. [2025-03-09 01:04:19,946 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2025-03-09 01:04:20,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142913 conditions, 72407 events. 51971/72407 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 2166. Compared 473718 event pairs, 51971 based on Foata normal form. 1728/73884 useless extension candidates. Maximal degree in co-relation 142903. Up to 68040 conditions per place. [2025-03-09 01:04:20,480 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 36 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-03-09 01:04:20,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 178 flow [2025-03-09 01:04:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:04:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:04:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-09 01:04:20,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-09 01:04:20,482 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 72 transitions. [2025-03-09 01:04:20,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 178 flow [2025-03-09 01:04:20,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:04:20,496 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-03-09 01:04:20,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-03-09 01:04:20,497 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-03-09 01:04:20,497 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-03-09 01:04:20,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:20,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:20,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:20,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:04:20,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash -238708363, now seen corresponding path program 1 times [2025-03-09 01:04:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106782637] [2025-03-09 01:04:20,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:20,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:04:20,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:04:20,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:20,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:04:20,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106782637] [2025-03-09 01:04:20,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106782637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:20,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:20,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:04:20,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140299165] [2025-03-09 01:04:20,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:20,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:04:20,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:04:20,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:04:20,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:04:20,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:20,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:20,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:20,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:20,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:23,769 INFO L124 PetriNetUnfolderBase]: 41411/59243 cut-off events. [2025-03-09 01:04:23,769 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:04:23,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114941 conditions, 59243 events. 41411/59243 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1830. Compared 405576 event pairs, 5075 based on Foata normal form. 1728/60948 useless extension candidates. Maximal degree in co-relation 114935. Up to 33841 conditions per place. [2025-03-09 01:04:24,035 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 78 selfloop transitions, 6 changer transitions 1/92 dead transitions. [2025-03-09 01:04:24,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 370 flow [2025-03-09 01:04:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:04:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:04:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-09 01:04:24,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-03-09 01:04:24,040 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 135 transitions. [2025-03-09 01:04:24,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 370 flow [2025-03-09 01:04:24,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:04:24,042 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2025-03-09 01:04:24,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-03-09 01:04:24,044 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-03-09 01:04:24,044 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2025-03-09 01:04:24,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:24,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:24,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:24,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:04:24,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:24,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:24,045 INFO L85 PathProgramCache]: Analyzing trace with hash -207459879, now seen corresponding path program 1 times [2025-03-09 01:04:24,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:24,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357216545] [2025-03-09 01:04:24,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:24,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:24,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:04:24,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:04:24,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:24,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:24,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:04:24,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357216545] [2025-03-09 01:04:24,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357216545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:24,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:24,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:04:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851161141] [2025-03-09 01:04:24,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:24,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:04:24,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:04:24,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:04:24,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:04:24,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:24,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:24,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:24,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:24,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:26,279 INFO L124 PetriNetUnfolderBase]: 25795/36907 cut-off events. [2025-03-09 01:04:26,279 INFO L125 PetriNetUnfolderBase]: For 7014/7014 co-relation queries the response was YES. [2025-03-09 01:04:26,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81788 conditions, 36907 events. 25795/36907 cut-off events. For 7014/7014 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 232563 event pairs, 2975 based on Foata normal form. 1344/38228 useless extension candidates. Maximal degree in co-relation 81779. Up to 14833 conditions per place. [2025-03-09 01:04:26,420 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 101 selfloop transitions, 10 changer transitions 1/119 dead transitions. [2025-03-09 01:04:26,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 534 flow [2025-03-09 01:04:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:04:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:04:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-03-09 01:04:26,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6327272727272727 [2025-03-09 01:04:26,422 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 174 transitions. [2025-03-09 01:04:26,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 534 flow [2025-03-09 01:04:26,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 523 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:04:26,431 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2025-03-09 01:04:26,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2025-03-09 01:04:26,432 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-03-09 01:04:26,432 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2025-03-09 01:04:26,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:26,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:26,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:26,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:04:26,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:26,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -934440831, now seen corresponding path program 1 times [2025-03-09 01:04:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238513943] [2025-03-09 01:04:26,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:26,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:04:26,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:04:26,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:26,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:26,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-03-09 01:04:26,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:04:26,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238513943] [2025-03-09 01:04:26,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238513943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:26,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:26,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:04:26,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919583169] [2025-03-09 01:04:26,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:26,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:04:26,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:04:26,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:04:26,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:04:26,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:26,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:26,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:26,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:26,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:28,128 INFO L124 PetriNetUnfolderBase]: 15171/21259 cut-off events. [2025-03-09 01:04:28,129 INFO L125 PetriNetUnfolderBase]: For 12898/12898 co-relation queries the response was YES. [2025-03-09 01:04:28,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51856 conditions, 21259 events. 15171/21259 cut-off events. For 12898/12898 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 117231 event pairs, 2591 based on Foata normal form. 640/21876 useless extension candidates. Maximal degree in co-relation 51845. Up to 6144 conditions per place. [2025-03-09 01:04:28,205 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 122 selfloop transitions, 14 changer transitions 1/144 dead transitions. [2025-03-09 01:04:28,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 697 flow [2025-03-09 01:04:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:04:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:04:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-03-09 01:04:28,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6393939393939394 [2025-03-09 01:04:28,207 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 211 transitions. [2025-03-09 01:04:28,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 697 flow [2025-03-09 01:04:28,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 144 transitions, 667 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-09 01:04:28,329 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2025-03-09 01:04:28,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-03-09 01:04:28,330 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-03-09 01:04:28,330 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2025-03-09 01:04:28,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:28,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:28,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:28,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:04:28,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:28,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1170373245, now seen corresponding path program 1 times [2025-03-09 01:04:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:28,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030606248] [2025-03-09 01:04:28,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:28,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:04:28,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:04:28,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:28,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:04:28,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030606248] [2025-03-09 01:04:28,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030606248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:04:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499425558] [2025-03-09 01:04:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:28,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:04:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:04:28,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:04:28,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:04:28,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:28,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:28,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:28,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:28,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:29,371 INFO L124 PetriNetUnfolderBase]: 11715/16027 cut-off events. [2025-03-09 01:04:29,371 INFO L125 PetriNetUnfolderBase]: For 12410/12410 co-relation queries the response was YES. [2025-03-09 01:04:29,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40641 conditions, 16027 events. 11715/16027 cut-off events. For 12410/12410 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 83816 event pairs, 2399 based on Foata normal form. 160/16164 useless extension candidates. Maximal degree in co-relation 40629. Up to 6144 conditions per place. [2025-03-09 01:04:29,446 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 105 selfloop transitions, 18 changer transitions 1/131 dead transitions. [2025-03-09 01:04:29,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 655 flow [2025-03-09 01:04:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:04:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:04:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2025-03-09 01:04:29,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-09 01:04:29,447 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 210 transitions. [2025-03-09 01:04:29,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 655 flow [2025-03-09 01:04:29,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 609 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-09 01:04:29,657 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2025-03-09 01:04:29,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-03-09 01:04:29,657 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-03-09 01:04:29,657 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2025-03-09 01:04:29,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:29,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:29,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:29,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:04:29,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:29,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash 900377464, now seen corresponding path program 1 times [2025-03-09 01:04:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:29,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258166567] [2025-03-09 01:04:29,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:29,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:29,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:04:29,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:04:29,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:29,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:30,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:04:30,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258166567] [2025-03-09 01:04:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258166567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:30,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:04:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888796796] [2025-03-09 01:04:30,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:30,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:04:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:04:30,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:04:30,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:04:30,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:30,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:30,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:30,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:30,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:31,693 INFO L124 PetriNetUnfolderBase]: 17429/23851 cut-off events. [2025-03-09 01:04:31,693 INFO L125 PetriNetUnfolderBase]: For 17786/17786 co-relation queries the response was YES. [2025-03-09 01:04:31,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60894 conditions, 23851 events. 17429/23851 cut-off events. For 17786/17786 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 131601 event pairs, 4419 based on Foata normal form. 16/23863 useless extension candidates. Maximal degree in co-relation 60881. Up to 13399 conditions per place. [2025-03-09 01:04:31,773 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 82 selfloop transitions, 6 changer transitions 25/120 dead transitions. [2025-03-09 01:04:31,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 120 transitions, 741 flow [2025-03-09 01:04:31,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:04:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:04:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2025-03-09 01:04:31,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-03-09 01:04:31,775 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 6 states and 162 transitions. [2025-03-09 01:04:31,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 120 transitions, 741 flow [2025-03-09 01:04:32,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 120 transitions, 552 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-03-09 01:04:32,076 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 190 flow [2025-03-09 01:04:32,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2025-03-09 01:04:32,077 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2025-03-09 01:04:32,077 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 190 flow [2025-03-09 01:04:32,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:32,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:32,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:32,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:04:32,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:32,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1296804144, now seen corresponding path program 2 times [2025-03-09 01:04:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252218611] [2025-03-09 01:04:32,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:04:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:32,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:04:32,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:04:32,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:04:32,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:04:32,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252218611] [2025-03-09 01:04:32,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252218611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:32,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:32,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:04:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609084893] [2025-03-09 01:04:32,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:32,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:04:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:04:32,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:04:32,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:04:32,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:32,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:32,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:32,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:32,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:33,135 INFO L124 PetriNetUnfolderBase]: 11211/15529 cut-off events. [2025-03-09 01:04:33,136 INFO L125 PetriNetUnfolderBase]: For 3452/3452 co-relation queries the response was YES. [2025-03-09 01:04:33,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36759 conditions, 15529 events. 11211/15529 cut-off events. For 3452/3452 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 79837 event pairs, 3451 based on Foata normal form. 16/15544 useless extension candidates. Maximal degree in co-relation 36747. Up to 10308 conditions per place. [2025-03-09 01:04:33,183 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 61 selfloop transitions, 1 changer transitions 56/125 dead transitions. [2025-03-09 01:04:33,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 125 transitions, 627 flow [2025-03-09 01:04:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:04:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:04:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2025-03-09 01:04:33,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-09 01:04:33,184 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 190 flow. Second operand 6 states and 160 transitions. [2025-03-09 01:04:33,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 125 transitions, 627 flow [2025-03-09 01:04:33,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 125 transitions, 612 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-09 01:04:33,190 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 187 flow [2025-03-09 01:04:33,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2025-03-09 01:04:33,190 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2025-03-09 01:04:33,190 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 187 flow [2025-03-09 01:04:33,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:33,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:33,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:33,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:04:33,191 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:33,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:33,191 INFO L85 PathProgramCache]: Analyzing trace with hash -374421834, now seen corresponding path program 3 times [2025-03-09 01:04:33,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:33,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662308978] [2025-03-09 01:04:33,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:04:33,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:33,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:04:33,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:04:33,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:04:33,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:33,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:04:33,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662308978] [2025-03-09 01:04:33,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662308978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:33,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:33,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:04:33,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420764585] [2025-03-09 01:04:33,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:33,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:04:33,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:04:33,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:04:33,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:04:33,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:33,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:33,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:33,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:33,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:34,306 INFO L124 PetriNetUnfolderBase]: 9641/13537 cut-off events. [2025-03-09 01:04:34,306 INFO L125 PetriNetUnfolderBase]: For 2801/2801 co-relation queries the response was YES. [2025-03-09 01:04:34,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31345 conditions, 13537 events. 9641/13537 cut-off events. For 2801/2801 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 70310 event pairs, 2581 based on Foata normal form. 16/13553 useless extension candidates. Maximal degree in co-relation 31331. Up to 7274 conditions per place. [2025-03-09 01:04:34,348 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 64 selfloop transitions, 1 changer transitions 56/128 dead transitions. [2025-03-09 01:04:34,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 128 transitions, 644 flow [2025-03-09 01:04:34,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:04:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:04:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2025-03-09 01:04:34,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-03-09 01:04:34,349 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 187 flow. Second operand 6 states and 162 transitions. [2025-03-09 01:04:34,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 128 transitions, 644 flow [2025-03-09 01:04:34,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 128 transitions, 632 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-09 01:04:34,352 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 182 flow [2025-03-09 01:04:34,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2025-03-09 01:04:34,353 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2025-03-09 01:04:34,353 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 182 flow [2025-03-09 01:04:34,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:34,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:34,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:34,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:04:34,353 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:34,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:34,354 INFO L85 PathProgramCache]: Analyzing trace with hash 966589670, now seen corresponding path program 4 times [2025-03-09 01:04:34,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:34,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413877362] [2025-03-09 01:04:34,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:04:34,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:34,363 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-09 01:04:34,416 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:04:34,416 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:04:34,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:04:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413877362] [2025-03-09 01:04:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413877362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:35,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:35,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:04:35,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466356788] [2025-03-09 01:04:35,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:35,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:04:35,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:04:35,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:04:35,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:04:35,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:35,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 182 flow. Second operand has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:35,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:35,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:35,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:36,555 INFO L124 PetriNetUnfolderBase]: 7207/10297 cut-off events. [2025-03-09 01:04:36,555 INFO L125 PetriNetUnfolderBase]: For 3188/3188 co-relation queries the response was YES. [2025-03-09 01:04:36,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24404 conditions, 10297 events. 7207/10297 cut-off events. For 3188/3188 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 53122 event pairs, 2465 based on Foata normal form. 16/10311 useless extension candidates. Maximal degree in co-relation 24389. Up to 4072 conditions per place. [2025-03-09 01:04:36,591 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 63 selfloop transitions, 3 changer transitions 47/120 dead transitions. [2025-03-09 01:04:36,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 120 transitions, 615 flow [2025-03-09 01:04:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:04:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:04:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-03-09 01:04:36,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-09 01:04:36,593 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 182 flow. Second operand 7 states and 168 transitions. [2025-03-09 01:04:36,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 120 transitions, 615 flow [2025-03-09 01:04:36,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 120 transitions, 600 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-09 01:04:36,598 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 190 flow [2025-03-09 01:04:36,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2025-03-09 01:04:36,599 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2025-03-09 01:04:36,599 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 190 flow [2025-03-09 01:04:36,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.3) internal successors, (153), 10 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:36,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:36,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:36,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:04:36,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:36,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1490787272, now seen corresponding path program 5 times [2025-03-09 01:04:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:04:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345653903] [2025-03-09 01:04:36,600 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:04:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:04:36,607 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:04:36,633 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:04:36,633 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:04:36,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:04:36,633 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:04:36,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:04:36,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:04:36,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:36,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:04:36,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:04:36,707 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:04:36,707 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-03-09 01:04:36,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-03-09 01:04:36,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-03-09 01:04:36,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-03-09 01:04:36,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-03-09 01:04:36,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-03-09 01:04:36,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-03-09 01:04:36,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-09 01:04:36,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:04:36,710 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:36,795 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:04:36,797 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:04:36,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:04:36 BasicIcfg [2025-03-09 01:04:36,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:04:36,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:04:36,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:04:36,803 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:04:36,803 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:04:10" (3/4) ... [2025-03-09 01:04:36,804 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:04:36,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:04:36,806 INFO L158 Benchmark]: Toolchain (without parser) took 27021.66ms. Allocated memory was 201.3MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 157.4MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2025-03-09 01:04:36,807 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:04:36,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.96ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 134.3MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:04:36,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.27ms. Allocated memory is still 201.3MB. Free memory was 134.3MB in the beginning and 131.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:04:36,807 INFO L158 Benchmark]: Boogie Preprocessor took 37.75ms. Allocated memory is still 201.3MB. Free memory was 131.6MB in the beginning and 128.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:04:36,808 INFO L158 Benchmark]: IcfgBuilder took 592.61ms. Allocated memory is still 201.3MB. Free memory was 128.6MB in the beginning and 74.5MB in the end (delta: 54.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 01:04:36,808 INFO L158 Benchmark]: TraceAbstraction took 25983.62ms. Allocated memory was 201.3MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 74.1MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2025-03-09 01:04:36,809 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 9.5GB. Free memory was 6.0GB in the beginning and 6.0GB in the end (delta: 213.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:04:36,810 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.96ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 134.3MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.27ms. Allocated memory is still 201.3MB. Free memory was 134.3MB in the beginning and 131.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.75ms. Allocated memory is still 201.3MB. Free memory was 131.6MB in the beginning and 128.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 592.61ms. Allocated memory is still 201.3MB. Free memory was 128.6MB in the beginning and 74.5MB in the end (delta: 54.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25983.62ms. Allocated memory was 201.3MB in the beginning and 9.5GB in the end (delta: 9.3GB). Free memory was 74.1MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 9.5GB. Free memory was 6.0GB in the beginning and 6.0GB in the end (delta: 213.3kB). Peak memory consumption was 8.4MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-2, t1166=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-2, t1166=-1, t1167=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-2, t1166=-1, t1167=0, t1168=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-2, t1166=-1, t1167=0, t1168=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-2, t1166=-1, t1167=0, t1168=1, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-2, t1166=-1, t1167=0, t1168=1, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix044.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 847]: 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: 851]: 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 9 procedures, 89 locations, 86 edges, 8 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: 25.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 882 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 873 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1935 IncrementalHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 7 mSDtfsCounter, 1935 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=6, InterpolantAutomatonStates: 53, 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.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 1335 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-03-09 01:04:36,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix044.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:04:39,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:04:39,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 01:04:39,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:04:39,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:04:39,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:04:39,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:04:39,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:04:39,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:04:39,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:04:39,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:04:39,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:04:39,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:04:39,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:04:39,470 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:04:39,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:04:39,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:04:39,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:04:39,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:04:39,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:04:39,471 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:04:39,471 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:04:39,471 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:04:39,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:04:39,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:04:39,472 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 01:04:39,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 01:04:39,472 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:04:39,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:04:39,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:04:39,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:04:39,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:04:39,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:04:39,473 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 [2025-03-09 01:04:39,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:04:39,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:04:39,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:04:39,734 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:04:39,734 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:04:39,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix044.opt.i [2025-03-09 01:04:40,896 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71673f2f4/734c6c7dbffc4fd6b519c78ff77e72d7/FLAG86c55eb96 [2025-03-09 01:04:41,178 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:04:41,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix044.opt.i [2025-03-09 01:04:41,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71673f2f4/734c6c7dbffc4fd6b519c78ff77e72d7/FLAG86c55eb96 [2025-03-09 01:04:41,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71673f2f4/734c6c7dbffc4fd6b519c78ff77e72d7 [2025-03-09 01:04:41,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:04:41,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:04:41,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:04:41,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:04:41,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:04:41,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbda98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41, skipping insertion in model container [2025-03-09 01:04:41,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:04:41,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:04:41,817 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:04:41,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:04:41,897 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:04:41,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41 WrapperNode [2025-03-09 01:04:41,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:04:41,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:04:41,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:04:41,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:04:41,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,937 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2025-03-09 01:04:41,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:04:41,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:04:41,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:04:41,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:04:41,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:04:41,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,970 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:41,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:04:41,995 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:04:41,995 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:04:41,995 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:04:41,996 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (1/1) ... [2025-03-09 01:04:42,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:04:42,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:04:42,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:04:42,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 01:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-09 01:04:42,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-09 01:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-09 01:04:42,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-09 01:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-09 01:04:42,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-09 01:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-09 01:04:42,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-09 01:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:04:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:04:42,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:04:42,047 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:04:42,147 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:04:42,148 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:04:42,405 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:04:42,406 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:04:42,641 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:04:42,641 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:04:42,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:04:42 BoogieIcfgContainer [2025-03-09 01:04:42,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:04:42,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:04:42,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:04:42,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:04:42,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:04:41" (1/3) ... [2025-03-09 01:04:42,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751e3ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:04:42, skipping insertion in model container [2025-03-09 01:04:42,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:04:41" (2/3) ... [2025-03-09 01:04:42,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751e3ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:04:42, skipping insertion in model container [2025-03-09 01:04:42,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:04:42" (3/3) ... [2025-03-09 01:04:42,650 INFO L128 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2025-03-09 01:04:42,660 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:04:42,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix044.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-09 01:04:42,662 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:04:42,721 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 01:04:42,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2025-03-09 01:04:42,772 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-03-09 01:04:42,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:04:42,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-03-09 01:04:42,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2025-03-09 01:04:42,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2025-03-09 01:04:42,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:04:42,790 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;@4121c953, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:04:42,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 01:04:42,798 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:04:42,803 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-09 01:04:42,803 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:04:42,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:42,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:42,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:42,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1735828924, now seen corresponding path program 1 times [2025-03-09 01:04:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:04:42,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850950388] [2025-03-09 01:04:42,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:42,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:04:42,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:04:42,820 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:04:42,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:04:42,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:04:42,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:04:42,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:42,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:42,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:04:42,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:04:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:42,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:04:42,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:04:42,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850950388] [2025-03-09 01:04:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850950388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:42,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:42,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:04:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562732315] [2025-03-09 01:04:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:04:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:04:42,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:04:42,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:04:42,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:42,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:42,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:42,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:42,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:47,857 INFO L124 PetriNetUnfolderBase]: 57803/76523 cut-off events. [2025-03-09 01:04:47,858 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-03-09 01:04:48,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152647 conditions, 76523 events. 57803/76523 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 2139. Compared 453908 event pairs, 6395 based on Foata normal form. 3456/79936 useless extension candidates. Maximal degree in co-relation 152635. Up to 66529 conditions per place. [2025-03-09 01:04:48,333 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 59 selfloop transitions, 2 changer transitions 2/71 dead transitions. [2025-03-09 01:04:48,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 280 flow [2025-03-09 01:04:48,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:04:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:04:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-09 01:04:48,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2025-03-09 01:04:48,345 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 104 transitions. [2025-03-09 01:04:48,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 280 flow [2025-03-09 01:04:48,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:04:48,361 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-03-09 01:04:48,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-03-09 01:04:48,366 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2025-03-09 01:04:48,366 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-03-09 01:04:48,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:48,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:48,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:48,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:04:48,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:04:48,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:48,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:48,570 INFO L85 PathProgramCache]: Analyzing trace with hash 840143966, now seen corresponding path program 1 times [2025-03-09 01:04:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:04:48,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1800984043] [2025-03-09 01:04:48,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:48,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:04:48,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:04:48,575 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:04:48,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:04:48,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:04:48,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:04:48,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:48,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:48,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 01:04:48,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:04:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:48,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:04:48,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:04:48,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800984043] [2025-03-09 01:04:48,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800984043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:48,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:48,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:04:48,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590775244] [2025-03-09 01:04:48,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:48,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:04:48,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:04:48,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:04:48,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:04:48,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2025-03-09 01:04:48,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:48,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:48,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2025-03-09 01:04:48,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:52,132 INFO L124 PetriNetUnfolderBase]: 51971/72419 cut-off events. [2025-03-09 01:04:52,132 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2025-03-09 01:04:52,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142925 conditions, 72419 events. 51971/72419 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 2166. Compared 474454 event pairs, 51971 based on Foata normal form. 1728/73888 useless extension candidates. Maximal degree in co-relation 142915. Up to 68040 conditions per place. [2025-03-09 01:04:52,582 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 36 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-03-09 01:04:52,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 178 flow [2025-03-09 01:04:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:04:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:04:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-09 01:04:52,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-09 01:04:52,587 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 72 transitions. [2025-03-09 01:04:52,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 178 flow [2025-03-09 01:04:52,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:04:52,615 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-03-09 01:04:52,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-03-09 01:04:52,616 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-03-09 01:04:52,617 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-03-09 01:04:52,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:52,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:52,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:52,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:04:52,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:04:52,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:52,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash 840144759, now seen corresponding path program 1 times [2025-03-09 01:04:52,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:04:52,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375144080] [2025-03-09 01:04:52,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:52,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:04:52,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:04:52,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:04:52,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:04:52,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:04:52,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:04:52,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:52,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:52,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:04:52,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:04:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:52,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:04:52,946 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:04:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375144080] [2025-03-09 01:04:52,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375144080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:52,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:52,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:04:52,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395041497] [2025-03-09 01:04:52,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:52,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:04:52,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:04:52,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:04:52,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:04:52,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:52,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:52,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:52,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:52,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:55,593 INFO L124 PetriNetUnfolderBase]: 41411/59251 cut-off events. [2025-03-09 01:04:55,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:04:55,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114949 conditions, 59251 events. 41411/59251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1830. Compared 405983 event pairs, 5075 based on Foata normal form. 1728/60956 useless extension candidates. Maximal degree in co-relation 114943. Up to 33841 conditions per place. [2025-03-09 01:04:55,854 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 78 selfloop transitions, 6 changer transitions 1/92 dead transitions. [2025-03-09 01:04:55,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 370 flow [2025-03-09 01:04:55,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:04:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:04:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-09 01:04:55,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-03-09 01:04:55,860 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 135 transitions. [2025-03-09 01:04:55,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 370 flow [2025-03-09 01:04:55,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:04:55,862 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2025-03-09 01:04:55,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-03-09 01:04:55,864 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2025-03-09 01:04:55,864 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2025-03-09 01:04:55,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:55,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:55,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:55,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:04:56,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:04:56,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:56,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:56,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1307180185, now seen corresponding path program 1 times [2025-03-09 01:04:56,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:04:56,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970843939] [2025-03-09 01:04:56,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:56,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:04:56,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:04:56,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:04:56,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:04:56,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:04:56,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:04:56,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:56,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:56,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:04:56,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:04:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:56,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:04:56,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:04:56,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970843939] [2025-03-09 01:04:56,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970843939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:56,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:56,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:04:56,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461215885] [2025-03-09 01:04:56,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:56,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:04:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:04:56,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:04:56,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:04:56,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:56,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:56,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:56,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:56,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:58,345 INFO L124 PetriNetUnfolderBase]: 25795/36915 cut-off events. [2025-03-09 01:04:58,345 INFO L125 PetriNetUnfolderBase]: For 7046/7046 co-relation queries the response was YES. [2025-03-09 01:04:58,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81796 conditions, 36915 events. 25795/36915 cut-off events. For 7046/7046 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 232949 event pairs, 2975 based on Foata normal form. 1344/38236 useless extension candidates. Maximal degree in co-relation 81787. Up to 14833 conditions per place. [2025-03-09 01:04:58,504 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 101 selfloop transitions, 10 changer transitions 1/119 dead transitions. [2025-03-09 01:04:58,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 534 flow [2025-03-09 01:04:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:04:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:04:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-03-09 01:04:58,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6327272727272727 [2025-03-09 01:04:58,506 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 174 transitions. [2025-03-09 01:04:58,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 534 flow [2025-03-09 01:04:58,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 523 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:04:58,514 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2025-03-09 01:04:58,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2025-03-09 01:04:58,515 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-03-09 01:04:58,515 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2025-03-09 01:04:58,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:58,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:04:58,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:04:58,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:04:58,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:04:58,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:04:58,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:04:58,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1693056077, now seen corresponding path program 1 times [2025-03-09 01:04:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:04:58,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580336988] [2025-03-09 01:04:58,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:04:58,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:04:58,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:04:58,723 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:04:58,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:04:58,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:04:58,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:04:58,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:04:58,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:04:58,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:04:58,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:04:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:04:58,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:04:58,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:04:58,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580336988] [2025-03-09 01:04:58,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580336988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:04:58,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:04:58,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:04:58,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371281321] [2025-03-09 01:04:58,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:04:58,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:04:58,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:04:58,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:04:58,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:04:58,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:04:58,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:04:58,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:04:58,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:04:58,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:04:59,934 INFO L124 PetriNetUnfolderBase]: 15171/21267 cut-off events. [2025-03-09 01:04:59,935 INFO L125 PetriNetUnfolderBase]: For 12946/12946 co-relation queries the response was YES. [2025-03-09 01:04:59,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51864 conditions, 21267 events. 15171/21267 cut-off events. For 12946/12946 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 117658 event pairs, 2591 based on Foata normal form. 640/21884 useless extension candidates. Maximal degree in co-relation 51853. Up to 6144 conditions per place. [2025-03-09 01:05:00,007 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 122 selfloop transitions, 14 changer transitions 1/144 dead transitions. [2025-03-09 01:05:00,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 144 transitions, 697 flow [2025-03-09 01:05:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:05:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:05:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-03-09 01:05:00,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6393939393939394 [2025-03-09 01:05:00,009 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 211 transitions. [2025-03-09 01:05:00,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 144 transitions, 697 flow [2025-03-09 01:05:00,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 144 transitions, 667 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-09 01:05:00,137 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2025-03-09 01:05:00,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-03-09 01:05:00,137 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-03-09 01:05:00,138 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2025-03-09 01:05:00,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:05:00,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:05:00,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:05:00,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:05:00,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:00,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:05:00,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:05:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash 17106195, now seen corresponding path program 1 times [2025-03-09 01:05:00,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:05:00,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634666000] [2025-03-09 01:05:00,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:05:00,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:00,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:05:00,345 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:05:00,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:05:00,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:05:00,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:05:00,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:05:00,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:05:00,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:05:00,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:05:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:05:00,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:05:00,485 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:05:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634666000] [2025-03-09 01:05:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634666000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:05:00,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:05:00,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:05:00,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542630952] [2025-03-09 01:05:00,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:05:00,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:05:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:05:00,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:05:00,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:05:00,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:05:00,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:05:00,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:05:00,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:05:00,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:05:01,351 INFO L124 PetriNetUnfolderBase]: 11715/16035 cut-off events. [2025-03-09 01:05:01,351 INFO L125 PetriNetUnfolderBase]: For 12458/12458 co-relation queries the response was YES. [2025-03-09 01:05:01,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40649 conditions, 16035 events. 11715/16035 cut-off events. For 12458/12458 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 83989 event pairs, 2399 based on Foata normal form. 160/16172 useless extension candidates. Maximal degree in co-relation 40637. Up to 6144 conditions per place. [2025-03-09 01:05:01,401 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 105 selfloop transitions, 18 changer transitions 1/131 dead transitions. [2025-03-09 01:05:01,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 655 flow [2025-03-09 01:05:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:05:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:05:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2025-03-09 01:05:01,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-09 01:05:01,402 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 210 transitions. [2025-03-09 01:05:01,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 655 flow [2025-03-09 01:05:01,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 609 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-09 01:05:01,568 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2025-03-09 01:05:01,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2025-03-09 01:05:01,569 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-03-09 01:05:01,569 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2025-03-09 01:05:01,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:05:01,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:05:01,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:05:01,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:05:01,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:01,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:05:01,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:05:01,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1034842970, now seen corresponding path program 1 times [2025-03-09 01:05:01,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:05:01,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201859834] [2025-03-09 01:05:01,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:05:01,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:01,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:05:01,777 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:05:01,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:05:01,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:05:01,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:05:01,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:05:01,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:05:01,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:05:01,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:05:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:05:02,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:05:02,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:05:02,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201859834] [2025-03-09 01:05:02,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201859834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:05:02,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:05:02,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:05:02,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626226688] [2025-03-09 01:05:02,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:05:02,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:05:02,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:05:02,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:05:02,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:05:02,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:05:02,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:05:02,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:05:02,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:05:02,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:05:03,115 INFO L124 PetriNetUnfolderBase]: 17367/23775 cut-off events. [2025-03-09 01:05:03,115 INFO L125 PetriNetUnfolderBase]: For 18230/18230 co-relation queries the response was YES. [2025-03-09 01:05:03,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60622 conditions, 23775 events. 17367/23775 cut-off events. For 18230/18230 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 131349 event pairs, 1643 based on Foata normal form. 16/23780 useless extension candidates. Maximal degree in co-relation 60609. Up to 12708 conditions per place. [2025-03-09 01:05:03,263 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 72 selfloop transitions, 1 changer transitions 53/133 dead transitions. [2025-03-09 01:05:03,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 133 transitions, 841 flow [2025-03-09 01:05:03,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:05:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:05:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2025-03-09 01:05:03,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4701298701298701 [2025-03-09 01:05:03,265 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 7 states and 181 transitions. [2025-03-09 01:05:03,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 133 transitions, 841 flow [2025-03-09 01:05:03,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 133 transitions, 616 flow, removed 34 selfloop flow, removed 10 redundant places. [2025-03-09 01:05:03,580 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 168 flow [2025-03-09 01:05:03,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2025-03-09 01:05:03,581 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-03-09 01:05:03,581 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 168 flow [2025-03-09 01:05:03,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:05:03,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:05:03,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:05:03,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:05:03,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:03,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:05:03,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:05:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1851388488, now seen corresponding path program 2 times [2025-03-09 01:05:03,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:05:03,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366833680] [2025-03-09 01:05:03,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:05:03,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:03,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:05:03,787 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:05:03,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:05:03,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:05:03,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:05:03,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:05:03,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:05:03,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:05:03,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:05:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:05:04,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:05:04,095 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:05:04,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366833680] [2025-03-09 01:05:04,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366833680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:05:04,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:05:04,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:05:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541098947] [2025-03-09 01:05:04,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:05:04,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:05:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:05:04,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:05:04,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:05:04,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:05:04,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:05:04,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:05:04,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:05:04,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:05:04,959 INFO L124 PetriNetUnfolderBase]: 14671/20336 cut-off events. [2025-03-09 01:05:04,959 INFO L125 PetriNetUnfolderBase]: For 4743/4745 co-relation queries the response was YES. [2025-03-09 01:05:05,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45814 conditions, 20336 events. 14671/20336 cut-off events. For 4743/4745 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 114398 event pairs, 2057 based on Foata normal form. 16/20345 useless extension candidates. Maximal degree in co-relation 45802. Up to 12628 conditions per place. [2025-03-09 01:05:05,058 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 68 selfloop transitions, 1 changer transitions 57/133 dead transitions. [2025-03-09 01:05:05,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 133 transitions, 647 flow [2025-03-09 01:05:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:05:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:05:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2025-03-09 01:05:05,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4701298701298701 [2025-03-09 01:05:05,060 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 168 flow. Second operand 7 states and 181 transitions. [2025-03-09 01:05:05,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 133 transitions, 647 flow [2025-03-09 01:05:05,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 133 transitions, 630 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-09 01:05:05,066 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 172 flow [2025-03-09 01:05:05,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2025-03-09 01:05:05,067 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2025-03-09 01:05:05,067 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 172 flow [2025-03-09 01:05:05,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:05:05,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:05:05,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:05:05,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:05:05,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:05,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:05:05,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:05:05,268 INFO L85 PathProgramCache]: Analyzing trace with hash 378070230, now seen corresponding path program 3 times [2025-03-09 01:05:05,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:05:05,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [421714421] [2025-03-09 01:05:05,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:05:05,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:05,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:05:05,271 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:05:05,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:05:05,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:05:05,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:05:05,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:05:05,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:05:05,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:05:05,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:05:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:05:05,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:05:05,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 01:05:05,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421714421] [2025-03-09 01:05:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421714421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:05:05,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:05:05,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:05:05,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109188717] [2025-03-09 01:05:05,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:05:05,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:05:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 01:05:05,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:05:05,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:05:05,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 55 [2025-03-09 01:05:05,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:05:05,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:05:05,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 55 [2025-03-09 01:05:05,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:05:06,701 INFO L124 PetriNetUnfolderBase]: 15929/22393 cut-off events. [2025-03-09 01:05:06,701 INFO L125 PetriNetUnfolderBase]: For 5232/5245 co-relation queries the response was YES. [2025-03-09 01:05:06,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51526 conditions, 22393 events. 15929/22393 cut-off events. For 5232/5245 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 132195 event pairs, 7343 based on Foata normal form. 16/22375 useless extension candidates. Maximal degree in co-relation 51513. Up to 12607 conditions per place. [2025-03-09 01:05:06,789 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 56 selfloop transitions, 2 changer transitions 46/111 dead transitions. [2025-03-09 01:05:06,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 539 flow [2025-03-09 01:05:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:05:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:05:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2025-03-09 01:05:06,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2025-03-09 01:05:06,791 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 172 flow. Second operand 6 states and 153 transitions. [2025-03-09 01:05:06,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 539 flow [2025-03-09 01:05:06,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 111 transitions, 524 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-09 01:05:06,797 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 177 flow [2025-03-09 01:05:06,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2025-03-09 01:05:06,798 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2025-03-09 01:05:06,798 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 177 flow [2025-03-09 01:05:06,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:05:06,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:05:06,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:05:06,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:05:06,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:06,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-09 01:05:06,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:05:06,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1302500584, now seen corresponding path program 4 times [2025-03-09 01:05:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 01:05:07,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481864927] [2025-03-09 01:05:07,000 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:05:07,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:07,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:05:07,002 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:05:07,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:05:07,054 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-03-09 01:05:07,076 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:05:07,076 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:05:07,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:05:07,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:05:07,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:05:07,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:05:07,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:05:07,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:05:07,156 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 01:05:07,157 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:05:07,158 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-03-09 01:05:07,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-03-09 01:05:07,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-03-09 01:05:07,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-03-09 01:05:07,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2025-03-09 01:05:07,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2025-03-09 01:05:07,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-03-09 01:05:07,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-09 01:05:07,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:05:07,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:05:07,364 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-03-09 01:05:07,461 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:05:07,461 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:05:07,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:05:07 BasicIcfg [2025-03-09 01:05:07,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:05:07,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:05:07,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:05:07,465 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:05:07,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:04:42" (3/4) ... [2025-03-09 01:05:07,467 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:05:07,467 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:05:07,468 INFO L158 Benchmark]: Toolchain (without parser) took 25981.99ms. Allocated memory was 83.9MB in the beginning and 6.2GB in the end (delta: 6.2GB). Free memory was 58.3MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2025-03-09 01:05:07,468 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:05:07,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.49ms. Allocated memory is still 83.9MB. Free memory was 58.3MB in the beginning and 34.9MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:05:07,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.45ms. Allocated memory is still 83.9MB. Free memory was 34.9MB in the beginning and 32.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:05:07,468 INFO L158 Benchmark]: Boogie Preprocessor took 56.34ms. Allocated memory is still 83.9MB. Free memory was 32.3MB in the beginning and 58.5MB in the end (delta: -26.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2025-03-09 01:05:07,469 INFO L158 Benchmark]: IcfgBuilder took 646.68ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 58.5MB in the beginning and 43.8MB in the end (delta: 14.6MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2025-03-09 01:05:07,469 INFO L158 Benchmark]: TraceAbstraction took 24821.15ms. Allocated memory was 109.1MB in the beginning and 6.2GB in the end (delta: 6.1GB). Free memory was 43.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2025-03-09 01:05:07,469 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 6.2GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 123.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:05:07,470 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.19ms. Allocated memory is still 83.9MB. Free memory was 62.1MB in the beginning and 62.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.49ms. Allocated memory is still 83.9MB. Free memory was 58.3MB in the beginning and 34.9MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.45ms. Allocated memory is still 83.9MB. Free memory was 34.9MB in the beginning and 32.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.34ms. Allocated memory is still 83.9MB. Free memory was 32.3MB in the beginning and 58.5MB in the end (delta: -26.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * IcfgBuilder took 646.68ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 58.5MB in the beginning and 43.8MB in the end (delta: 14.6MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24821.15ms. Allocated memory was 109.1MB in the beginning and 6.2GB in the end (delta: 6.1GB). Free memory was 43.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 6.2GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 123.7kB). Peak memory consumption was 8.4MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-3, t1166=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-3, t1166=-2, t1167=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1165=-3, t1166=-2, t1167=-1, t1168=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-3, t1166=-2, t1167=-1, t1168=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-3, t1166=-2, t1167=-1, t1168=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165=-3, t1166=-2, t1167=-1, t1168=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix044.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: 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: 853]: 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: 849]: 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 9 procedures, 89 locations, 86 edges, 8 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: 24.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 744 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 737 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2289 IncrementalHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1 mSDtfsCounter, 2289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=6, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 581 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1105 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 01:05:07,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample