./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix033.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix033.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 eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:06:38,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:06:38,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:06:38,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:06:38,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:06:38,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:06:38,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:06:38,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:06:38,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:06:38,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:06:38,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:06:38,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:06:38,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:06:38,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:06:38,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:06:38,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:06:38,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:06:38,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:06:38,279 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 -> eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e [2025-03-17 14:06:38,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:06:38,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:06:38,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:06:38,512 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:06:38,512 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:06:38,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033.opt.i [2025-03-17 14:06:39,677 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a46f4f8c/abf676ae3eaf4df2a7e253a9aa5adb78/FLAGc47ae062a [2025-03-17 14:06:39,917 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:06:39,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033.opt.i [2025-03-17 14:06:39,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a46f4f8c/abf676ae3eaf4df2a7e253a9aa5adb78/FLAGc47ae062a [2025-03-17 14:06:40,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a46f4f8c/abf676ae3eaf4df2a7e253a9aa5adb78 [2025-03-17 14:06:40,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:06:40,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:06:40,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:06:40,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:06:40,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:06:40,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6dcd20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40, skipping insertion in model container [2025-03-17 14:06:40,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:06:40,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:06:40,492 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:06:40,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:06:40,584 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:06:40,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40 WrapperNode [2025-03-17 14:06:40,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:06:40,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:06:40,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:06:40,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:06:40,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,617 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 129 [2025-03-17 14:06:40,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:06:40,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:06:40,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:06:40,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:06:40,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,638 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:06:40,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,643 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:06:40,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:06:40,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:06:40,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:06:40,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (1/1) ... [2025-03-17 14:06:40,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:06:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:06:40,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:06:40,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:06:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:06:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:06:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:06:40,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:06:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:06:40,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:06:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 14:06:40,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 14:06:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:06:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:06:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:06:40,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:06:40,701 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:06:40,798 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:06:40,800 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:06:41,073 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:06:41,073 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:06:41,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:06:41,251 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:06:41,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:06:41 BoogieIcfgContainer [2025-03-17 14:06:41,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:06:41,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:06:41,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:06:41,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:06:41,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:06:40" (1/3) ... [2025-03-17 14:06:41,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74893048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:06:41, skipping insertion in model container [2025-03-17 14:06:41,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:40" (2/3) ... [2025-03-17 14:06:41,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74893048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:06:41, skipping insertion in model container [2025-03-17 14:06:41,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:06:41" (3/3) ... [2025-03-17 14:06:41,259 INFO L128 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2025-03-17 14:06:41,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:06:41,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix033.opt.i that has 4 procedures, 47 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-17 14:06:41,272 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:06:41,317 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:06:41,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2025-03-17 14:06:41,370 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2025-03-17 14:06:41,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:06:41,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-03-17 14:06:41,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2025-03-17 14:06:41,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2025-03-17 14:06:41,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:06:41,397 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;@46c245e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:06:41,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 14:06:41,407 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:06:41,408 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-17 14:06:41,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:06:41,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:41,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:06:41,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:41,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1926736038, now seen corresponding path program 1 times [2025-03-17 14:06:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:41,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155711546] [2025-03-17 14:06:41,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:06:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:41,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:06:41,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:06:41,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:41,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:41,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:41,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155711546] [2025-03-17 14:06:41,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155711546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:41,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:41,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:06:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010106515] [2025-03-17 14:06:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:41,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:06:41,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:41,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:06:41,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:06:41,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:06:41,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:41,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:41,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:06:41,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:42,907 INFO L124 PetriNetUnfolderBase]: 9711/13863 cut-off events. [2025-03-17 14:06:42,907 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-17 14:06:42,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27638 conditions, 13863 events. 9711/13863 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 77627 event pairs, 947 based on Foata normal form. 768/14616 useless extension candidates. Maximal degree in co-relation 27627. Up to 12125 conditions per place. [2025-03-17 14:06:43,012 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 51 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2025-03-17 14:06:43,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 243 flow [2025-03-17 14:06:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:06:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:06:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-17 14:06:43,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-17 14:06:43,023 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 90 transitions. [2025-03-17 14:06:43,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 243 flow [2025-03-17 14:06:43,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 240 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:06:43,029 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2025-03-17 14:06:43,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-17 14:06:43,035 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-03-17 14:06:43,035 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2025-03-17 14:06:43,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:43,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:43,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:06:43,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:06:43,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:43,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash -98556030, now seen corresponding path program 1 times [2025-03-17 14:06:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:43,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016317976] [2025-03-17 14:06:43,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:06:43,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:43,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:06:43,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:06:43,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:43,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:43,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016317976] [2025-03-17 14:06:43,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016317976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:43,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:43,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:06:43,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904121519] [2025-03-17 14:06:43,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:43,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:06:43,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:43,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:06:43,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:06:43,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-17 14:06:43,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:43,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:43,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-17 14:06:43,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:43,856 INFO L124 PetriNetUnfolderBase]: 8719/13111 cut-off events. [2025-03-17 14:06:43,856 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-03-17 14:06:43,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25941 conditions, 13111 events. 8719/13111 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 79110 event pairs, 8719 based on Foata normal form. 384/13432 useless extension candidates. Maximal degree in co-relation 25931. Up to 12284 conditions per place. [2025-03-17 14:06:43,926 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 31 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-03-17 14:06:43,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 154 flow [2025-03-17 14:06:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:06:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:06:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-17 14:06:43,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2025-03-17 14:06:43,930 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 3 states and 61 transitions. [2025-03-17 14:06:43,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 154 flow [2025-03-17 14:06:43,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:06:43,936 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2025-03-17 14:06:43,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-03-17 14:06:43,937 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-03-17 14:06:43,937 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2025-03-17 14:06:43,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:43,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:43,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:06:43,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:06:43,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:43,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:43,938 INFO L85 PathProgramCache]: Analyzing trace with hash -98554942, now seen corresponding path program 1 times [2025-03-17 14:06:43,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:43,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854713020] [2025-03-17 14:06:43,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:06:43,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:43,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:06:43,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:06:43,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:43,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854713020] [2025-03-17 14:06:44,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854713020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:44,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:44,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:06:44,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324911638] [2025-03-17 14:06:44,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:44,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:06:44,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:44,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:06:44,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:06:44,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-17 14:06:44,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:44,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:44,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-17 14:06:44,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:45,724 INFO L124 PetriNetUnfolderBase]: 18011/26393 cut-off events. [2025-03-17 14:06:45,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:06:45,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52203 conditions, 26393 events. 18011/26393 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 171797 event pairs, 4264 based on Foata normal form. 0/25756 useless extension candidates. Maximal degree in co-relation 52197. Up to 11115 conditions per place. [2025-03-17 14:06:45,813 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 52 selfloop transitions, 7 changer transitions 119/183 dead transitions. [2025-03-17 14:06:45,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 183 transitions, 732 flow [2025-03-17 14:06:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:06:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:06:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 261 transitions. [2025-03-17 14:06:45,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-17 14:06:45,815 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 9 states and 261 transitions. [2025-03-17 14:06:45,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 183 transitions, 732 flow [2025-03-17 14:06:45,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 183 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:06:45,819 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 179 flow [2025-03-17 14:06:45,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=179, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2025-03-17 14:06:45,820 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-03-17 14:06:45,820 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 179 flow [2025-03-17 14:06:45,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:45,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:45,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:06:45,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:06:45,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:45,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:45,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1567815635, now seen corresponding path program 1 times [2025-03-17 14:06:45,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:45,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485794154] [2025-03-17 14:06:45,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:06:45,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:45,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:06:45,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:06:45,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:45,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:46,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:46,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485794154] [2025-03-17 14:06:46,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485794154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:46,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:46,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:06:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12710410] [2025-03-17 14:06:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:46,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:06:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:46,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:06:46,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:06:46,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-17 14:06:46,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:46,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:46,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-17 14:06:46,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:47,430 INFO L124 PetriNetUnfolderBase]: 12844/18960 cut-off events. [2025-03-17 14:06:47,430 INFO L125 PetriNetUnfolderBase]: For 19098/19100 co-relation queries the response was YES. [2025-03-17 14:06:47,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52152 conditions, 18960 events. 12844/18960 cut-off events. For 19098/19100 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 114696 event pairs, 3142 based on Foata normal form. 560/19505 useless extension candidates. Maximal degree in co-relation 52137. Up to 7293 conditions per place. [2025-03-17 14:06:47,522 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 64 selfloop transitions, 8 changer transitions 94/171 dead transitions. [2025-03-17 14:06:47,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 171 transitions, 981 flow [2025-03-17 14:06:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:06:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:06:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2025-03-17 14:06:47,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51875 [2025-03-17 14:06:47,524 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 179 flow. Second operand 10 states and 249 transitions. [2025-03-17 14:06:47,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 171 transitions, 981 flow [2025-03-17 14:06:47,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 171 transitions, 873 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-03-17 14:06:47,592 INFO L231 Difference]: Finished difference. Result has 69 places, 47 transitions, 231 flow [2025-03-17 14:06:47,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=231, PETRI_PLACES=69, PETRI_TRANSITIONS=47} [2025-03-17 14:06:47,593 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2025-03-17 14:06:47,593 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 47 transitions, 231 flow [2025-03-17 14:06:47,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:47,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:47,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:06:47,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:06:47,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:47,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:47,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641871, now seen corresponding path program 1 times [2025-03-17 14:06:47,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:47,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336403576] [2025-03-17 14:06:47,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:06:47,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:47,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:06:47,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:06:47,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:47,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:47,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:47,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336403576] [2025-03-17 14:06:47,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336403576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:47,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:47,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:06:47,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378674609] [2025-03-17 14:06:47,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:47,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:06:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:47,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:06:47,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:06:47,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-17 14:06:47,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 47 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:47,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:47,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-17 14:06:47,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:49,044 INFO L124 PetriNetUnfolderBase]: 11797/17469 cut-off events. [2025-03-17 14:06:49,045 INFO L125 PetriNetUnfolderBase]: For 29140/29142 co-relation queries the response was YES. [2025-03-17 14:06:49,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50819 conditions, 17469 events. 11797/17469 cut-off events. For 29140/29142 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 106978 event pairs, 2091 based on Foata normal form. 396/17863 useless extension candidates. Maximal degree in co-relation 50797. Up to 9341 conditions per place. [2025-03-17 14:06:49,116 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 66 selfloop transitions, 15 changer transitions 78/164 dead transitions. [2025-03-17 14:06:49,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 164 transitions, 1005 flow [2025-03-17 14:06:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:06:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:06:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2025-03-17 14:06:49,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-03-17 14:06:49,118 INFO L175 Difference]: Start difference. First operand has 69 places, 47 transitions, 231 flow. Second operand 10 states and 246 transitions. [2025-03-17 14:06:49,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 164 transitions, 1005 flow [2025-03-17 14:06:49,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 164 transitions, 955 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-03-17 14:06:49,345 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 310 flow [2025-03-17 14:06:49,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=310, PETRI_PLACES=75, PETRI_TRANSITIONS=51} [2025-03-17 14:06:49,346 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2025-03-17 14:06:49,346 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 51 transitions, 310 flow [2025-03-17 14:06:49,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:49,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:49,346 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] [2025-03-17 14:06:49,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:06:49,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:49,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2080716304, now seen corresponding path program 1 times [2025-03-17 14:06:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:49,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665888708] [2025-03-17 14:06:49,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:06:49,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:49,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:06:49,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:06:49,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:49,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:49,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:49,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665888708] [2025-03-17 14:06:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665888708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:49,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:49,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:06:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700129114] [2025-03-17 14:06:49,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:49,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:06:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:49,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:06:49,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:06:49,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-17 14:06:49,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 51 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:49,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:49,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-17 14:06:49,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:50,661 INFO L124 PetriNetUnfolderBase]: 10864/16168 cut-off events. [2025-03-17 14:06:50,662 INFO L125 PetriNetUnfolderBase]: For 32881/32887 co-relation queries the response was YES. [2025-03-17 14:06:50,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49437 conditions, 16168 events. 10864/16168 cut-off events. For 32881/32887 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 97069 event pairs, 3516 based on Foata normal form. 370/16529 useless extension candidates. Maximal degree in co-relation 49410. Up to 9681 conditions per place. [2025-03-17 14:06:50,763 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 63 selfloop transitions, 4 changer transitions 61/133 dead transitions. [2025-03-17 14:06:50,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 133 transitions, 986 flow [2025-03-17 14:06:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:06:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:06:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-03-17 14:06:50,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-17 14:06:50,765 INFO L175 Difference]: Start difference. First operand has 75 places, 51 transitions, 310 flow. Second operand 7 states and 168 transitions. [2025-03-17 14:06:50,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 133 transitions, 986 flow [2025-03-17 14:06:51,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 133 transitions, 932 flow, removed 27 selfloop flow, removed 10 redundant places. [2025-03-17 14:06:51,119 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 302 flow [2025-03-17 14:06:51,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2025-03-17 14:06:51,120 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2025-03-17 14:06:51,120 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 302 flow [2025-03-17 14:06:51,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:51,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:51,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:06:51,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:06:51,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:51,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash 702720883, now seen corresponding path program 1 times [2025-03-17 14:06:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265889644] [2025-03-17 14:06:51,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:06:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:51,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:06:51,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:06:51,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:51,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265889644] [2025-03-17 14:06:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265889644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:51,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:06:51,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834584338] [2025-03-17 14:06:51,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:51,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:06:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:51,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:06:51,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:06:51,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:06:51,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:51,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:51,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:06:51,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:52,158 INFO L124 PetriNetUnfolderBase]: 8038/12240 cut-off events. [2025-03-17 14:06:52,158 INFO L125 PetriNetUnfolderBase]: For 20637/20643 co-relation queries the response was YES. [2025-03-17 14:06:52,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35974 conditions, 12240 events. 8038/12240 cut-off events. For 20637/20643 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 73144 event pairs, 1554 based on Foata normal form. 628/12860 useless extension candidates. Maximal degree in co-relation 35950. Up to 5811 conditions per place. [2025-03-17 14:06:52,234 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 103 selfloop transitions, 5 changer transitions 1/114 dead transitions. [2025-03-17 14:06:52,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 114 transitions, 938 flow [2025-03-17 14:06:52,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:06:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:06:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-17 14:06:52,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-17 14:06:52,235 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 302 flow. Second operand 4 states and 115 transitions. [2025-03-17 14:06:52,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 114 transitions, 938 flow [2025-03-17 14:06:52,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 114 transitions, 908 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-17 14:06:52,285 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 318 flow [2025-03-17 14:06:52,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2025-03-17 14:06:52,286 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-03-17 14:06:52,286 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 318 flow [2025-03-17 14:06:52,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:52,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:52,286 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] [2025-03-17 14:06:52,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:06:52,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:52,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1509762191, now seen corresponding path program 1 times [2025-03-17 14:06:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75247012] [2025-03-17 14:06:52,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:06:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:52,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:06:52,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:06:52,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:52,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:52,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75247012] [2025-03-17 14:06:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75247012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:52,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:52,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:06:52,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985469706] [2025-03-17 14:06:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:52,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:06:52,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:52,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:06:52,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:06:52,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:06:52,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:52,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:52,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:06:52,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:52,944 INFO L124 PetriNetUnfolderBase]: 4804/7380 cut-off events. [2025-03-17 14:06:52,944 INFO L125 PetriNetUnfolderBase]: For 11761/11767 co-relation queries the response was YES. [2025-03-17 14:06:52,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23149 conditions, 7380 events. 4804/7380 cut-off events. For 11761/11767 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 40292 event pairs, 938 based on Foata normal form. 418/7790 useless extension candidates. Maximal degree in co-relation 23127. Up to 2797 conditions per place. [2025-03-17 14:06:52,980 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 120 selfloop transitions, 8 changer transitions 2/135 dead transitions. [2025-03-17 14:06:52,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 135 transitions, 1079 flow [2025-03-17 14:06:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:06:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:06:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-03-17 14:06:52,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6125 [2025-03-17 14:06:52,981 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 318 flow. Second operand 5 states and 147 transitions. [2025-03-17 14:06:52,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 135 transitions, 1079 flow [2025-03-17 14:06:52,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 135 transitions, 1069 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:06:52,993 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 358 flow [2025-03-17 14:06:52,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2025-03-17 14:06:52,994 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2025-03-17 14:06:52,994 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 358 flow [2025-03-17 14:06:52,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:52,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:52,994 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] [2025-03-17 14:06:52,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:06:52,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:52,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1996872482, now seen corresponding path program 1 times [2025-03-17 14:06:52,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56686029] [2025-03-17 14:06:52,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:06:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:53,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:06:53,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:06:53,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:53,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:53,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:53,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56686029] [2025-03-17 14:06:53,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56686029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:53,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:53,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:06:53,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276851730] [2025-03-17 14:06:53,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:53,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:06:53,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:53,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:06:53,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:06:53,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:06:53,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:53,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:53,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:06:53,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:53,529 INFO L124 PetriNetUnfolderBase]: 3191/4845 cut-off events. [2025-03-17 14:06:53,529 INFO L125 PetriNetUnfolderBase]: For 9804/9810 co-relation queries the response was YES. [2025-03-17 14:06:53,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16287 conditions, 4845 events. 3191/4845 cut-off events. For 9804/9810 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 24720 event pairs, 801 based on Foata normal form. 136/4973 useless extension candidates. Maximal degree in co-relation 16263. Up to 1930 conditions per place. [2025-03-17 14:06:53,552 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 99 selfloop transitions, 11 changer transitions 3/118 dead transitions. [2025-03-17 14:06:53,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 118 transitions, 944 flow [2025-03-17 14:06:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:06:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:06:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-17 14:06:53,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2025-03-17 14:06:53,553 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 358 flow. Second operand 6 states and 145 transitions. [2025-03-17 14:06:53,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 118 transitions, 944 flow [2025-03-17 14:06:53,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 118 transitions, 894 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-17 14:06:53,575 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 356 flow [2025-03-17 14:06:53,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=356, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2025-03-17 14:06:53,575 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2025-03-17 14:06:53,576 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 356 flow [2025-03-17 14:06:53,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:53,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:53,576 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] [2025-03-17 14:06:53,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:06:53,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:53,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1923004027, now seen corresponding path program 1 times [2025-03-17 14:06:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668050452] [2025-03-17 14:06:53,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:06:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:53,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:06:53,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:06:53,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:53,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:53,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:53,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668050452] [2025-03-17 14:06:53,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668050452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:53,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:53,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:06:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149476470] [2025-03-17 14:06:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:53,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:06:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:53,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:06:53,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:06:53,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-17 14:06:53,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:53,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:53,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-17 14:06:53,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:54,217 INFO L124 PetriNetUnfolderBase]: 4071/6192 cut-off events. [2025-03-17 14:06:54,217 INFO L125 PetriNetUnfolderBase]: For 11896/11896 co-relation queries the response was YES. [2025-03-17 14:06:54,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20409 conditions, 6192 events. 4071/6192 cut-off events. For 11896/11896 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 32511 event pairs, 973 based on Foata normal form. 8/6197 useless extension candidates. Maximal degree in co-relation 20386. Up to 3874 conditions per place. [2025-03-17 14:06:54,241 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 50 selfloop transitions, 1 changer transitions 61/117 dead transitions. [2025-03-17 14:06:54,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 117 transitions, 923 flow [2025-03-17 14:06:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:06:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:06:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-03-17 14:06:54,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-17 14:06:54,243 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 356 flow. Second operand 6 states and 132 transitions. [2025-03-17 14:06:54,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 117 transitions, 923 flow [2025-03-17 14:06:54,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 738 flow, removed 50 selfloop flow, removed 10 redundant places. [2025-03-17 14:06:54,277 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 217 flow [2025-03-17 14:06:54,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2025-03-17 14:06:54,278 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2025-03-17 14:06:54,278 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 217 flow [2025-03-17 14:06:54,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:54,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:54,278 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] [2025-03-17 14:06:54,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:06:54,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:54,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash -497664517, now seen corresponding path program 2 times [2025-03-17 14:06:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:54,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251241716] [2025-03-17 14:06:54,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:06:54,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:54,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:06:54,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:06:54,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:06:54,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:54,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:54,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251241716] [2025-03-17 14:06:54,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251241716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:54,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:54,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:06:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551436542] [2025-03-17 14:06:54,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:54,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:06:54,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:54,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:06:54,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:06:54,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-17 14:06:54,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:54,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:54,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-17 14:06:54,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:54,716 INFO L124 PetriNetUnfolderBase]: 2087/3313 cut-off events. [2025-03-17 14:06:54,717 INFO L125 PetriNetUnfolderBase]: For 2840/2840 co-relation queries the response was YES. [2025-03-17 14:06:54,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8741 conditions, 3313 events. 2087/3313 cut-off events. For 2840/2840 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16393 event pairs, 571 based on Foata normal form. 8/3319 useless extension candidates. Maximal degree in co-relation 8721. Up to 1657 conditions per place. [2025-03-17 14:06:54,728 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 44 selfloop transitions, 4 changer transitions 31/84 dead transitions. [2025-03-17 14:06:54,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 477 flow [2025-03-17 14:06:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:06:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:06:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-03-17 14:06:54,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-17 14:06:54,729 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 217 flow. Second operand 6 states and 120 transitions. [2025-03-17 14:06:54,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 477 flow [2025-03-17 14:06:54,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 436 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-17 14:06:54,736 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 159 flow [2025-03-17 14:06:54,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-03-17 14:06:54,736 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-03-17 14:06:54,736 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 159 flow [2025-03-17 14:06:54,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:54,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:54,737 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] [2025-03-17 14:06:54,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:06:54,737 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:54,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1879702757, now seen corresponding path program 3 times [2025-03-17 14:06:54,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:54,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268952024] [2025-03-17 14:06:54,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:06:54,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:54,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:06:54,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:06:54,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:06:54,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:06:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:06:55,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:06:55,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268952024] [2025-03-17 14:06:55,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268952024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:06:55,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:06:55,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:06:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397117032] [2025-03-17 14:06:55,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:06:55,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:06:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:06:55,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:06:55,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:06:55,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-17 14:06:55,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 159 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:55,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:06:55,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-17 14:06:55,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:06:55,400 INFO L124 PetriNetUnfolderBase]: 885/1451 cut-off events. [2025-03-17 14:06:55,400 INFO L125 PetriNetUnfolderBase]: For 544/544 co-relation queries the response was YES. [2025-03-17 14:06:55,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3576 conditions, 1451 events. 885/1451 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5994 event pairs, 161 based on Foata normal form. 8/1457 useless extension candidates. Maximal degree in co-relation 3559. Up to 646 conditions per place. [2025-03-17 14:06:55,404 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 47 selfloop transitions, 4 changer transitions 36/92 dead transitions. [2025-03-17 14:06:55,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 488 flow [2025-03-17 14:06:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:06:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:06:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2025-03-17 14:06:55,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3587962962962963 [2025-03-17 14:06:55,405 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 159 flow. Second operand 9 states and 155 transitions. [2025-03-17 14:06:55,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 488 flow [2025-03-17 14:06:55,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 432 flow, removed 11 selfloop flow, removed 10 redundant places. [2025-03-17 14:06:55,407 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 143 flow [2025-03-17 14:06:55,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=143, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-03-17 14:06:55,407 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-03-17 14:06:55,407 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 143 flow [2025-03-17 14:06:55,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:06:55,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:06:55,408 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] [2025-03-17 14:06:55,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:06:55,408 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:06:55,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:06:55,408 INFO L85 PathProgramCache]: Analyzing trace with hash -926182253, now seen corresponding path program 4 times [2025-03-17 14:06:55,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:06:55,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772858396] [2025-03-17 14:06:55,408 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:06:55,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:06:55,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-17 14:06:55,447 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:06:55,448 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:06:55,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:06:55,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:06:55,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:06:55,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:06:55,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:06:55,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:06:55,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:06:55,513 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:06:55,514 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-17 14:06:55,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-17 14:06:55,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-17 14:06:55,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-17 14:06:55,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-17 14:06:55,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-17 14:06:55,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-17 14:06:55,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:06:55,518 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:06:55,595 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:06:55,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:06:55,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:06:55 BasicIcfg [2025-03-17 14:06:55,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:06:55,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:06:55,599 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:06:55,600 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:06:55,600 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:06:41" (3/4) ... [2025-03-17 14:06:55,601 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:06:55,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:06:55,602 INFO L158 Benchmark]: Toolchain (without parser) took 15356.62ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 111.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 629.9MB. Max. memory is 16.1GB. [2025-03-17 14:06:55,603 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:06:55,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.84ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 89.0MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:06:55,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.08ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:06:55,604 INFO L158 Benchmark]: Boogie Preprocessor took 28.54ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:06:55,604 INFO L158 Benchmark]: IcfgBuilder took 602.01ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 102.9MB in the end (delta: -18.9MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2025-03-17 14:06:55,604 INFO L158 Benchmark]: TraceAbstraction took 14345.50ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 102.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 624.1MB. Max. memory is 16.1GB. [2025-03-17 14:06:55,604 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 314.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:06:55,606 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.29ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.84ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 89.0MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.08ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.54ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 602.01ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 102.9MB in the end (delta: -18.9MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14345.50ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 102.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 624.1MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 2.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 314.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [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$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t876; [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L845] 0 pthread_t t877; [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876=-1, t877=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L847] 0 pthread_t t878; [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876=-1, t877=0, t878=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 3 __unbuffered_p2_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 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) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 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 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876=-1, t877=0, t878=1, weak$$choice0=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 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 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876=-1, t877=0, t878=1, weak$$choice0=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876=-1, t877=0, t878=1, weak$$choice0=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix033.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 844]: 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: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 locations, 74 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 811 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 802 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2462 IncrementalHoareTripleChecker+Invalid, 2490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 2 mSDtfsCounter, 2462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=8, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 1322 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 14:06:55,621 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/mix033.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 eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:06:57,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:06:57,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-17 14:06:57,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:06:57,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:06:57,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:06:57,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:06:57,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:06:57,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:06:57,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:06:57,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:06:57,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:06:57,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:06:57,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:06:57,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:06:57,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:06:57,895 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 -> eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e [2025-03-17 14:06:58,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:06:58,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:06:58,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:06:58,162 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:06:58,162 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:06:58,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033.opt.i [2025-03-17 14:06:59,379 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f92d3a3/d2a38d58712049e7b650aa09e56465e1/FLAGa04c0cbb8 [2025-03-17 14:06:59,625 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:06:59,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033.opt.i [2025-03-17 14:06:59,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f92d3a3/d2a38d58712049e7b650aa09e56465e1/FLAGa04c0cbb8 [2025-03-17 14:06:59,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f92d3a3/d2a38d58712049e7b650aa09e56465e1 [2025-03-17 14:06:59,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:06:59,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:06:59,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:06:59,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:06:59,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:06:59,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:06:59" (1/1) ... [2025-03-17 14:06:59,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5326dd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:06:59, skipping insertion in model container [2025-03-17 14:06:59,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:06:59" (1/1) ... [2025-03-17 14:06:59,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:07:00,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:07:00,291 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:07:00,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:07:00,388 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:07:00,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00 WrapperNode [2025-03-17 14:07:00,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:07:00,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:07:00,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:07:00,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:07:00,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,426 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2025-03-17 14:07:00,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:07:00,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:07:00,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:07:00,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:07:00,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,447 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:07:00,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:07:00,459 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:07:00,459 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:07:00,459 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:07:00,460 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (1/1) ... [2025-03-17 14:07:00,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:07:00,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:00,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:07:00,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:07:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 14:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-17 14:07:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-17 14:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-17 14:07:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-17 14:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-17 14:07:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-17 14:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:07:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:07:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:07:00,512 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:07:00,620 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:07:00,622 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:07:00,885 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:07:00,885 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:07:01,068 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:07:01,068 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:07:01,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:07:01 BoogieIcfgContainer [2025-03-17 14:07:01,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:07:01,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:07:01,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:07:01,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:07:01,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:06:59" (1/3) ... [2025-03-17 14:07:01,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639c1235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:07:01, skipping insertion in model container [2025-03-17 14:07:01,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:07:00" (2/3) ... [2025-03-17 14:07:01,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639c1235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:07:01, skipping insertion in model container [2025-03-17 14:07:01,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:07:01" (3/3) ... [2025-03-17 14:07:01,077 INFO L128 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2025-03-17 14:07:01,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:07:01,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix033.opt.i that has 4 procedures, 47 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-17 14:07:01,089 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:07:01,141 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:07:01,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2025-03-17 14:07:01,195 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2025-03-17 14:07:01,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:07:01,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-03-17 14:07:01,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2025-03-17 14:07:01,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2025-03-17 14:07:01,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:07:01,221 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;@6bbce0be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:07:01,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 14:07:01,230 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:07:01,230 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-17 14:07:01,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:07:01,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:07:01,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:07:01,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:07:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:07:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash -901908390, now seen corresponding path program 1 times [2025-03-17 14:07:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:07:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368925557] [2025-03-17 14:07:01,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:07:01,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:01,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:01,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:07:01,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:07:01,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:07:01,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:07:01,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:07:01,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:07:01,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:07:01,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:07:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:07:01,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:07:01,365 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:07:01,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368925557] [2025-03-17 14:07:01,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368925557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:07:01,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:07:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:07:01,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906855816] [2025-03-17 14:07:01,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:07:01,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:07:01,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:07:01,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:07:01,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:07:01,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:07:01,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:01,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:07:01,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:07:01,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:07:02,455 INFO L124 PetriNetUnfolderBase]: 9711/13863 cut-off events. [2025-03-17 14:07:02,456 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-17 14:07:02,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27638 conditions, 13863 events. 9711/13863 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 77598 event pairs, 947 based on Foata normal form. 768/14616 useless extension candidates. Maximal degree in co-relation 27627. Up to 12125 conditions per place. [2025-03-17 14:07:02,562 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 51 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2025-03-17 14:07:02,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 243 flow [2025-03-17 14:07:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:07:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:07:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-17 14:07:02,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-17 14:07:02,577 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 90 transitions. [2025-03-17 14:07:02,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 243 flow [2025-03-17 14:07:02,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 240 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:07:02,586 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2025-03-17 14:07:02,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-03-17 14:07:02,590 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-03-17 14:07:02,591 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2025-03-17 14:07:02,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:02,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:07:02,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:07:02,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:07:02,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:02,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:07:02,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:07:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash -705253948, now seen corresponding path program 1 times [2025-03-17 14:07:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:07:02,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211651707] [2025-03-17 14:07:02,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:07:02,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:02,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:02,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:07:02,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:07:02,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:07:02,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:07:02,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:07:02,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:07:02,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:07:02,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:07:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:07:02,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:07:02,900 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:07:02,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211651707] [2025-03-17 14:07:02,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211651707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:07:02,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:07:02,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:07:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138244344] [2025-03-17 14:07:02,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:07:02,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:07:02,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:07:02,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:07:02,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:07:02,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-03-17 14:07:02,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:02,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:07:02,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-03-17 14:07:02,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:07:03,677 INFO L124 PetriNetUnfolderBase]: 8719/13111 cut-off events. [2025-03-17 14:07:03,677 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-03-17 14:07:03,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25941 conditions, 13111 events. 8719/13111 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 79072 event pairs, 8719 based on Foata normal form. 384/13432 useless extension candidates. Maximal degree in co-relation 25931. Up to 12284 conditions per place. [2025-03-17 14:07:03,731 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 31 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-03-17 14:07:03,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 154 flow [2025-03-17 14:07:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:07:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:07:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-17 14:07:03,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2025-03-17 14:07:03,732 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 3 states and 61 transitions. [2025-03-17 14:07:03,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 154 flow [2025-03-17 14:07:03,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:07:03,734 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2025-03-17 14:07:03,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-03-17 14:07:03,735 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-03-17 14:07:03,735 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2025-03-17 14:07:03,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:03,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:07:03,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:07:03,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:07:03,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:03,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:07:03,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:07:03,941 INFO L85 PathProgramCache]: Analyzing trace with hash -705252860, now seen corresponding path program 1 times [2025-03-17 14:07:03,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:07:03,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219421227] [2025-03-17 14:07:03,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:07:03,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:03,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:03,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:07:03,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:07:03,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:07:04,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:07:04,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:07:04,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:07:04,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:07:04,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:07:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:07:04,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:07:04,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:07:04,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219421227] [2025-03-17 14:07:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219421227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:07:04,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:07:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:07:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138604881] [2025-03-17 14:07:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:07:04,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:07:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:07:04,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:07:04,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:07:04,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:07:04,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:04,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:07:04,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:07:04,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:07:04,462 INFO L124 PetriNetUnfolderBase]: 5887/9319 cut-off events. [2025-03-17 14:07:04,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:07:04,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18021 conditions, 9319 events. 5887/9319 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 57609 event pairs, 1119 based on Foata normal form. 384/9690 useless extension candidates. Maximal degree in co-relation 18015. Up to 4801 conditions per place. [2025-03-17 14:07:04,491 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 67 selfloop transitions, 5 changer transitions 1/79 dead transitions. [2025-03-17 14:07:04,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 316 flow [2025-03-17 14:07:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:07:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:07:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-03-17 14:07:04,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-03-17 14:07:04,493 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 4 states and 115 transitions. [2025-03-17 14:07:04,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 316 flow [2025-03-17 14:07:04,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:07:04,495 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 117 flow [2025-03-17 14:07:04,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2025-03-17 14:07:04,496 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2025-03-17 14:07:04,496 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 117 flow [2025-03-17 14:07:04,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:04,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:07:04,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:07:04,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:07:04,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:04,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:07:04,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:07:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2130983941, now seen corresponding path program 1 times [2025-03-17 14:07:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:07:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002949091] [2025-03-17 14:07:04,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:07:04,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:04,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:04,700 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:07:04,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:07:04,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:07:04,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:07:04,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:07:04,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:07:04,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:07:04,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:07:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:07:04,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:07:04,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:07:04,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002949091] [2025-03-17 14:07:04,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002949091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:07:04,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:07:04,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:07:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096680953] [2025-03-17 14:07:04,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:07:04,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:07:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:07:04,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:07:04,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:07:04,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:07:04,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:04,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:07:04,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:07:04,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:07:05,146 INFO L124 PetriNetUnfolderBase]: 3103/4879 cut-off events. [2025-03-17 14:07:05,146 INFO L125 PetriNetUnfolderBase]: For 980/980 co-relation queries the response was YES. [2025-03-17 14:07:05,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10960 conditions, 4879 events. 3103/4879 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 25591 event pairs, 731 based on Foata normal form. 240/5106 useless extension candidates. Maximal degree in co-relation 10951. Up to 1692 conditions per place. [2025-03-17 14:07:05,164 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 86 selfloop transitions, 8 changer transitions 1/101 dead transitions. [2025-03-17 14:07:05,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 448 flow [2025-03-17 14:07:05,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:07:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:07:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-03-17 14:07:05,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6125 [2025-03-17 14:07:05,167 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 117 flow. Second operand 5 states and 147 transitions. [2025-03-17 14:07:05,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 101 transitions, 448 flow [2025-03-17 14:07:05,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 438 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:07:05,171 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 157 flow [2025-03-17 14:07:05,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-03-17 14:07:05,171 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-03-17 14:07:05,171 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 157 flow [2025-03-17 14:07:05,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:05,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:07:05,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:07:05,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:07:05,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:05,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:07:05,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:07:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash 237866087, now seen corresponding path program 1 times [2025-03-17 14:07:05,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:07:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595250277] [2025-03-17 14:07:05,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:07:05,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:05,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:05,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:07:05,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:07:05,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:07:05,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:07:05,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:07:05,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:07:05,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:07:05,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:07:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:07:05,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:07:05,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:07:05,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595250277] [2025-03-17 14:07:05,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595250277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:07:05,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:07:05,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:07:05,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608083184] [2025-03-17 14:07:05,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:07:05,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:07:05,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:07:05,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:07:05,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:07:05,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:07:05,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:05,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:07:05,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:07:05,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:07:05,839 INFO L124 PetriNetUnfolderBase]: 1979/3011 cut-off events. [2025-03-17 14:07:05,839 INFO L125 PetriNetUnfolderBase]: For 1682/1682 co-relation queries the response was YES. [2025-03-17 14:07:05,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7324 conditions, 3011 events. 1979/3011 cut-off events. For 1682/1682 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 14031 event pairs, 667 based on Foata normal form. 72/3070 useless extension candidates. Maximal degree in co-relation 7313. Up to 1168 conditions per place. [2025-03-17 14:07:05,850 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 71 selfloop transitions, 11 changer transitions 1/89 dead transitions. [2025-03-17 14:07:05,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 423 flow [2025-03-17 14:07:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:07:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:07:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-17 14:07:05,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2025-03-17 14:07:05,852 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 157 flow. Second operand 6 states and 145 transitions. [2025-03-17 14:07:05,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 423 flow [2025-03-17 14:07:05,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 398 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-17 14:07:05,866 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 171 flow [2025-03-17 14:07:05,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2025-03-17 14:07:05,867 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2025-03-17 14:07:05,867 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 171 flow [2025-03-17 14:07:05,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:05,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:07:05,867 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] [2025-03-17 14:07:05,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:07:06,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:06,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:07:06,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:07:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash 827534491, now seen corresponding path program 1 times [2025-03-17 14:07:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:07:06,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503515273] [2025-03-17 14:07:06,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:07:06,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:06,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:06,071 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:07:06,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:07:06,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:07:06,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:07:06,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:07:06,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:07:06,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:07:06,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:07:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:07:06,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:07:06,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:07:06,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503515273] [2025-03-17 14:07:06,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503515273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:07:06,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:07:06,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:07:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552401379] [2025-03-17 14:07:06,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:07:06,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:07:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:07:06,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:07:06,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:07:06,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:07:06,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 171 flow. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:06,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:07:06,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:07:06,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:07:06,907 INFO L124 PetriNetUnfolderBase]: 2523/3844 cut-off events. [2025-03-17 14:07:06,908 INFO L125 PetriNetUnfolderBase]: For 2322/2322 co-relation queries the response was YES. [2025-03-17 14:07:06,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9518 conditions, 3844 events. 2523/3844 cut-off events. For 2322/2322 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 18950 event pairs, 311 based on Foata normal form. 8/3849 useless extension candidates. Maximal degree in co-relation 9506. Up to 1793 conditions per place. [2025-03-17 14:07:06,922 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 65 selfloop transitions, 7 changer transitions 45/123 dead transitions. [2025-03-17 14:07:06,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 123 transitions, 655 flow [2025-03-17 14:07:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:07:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:07:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 202 transitions. [2025-03-17 14:07:06,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675925925925926 [2025-03-17 14:07:06,924 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 171 flow. Second operand 9 states and 202 transitions. [2025-03-17 14:07:06,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 123 transitions, 655 flow [2025-03-17 14:07:06,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 538 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-17 14:07:06,939 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 159 flow [2025-03-17 14:07:06,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2025-03-17 14:07:06,941 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2025-03-17 14:07:06,942 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 159 flow [2025-03-17 14:07:06,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:06,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:07:06,942 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] [2025-03-17 14:07:06,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:07:07,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:07,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:07:07,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:07:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1008585647, now seen corresponding path program 2 times [2025-03-17 14:07:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:07:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426630352] [2025-03-17 14:07:07,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:07:07,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:07,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:07,151 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:07:07,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:07:07,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:07:07,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:07:07,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:07:07,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:07:07,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:07:07,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:07:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:07:07,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:07:07,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:07:07,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426630352] [2025-03-17 14:07:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426630352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:07:07,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:07:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:07:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733273061] [2025-03-17 14:07:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:07:07,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:07:07,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:07:07,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:07:07,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:07:07,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:07:07,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 159 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:07,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:07:07,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:07:07,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:07:07,707 INFO L124 PetriNetUnfolderBase]: 2829/4339 cut-off events. [2025-03-17 14:07:07,708 INFO L125 PetriNetUnfolderBase]: For 1090/1090 co-relation queries the response was YES. [2025-03-17 14:07:07,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10419 conditions, 4339 events. 2829/4339 cut-off events. For 1090/1090 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 22129 event pairs, 587 based on Foata normal form. 8/4337 useless extension candidates. Maximal degree in co-relation 10405. Up to 1625 conditions per place. [2025-03-17 14:07:07,723 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 71 selfloop transitions, 11 changer transitions 31/119 dead transitions. [2025-03-17 14:07:07,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 119 transitions, 577 flow [2025-03-17 14:07:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:07:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:07:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-03-17 14:07:07,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-03-17 14:07:07,724 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 159 flow. Second operand 8 states and 186 transitions. [2025-03-17 14:07:07,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 119 transitions, 577 flow [2025-03-17 14:07:07,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 119 transitions, 545 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-17 14:07:07,731 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 182 flow [2025-03-17 14:07:07,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2025-03-17 14:07:07,732 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2025-03-17 14:07:07,732 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 182 flow [2025-03-17 14:07:07,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:07,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:07:07,733 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] [2025-03-17 14:07:07,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:07:07,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:07,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:07:07,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:07:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash -660356857, now seen corresponding path program 3 times [2025-03-17 14:07:07,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:07:07,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594458908] [2025-03-17 14:07:07,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:07:07,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:07,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:07,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:07:07,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:07:07,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:07:08,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:07:08,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:07:08,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:07:08,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:07:08,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:07:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:07:08,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:07:08,234 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:07:08,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594458908] [2025-03-17 14:07:08,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594458908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:07:08,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:07:08,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:07:08,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600732526] [2025-03-17 14:07:08,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:07:08,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:07:08,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:07:08,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:07:08,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:07:08,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:07:08,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 182 flow. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:08,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:07:08,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:07:08,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:07:08,643 INFO L124 PetriNetUnfolderBase]: 1453/2301 cut-off events. [2025-03-17 14:07:08,644 INFO L125 PetriNetUnfolderBase]: For 676/677 co-relation queries the response was YES. [2025-03-17 14:07:08,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5609 conditions, 2301 events. 1453/2301 cut-off events. For 676/677 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10017 event pairs, 215 based on Foata normal form. 8/2304 useless extension candidates. Maximal degree in co-relation 5595. Up to 814 conditions per place. [2025-03-17 14:07:08,650 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 63 selfloop transitions, 4 changer transitions 44/117 dead transitions. [2025-03-17 14:07:08,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 634 flow [2025-03-17 14:07:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:07:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:07:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2025-03-17 14:07:08,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-03-17 14:07:08,651 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 182 flow. Second operand 10 states and 186 transitions. [2025-03-17 14:07:08,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 634 flow [2025-03-17 14:07:08,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 117 transitions, 612 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-17 14:07:08,654 INFO L231 Difference]: Finished difference. Result has 71 places, 46 transitions, 168 flow [2025-03-17 14:07:08,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=46} [2025-03-17 14:07:08,654 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2025-03-17 14:07:08,654 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 46 transitions, 168 flow [2025-03-17 14:07:08,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:08,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:07:08,654 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] [2025-03-17 14:07:08,662 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-17 14:07:08,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:08,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:07:08,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:07:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash -330946457, now seen corresponding path program 4 times [2025-03-17 14:07:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:07:08,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775299058] [2025-03-17 14:07:08,858 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:07:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:08,860 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:07:08,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:07:08,913 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-17 14:07:08,923 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 34 statements. [2025-03-17 14:07:08,924 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:07:08,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:07:08,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:07:08,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:07:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:07:08,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:07:08,991 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:07:08,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775299058] [2025-03-17 14:07:08,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775299058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:07:08,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:07:08,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:07:08,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215009551] [2025-03-17 14:07:08,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:07:08,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:07:08,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:07:08,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:07:08,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:07:08,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-03-17 14:07:08,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 46 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:08,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:07:08,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-03-17 14:07:08,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:07:09,274 INFO L124 PetriNetUnfolderBase]: 1491/2387 cut-off events. [2025-03-17 14:07:09,276 INFO L125 PetriNetUnfolderBase]: For 818/818 co-relation queries the response was YES. [2025-03-17 14:07:09,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5942 conditions, 2387 events. 1491/2387 cut-off events. For 818/818 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 10600 event pairs, 429 based on Foata normal form. 8/2394 useless extension candidates. Maximal degree in co-relation 5925. Up to 1778 conditions per place. [2025-03-17 14:07:09,284 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 40 selfloop transitions, 1 changer transitions 40/87 dead transitions. [2025-03-17 14:07:09,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 87 transitions, 452 flow [2025-03-17 14:07:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:07:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:07:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2025-03-17 14:07:09,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2025-03-17 14:07:09,285 INFO L175 Difference]: Start difference. First operand has 71 places, 46 transitions, 168 flow. Second operand 7 states and 141 transitions. [2025-03-17 14:07:09,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 87 transitions, 452 flow [2025-03-17 14:07:09,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 412 flow, removed 7 selfloop flow, removed 11 redundant places. [2025-03-17 14:07:09,289 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 156 flow [2025-03-17 14:07:09,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2025-03-17 14:07:09,290 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2025-03-17 14:07:09,290 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 156 flow [2025-03-17 14:07:09,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:07:09,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:07:09,290 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] [2025-03-17 14:07:09,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:07:09,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:09,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-03-17 14:07:09,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:07:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash -704005291, now seen corresponding path program 5 times [2025-03-17 14:07:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:07:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468434358] [2025-03-17 14:07:09,493 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:07:09,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:09,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:07:09,496 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:07:09,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:07:09,541 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:07:09,556 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:07:09,557 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:07:09,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:07:09,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:07:09,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:07:09,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:07:09,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:07:09,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:07:09,629 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 14:07:09,629 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:07:09,630 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-17 14:07:09,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-17 14:07:09,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-03-17 14:07:09,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-17 14:07:09,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-03-17 14:07:09,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-03-17 14:07:09,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-17 14:07:09,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:07:09,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:07:09,832 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-03-17 14:07:09,892 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:07:09,893 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:07:09,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:07:09 BasicIcfg [2025-03-17 14:07:09,901 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:07:09,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:07:09,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:07:09,901 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:07:09,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:07:01" (3/4) ... [2025-03-17 14:07:09,903 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:07:09,904 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:07:09,905 INFO L158 Benchmark]: Toolchain (without parser) took 9957.16ms. Allocated memory was 83.9MB in the beginning and 822.1MB in the end (delta: 738.2MB). Free memory was 58.1MB in the beginning and 330.1MB in the end (delta: -272.0MB). Peak memory consumption was 466.8MB. Max. memory is 16.1GB. [2025-03-17 14:07:09,905 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:07:09,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.09ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 34.9MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:07:09,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.88ms. Allocated memory is still 83.9MB. Free memory was 34.9MB in the beginning and 33.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:07:09,906 INFO L158 Benchmark]: Boogie Preprocessor took 31.23ms. Allocated memory is still 83.9MB. Free memory was 33.0MB in the beginning and 30.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:07:09,906 INFO L158 Benchmark]: IcfgBuilder took 609.32ms. Allocated memory is still 83.9MB. Free memory was 30.1MB in the beginning and 33.3MB in the end (delta: -3.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2025-03-17 14:07:09,906 INFO L158 Benchmark]: TraceAbstraction took 8830.77ms. Allocated memory was 83.9MB in the beginning and 822.1MB in the end (delta: 738.2MB). Free memory was 32.8MB in the beginning and 330.2MB in the end (delta: -297.4MB). Peak memory consumption was 443.9MB. Max. memory is 16.1GB. [2025-03-17 14:07:09,906 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 822.1MB. Free memory was 330.2MB in the beginning and 330.1MB in the end (delta: 79.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:07:09,907 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.30ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.09ms. Allocated memory is still 83.9MB. Free memory was 57.6MB in the beginning and 34.9MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.88ms. Allocated memory is still 83.9MB. Free memory was 34.9MB in the beginning and 33.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.23ms. Allocated memory is still 83.9MB. Free memory was 33.0MB in the beginning and 30.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 609.32ms. Allocated memory is still 83.9MB. Free memory was 30.1MB in the beginning and 33.3MB in the end (delta: -3.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8830.77ms. Allocated memory was 83.9MB in the beginning and 822.1MB in the end (delta: 738.2MB). Free memory was 32.8MB in the beginning and 330.2MB in the end (delta: -297.4MB). Peak memory consumption was 443.9MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 822.1MB. Free memory was 330.2MB in the beginning and 330.1MB in the end (delta: 79.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [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$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t876; [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L845] 0 pthread_t t877; [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876=-2, t877=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L847] 0 pthread_t t878; [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t876=-2, t877=-1, t878=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 3 __unbuffered_p2_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 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) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 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 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L828] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876=-2, t877=-1, t878=0, weak$$choice0=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 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 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876=-2, t877=-1, t878=0, weak$$choice0=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t876=-2, t877=-1, t878=0, weak$$choice0=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix033.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 locations, 74 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 568 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2130 IncrementalHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 0 mSDtfsCounter, 2130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 255 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 869 SizeOfPredicates, 30 NumberOfNonLiveVariables, 913 ConjunctsInSsa, 62 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-17 14:07:09,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample