./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:42:37,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:42:37,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:42:37,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:42:37,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:42:37,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:42:37,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:42:37,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:42:37,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:42:37,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:42:37,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:42:37,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:42:37,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:42:37,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:42:37,083 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:42:37,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:42:37,083 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:42:37,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:42:37,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:42:37,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:42:37,083 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:42:37,084 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:42:37,084 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:42:37,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:42:37,084 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:42:37,084 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:42:37,084 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:42:37,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:42:37,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:42:37,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:42:37,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:42:37,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:42:37,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:42:37,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:42:37,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:42:37,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:42:37,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:42:37,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:42:37,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:42:37,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:42:37,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:42:37,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:42:37,086 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce [2025-02-06 12:42:37,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:42:37,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:42:37,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:42:37,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:42:37,325 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:42:37,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2025-02-06 12:42:38,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45ad866a5/69c8705b5b5d474b9bd8d50f9605677c/FLAGc42f686a3 [2025-02-06 12:42:39,342 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:42:39,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2025-02-06 12:42:39,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45ad866a5/69c8705b5b5d474b9bd8d50f9605677c/FLAGc42f686a3 [2025-02-06 12:42:39,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45ad866a5/69c8705b5b5d474b9bd8d50f9605677c [2025-02-06 12:42:39,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:42:39,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:42:39,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:42:39,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:42:39,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:42:39,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbdc84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39, skipping insertion in model container [2025-02-06 12:42:39,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:42:39,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:42:39,722 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:42:39,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:42:39,795 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:42:39,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39 WrapperNode [2025-02-06 12:42:39,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:42:39,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:42:39,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:42:39,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:42:39,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,843 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 116 [2025-02-06 12:42:39,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:42:39,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:42:39,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:42:39,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:42:39,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,877 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:42:39,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,882 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:42:39,886 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:42:39,886 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:42:39,886 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:42:39,887 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (1/1) ... [2025-02-06 12:42:39,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:42:39,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:39,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:42:39,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:42:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:42:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:42:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:42:39,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:42:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:42:39,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:42:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:42:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:42:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:42:39,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:42:39,943 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:42:40,054 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:42:40,055 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:42:40,241 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:42:40,242 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:42:40,419 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:42:40,419 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:42:40,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:42:40 BoogieIcfgContainer [2025-02-06 12:42:40,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:42:40,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:42:40,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:42:40,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:42:40,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:42:39" (1/3) ... [2025-02-06 12:42:40,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa8dbdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:42:40, skipping insertion in model container [2025-02-06 12:42:40,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:39" (2/3) ... [2025-02-06 12:42:40,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa8dbdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:42:40, skipping insertion in model container [2025-02-06 12:42:40,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:42:40" (3/3) ... [2025-02-06 12:42:40,426 INFO L128 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2025-02-06 12:42:40,437 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:42:40,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix034_pso.opt_tso.opt.i that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:42:40,439 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:42:40,482 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:42:40,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2025-02-06 12:42:40,524 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2025-02-06 12:42:40,527 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:40,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-02-06 12:42:40,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2025-02-06 12:42:40,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2025-02-06 12:42:40,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:42:40,547 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;@6c960cde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:42:40,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:42:40,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:42:40,551 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 12:42:40,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:40,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:40,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:42:40,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:40,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:40,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1293473614, now seen corresponding path program 1 times [2025-02-06 12:42:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794503055] [2025-02-06 12:42:40,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:40,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:42:40,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:42:40,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:40,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:40,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:40,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794503055] [2025-02-06 12:42:40,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794503055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:40,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:40,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:42:40,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668437202] [2025-02-06 12:42:40,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:40,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:42:40,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:40,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:42:40,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:42:40,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 12:42:40,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:40,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:40,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 12:42:40,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:41,298 INFO L124 PetriNetUnfolderBase]: 783/1303 cut-off events. [2025-02-06 12:42:41,298 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:42:41,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2597 conditions, 1303 events. 783/1303 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6151 event pairs, 55 based on Foata normal form. 96/1396 useless extension candidates. Maximal degree in co-relation 2587. Up to 1149 conditions per place. [2025-02-06 12:42:41,307 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2025-02-06 12:42:41,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 174 flow [2025-02-06 12:42:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:42:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:42:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-02-06 12:42:41,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2025-02-06 12:42:41,318 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 68 transitions. [2025-02-06 12:42:41,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 174 flow [2025-02-06 12:42:41,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:42:41,323 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2025-02-06 12:42:41,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-02-06 12:42:41,328 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-02-06 12:42:41,328 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2025-02-06 12:42:41,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:41,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:41,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:41,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:42:41,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:41,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1305902014, now seen corresponding path program 1 times [2025-02-06 12:42:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:41,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975481634] [2025-02-06 12:42:41,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:41,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:42:41,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:42:41,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:41,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975481634] [2025-02-06 12:42:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975481634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:41,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:42:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018279730] [2025-02-06 12:42:41,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:41,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:42:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:41,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:42:41,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:42:41,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 12:42:41,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:41,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:41,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 12:42:41,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:41,535 INFO L124 PetriNetUnfolderBase]: 701/1251 cut-off events. [2025-02-06 12:42:41,536 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:42:41,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 1251 events. 701/1251 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6267 event pairs, 701 based on Foata normal form. 48/1290 useless extension candidates. Maximal degree in co-relation 2459. Up to 1146 conditions per place. [2025-02-06 12:42:41,542 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 22 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2025-02-06 12:42:41,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 114 flow [2025-02-06 12:42:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:42:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:42:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-02-06 12:42:41,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4144144144144144 [2025-02-06 12:42:41,544 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 46 transitions. [2025-02-06 12:42:41,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 114 flow [2025-02-06 12:42:41,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:42:41,545 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2025-02-06 12:42:41,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-02-06 12:42:41,545 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-02-06 12:42:41,546 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2025-02-06 12:42:41,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:41,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:41,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:41,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:42:41,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:41,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1305901431, now seen corresponding path program 1 times [2025-02-06 12:42:41,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:41,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425182200] [2025-02-06 12:42:41,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:41,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:42:41,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:42:41,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:41,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:41,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425182200] [2025-02-06 12:42:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425182200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:41,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:41,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:42:41,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640538506] [2025-02-06 12:42:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:41,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:42:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:41,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:42:41,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:42:41,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 12:42:41,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:41,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:41,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 12:42:41,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:42,212 INFO L124 PetriNetUnfolderBase]: 785/1365 cut-off events. [2025-02-06 12:42:42,213 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:42,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1365 events. 785/1365 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6580 event pairs, 200 based on Foata normal form. 0/1332 useless extension candidates. Maximal degree in co-relation 2679. Up to 633 conditions per place. [2025-02-06 12:42:42,219 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 30 selfloop transitions, 2 changer transitions 49/85 dead transitions. [2025-02-06 12:42:42,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 85 transitions, 338 flow [2025-02-06 12:42:42,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:42:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:42:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2025-02-06 12:42:42,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46959459459459457 [2025-02-06 12:42:42,222 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 8 states and 139 transitions. [2025-02-06 12:42:42,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 85 transitions, 338 flow [2025-02-06 12:42:42,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 85 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:42:42,225 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 75 flow [2025-02-06 12:42:42,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=75, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2025-02-06 12:42:42,226 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-02-06 12:42:42,226 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 75 flow [2025-02-06 12:42:42,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:42,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:42,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:42,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:42:42,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:42,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1903269376, now seen corresponding path program 1 times [2025-02-06 12:42:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303148805] [2025-02-06 12:42:42,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:42,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:42:42,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:42:42,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:42,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:42,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:42,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303148805] [2025-02-06 12:42:42,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303148805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:42,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:42,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:42:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97604646] [2025-02-06 12:42:42,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:42,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:42:42,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:42,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:42:42,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:42:42,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 12:42:42,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:42,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:42,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 12:42:42,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:42,670 INFO L124 PetriNetUnfolderBase]: 362/684 cut-off events. [2025-02-06 12:42:42,671 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-06 12:42:42,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 684 events. 362/684 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2942 event pairs, 103 based on Foata normal form. 48/729 useless extension candidates. Maximal degree in co-relation 1479. Up to 304 conditions per place. [2025-02-06 12:42:42,677 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 44 selfloop transitions, 4 changer transitions 1/53 dead transitions. [2025-02-06 12:42:42,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 233 flow [2025-02-06 12:42:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:42:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:42:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-06 12:42:42,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-02-06 12:42:42,679 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 75 flow. Second operand 4 states and 83 transitions. [2025-02-06 12:42:42,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 233 flow [2025-02-06 12:42:42,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 217 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-06 12:42:42,685 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 89 flow [2025-02-06 12:42:42,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2025-02-06 12:42:42,687 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2025-02-06 12:42:42,687 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 89 flow [2025-02-06 12:42:42,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:42,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:42,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:42,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:42:42,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:42,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash -687323788, now seen corresponding path program 1 times [2025-02-06 12:42:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:42,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760671339] [2025-02-06 12:42:42,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:42,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:42:42,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:42:42,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:42,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760671339] [2025-02-06 12:42:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760671339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:42,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:42,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:42:42,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958313952] [2025-02-06 12:42:42,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:42,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:42:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:42,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:42:42,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:42:42,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 12:42:42,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:42,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:42,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 12:42:42,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:42,966 INFO L124 PetriNetUnfolderBase]: 181/349 cut-off events. [2025-02-06 12:42:42,970 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-06 12:42:42,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 349 events. 181/349 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1174 event pairs, 69 based on Foata normal form. 24/370 useless extension candidates. Maximal degree in co-relation 829. Up to 146 conditions per place. [2025-02-06 12:42:42,973 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2025-02-06 12:42:42,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 213 flow [2025-02-06 12:42:42,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:42:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:42:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-02-06 12:42:42,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2025-02-06 12:42:42,979 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 89 flow. Second operand 5 states and 84 transitions. [2025-02-06 12:42:42,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 213 flow [2025-02-06 12:42:42,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 199 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 12:42:42,981 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 101 flow [2025-02-06 12:42:42,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2025-02-06 12:42:42,986 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2025-02-06 12:42:42,986 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 101 flow [2025-02-06 12:42:42,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:42,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:42,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:42,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:42:42,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:42,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash -451662758, now seen corresponding path program 1 times [2025-02-06 12:42:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:42,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035351009] [2025-02-06 12:42:42,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:43,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:42:43,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:42:43,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:43,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:43,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:43,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035351009] [2025-02-06 12:42:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035351009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:43,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:43,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:42:43,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232545999] [2025-02-06 12:42:43,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:43,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:42:43,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:43,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:42:43,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:42:43,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 12:42:43,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 101 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:43,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:43,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 12:42:43,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:43,635 INFO L124 PetriNetUnfolderBase]: 213/416 cut-off events. [2025-02-06 12:42:43,638 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2025-02-06 12:42:43,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 416 events. 213/416 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1501 event pairs, 42 based on Foata normal form. 4/419 useless extension candidates. Maximal degree in co-relation 1018. Up to 239 conditions per place. [2025-02-06 12:42:43,641 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 35 selfloop transitions, 7 changer transitions 19/65 dead transitions. [2025-02-06 12:42:43,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 339 flow [2025-02-06 12:42:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:42:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:42:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2025-02-06 12:42:43,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41312741312741313 [2025-02-06 12:42:43,647 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 101 flow. Second operand 7 states and 107 transitions. [2025-02-06 12:42:43,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 339 flow [2025-02-06 12:42:43,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 282 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-06 12:42:43,649 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 113 flow [2025-02-06 12:42:43,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2025-02-06 12:42:43,649 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-02-06 12:42:43,649 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 113 flow [2025-02-06 12:42:43,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:43,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:43,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:43,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:42:43,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:43,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:43,650 INFO L85 PathProgramCache]: Analyzing trace with hash -15069582, now seen corresponding path program 2 times [2025-02-06 12:42:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:43,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258208371] [2025-02-06 12:42:43,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:42:43,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:43,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:42:43,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:42:43,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:42:43,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:43,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258208371] [2025-02-06 12:42:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258208371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:43,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:43,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:42:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916510034] [2025-02-06 12:42:43,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:43,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:42:43,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:43,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:42:43,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:42:43,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 12:42:43,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:43,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:43,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 12:42:43,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:44,008 INFO L124 PetriNetUnfolderBase]: 249/496 cut-off events. [2025-02-06 12:42:44,009 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-02-06 12:42:44,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 496 events. 249/496 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1927 event pairs, 73 based on Foata normal form. 4/499 useless extension candidates. Maximal degree in co-relation 1166. Up to 240 conditions per place. [2025-02-06 12:42:44,011 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 28 selfloop transitions, 1 changer transitions 27/60 dead transitions. [2025-02-06 12:42:44,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 300 flow [2025-02-06 12:42:44,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:42:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:42:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-02-06 12:42:44,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4189189189189189 [2025-02-06 12:42:44,012 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 113 flow. Second operand 6 states and 93 transitions. [2025-02-06 12:42:44,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 300 flow [2025-02-06 12:42:44,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 294 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 12:42:44,014 INFO L231 Difference]: Finished difference. Result has 50 places, 29 transitions, 94 flow [2025-02-06 12:42:44,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=29} [2025-02-06 12:42:44,015 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2025-02-06 12:42:44,015 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 94 flow [2025-02-06 12:42:44,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:44,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:44,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:44,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:42:44,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:44,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1230612522, now seen corresponding path program 3 times [2025-02-06 12:42:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368860925] [2025-02-06 12:42:44,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:42:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:44,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:42:44,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:42:44,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:42:44,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:44,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:44,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368860925] [2025-02-06 12:42:44,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368860925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:44,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:44,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:42:44,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061599433] [2025-02-06 12:42:44,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:44,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:42:44,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:44,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:42:44,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:42:44,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 12:42:44,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 29 transitions, 94 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-02-06 12:42:44,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:44,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 12:42:44,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:45,068 INFO L124 PetriNetUnfolderBase]: 128/275 cut-off events. [2025-02-06 12:42:45,069 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-06 12:42:45,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 275 events. 128/275 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 863 event pairs, 62 based on Foata normal form. 4/278 useless extension candidates. Maximal degree in co-relation 640. Up to 132 conditions per place. [2025-02-06 12:42:45,071 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 24 selfloop transitions, 2 changer transitions 25/55 dead transitions. [2025-02-06 12:42:45,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 272 flow [2025-02-06 12:42:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:42:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:42:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2025-02-06 12:42:45,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-02-06 12:42:45,073 INFO L175 Difference]: Start difference. First operand has 50 places, 29 transitions, 94 flow. Second operand 8 states and 104 transitions. [2025-02-06 12:42:45,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 272 flow [2025-02-06 12:42:45,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 250 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-02-06 12:42:45,075 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 97 flow [2025-02-06 12:42:45,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=97, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2025-02-06 12:42:45,076 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-02-06 12:42:45,076 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 97 flow [2025-02-06 12:42:45,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-02-06 12:42:45,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:45,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:45,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:42:45,077 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:45,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1094534210, now seen corresponding path program 4 times [2025-02-06 12:42:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:45,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069186051] [2025-02-06 12:42:45,078 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:42:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:45,088 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-06 12:42:45,118 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:42:45,122 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:42:45,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:42:45,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:42:45,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:42:45,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:42:45,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:45,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:42:45,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:42:45,192 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:42:45,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-06 12:42:45,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:42:45,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:42:45,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 12:42:45,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 12:42:45,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:42:45,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:42:45,199 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2025-02-06 12:42:45,279 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:42:45,280 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:42:45,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:42:45 BasicIcfg [2025-02-06 12:42:45,290 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:42:45,291 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:42:45,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:42:45,291 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:42:45,292 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:42:40" (3/4) ... [2025-02-06 12:42:45,296 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:42:45,297 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:42:45,301 INFO L158 Benchmark]: Toolchain (without parser) took 5928.70ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 113.1MB in the beginning and 204.8MB in the end (delta: -91.6MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. [2025-02-06 12:42:45,301 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:45,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.38ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 89.8MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:42:45,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.96ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 88.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:45,302 INFO L158 Benchmark]: Boogie Preprocessor took 38.87ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:45,302 INFO L158 Benchmark]: IcfgBuilder took 533.68ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 107.7MB in the end (delta: -21.6MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2025-02-06 12:42:45,302 INFO L158 Benchmark]: TraceAbstraction took 4869.43ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 107.0MB in the beginning and 204.9MB in the end (delta: -97.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-02-06 12:42:45,302 INFO L158 Benchmark]: Witness Printer took 9.34ms. Allocated memory is still 343.9MB. Free memory was 204.9MB in the beginning and 204.8MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:45,303 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.25ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.38ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 89.8MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.96ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 88.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.87ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 533.68ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 107.7MB in the end (delta: -21.6MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4869.43ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 107.0MB in the beginning and 204.9MB in the end (delta: -97.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Witness Printer took 9.34ms. Allocated memory is still 343.9MB. Free memory was 204.9MB in the beginning and 204.8MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t903=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t903=-2, t904=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L782] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L788] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903=-2, t904=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903=-2, t904=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903=-2, t904=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "mix034_pso.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 0 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=6, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 552 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:42:45,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:42:47,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:42:47,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:42:47,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:42:47,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:42:47,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:42:47,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:42:47,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:42:47,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:42:47,823 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:42:47,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:42:47,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:42:47,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:42:47,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:42:47,824 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:42:47,825 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:42:47,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:42:47,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:42:47,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:42:47,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:42:47,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:42:47,827 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d984378a3d93078f60e6a73f83b588890817628b7e21c558fe1824f195f48ce [2025-02-06 12:42:48,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:42:48,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:42:48,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:42:48,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:42:48,121 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:42:48,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2025-02-06 12:42:49,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d35c3b7e5/e006a7ef1faa410e9d012b19ec07ef0b/FLAG607aa0ce5 [2025-02-06 12:42:49,694 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:42:49,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_pso.opt_tso.opt.i [2025-02-06 12:42:49,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d35c3b7e5/e006a7ef1faa410e9d012b19ec07ef0b/FLAG607aa0ce5 [2025-02-06 12:42:49,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d35c3b7e5/e006a7ef1faa410e9d012b19ec07ef0b [2025-02-06 12:42:49,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:42:49,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:42:49,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:42:49,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:42:49,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:42:49,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:42:49" (1/1) ... [2025-02-06 12:42:49,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6d3c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:49, skipping insertion in model container [2025-02-06 12:42:49,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:42:49" (1/1) ... [2025-02-06 12:42:49,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:42:49,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:42:49,958 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:42:49,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:42:50,042 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:42:50,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50 WrapperNode [2025-02-06 12:42:50,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:42:50,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:42:50,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:42:50,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:42:50,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,073 INFO L138 Inliner]: procedures = 175, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 117 [2025-02-06 12:42:50,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:42:50,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:42:50,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:42:50,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:42:50,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,097 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:42:50,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,104 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,107 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:42:50,109 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:42:50,109 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:42:50,109 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:42:50,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (1/1) ... [2025-02-06 12:42:50,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:42:50,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:50,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:42:50,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:42:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:42:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:42:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:42:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:42:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:42:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:42:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:42:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:42:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:42:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:42:50,193 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:42:50,322 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:42:50,323 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:42:50,640 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:42:50,640 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:42:50,875 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:42:50,876 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:42:50,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:42:50 BoogieIcfgContainer [2025-02-06 12:42:50,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:42:50,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:42:50,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:42:50,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:42:50,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:42:49" (1/3) ... [2025-02-06 12:42:50,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b12a47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:42:50, skipping insertion in model container [2025-02-06 12:42:50,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:50" (2/3) ... [2025-02-06 12:42:50,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b12a47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:42:50, skipping insertion in model container [2025-02-06 12:42:50,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:42:50" (3/3) ... [2025-02-06 12:42:50,885 INFO L128 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2025-02-06 12:42:50,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:42:50,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix034_pso.opt_tso.opt.i that has 3 procedures, 36 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:42:50,900 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:42:50,950 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:42:50,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow [2025-02-06 12:42:51,015 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2025-02-06 12:42:51,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:51,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-02-06 12:42:51,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow [2025-02-06 12:42:51,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow [2025-02-06 12:42:51,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:42:51,072 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;@4dcf8dba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:42:51,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:42:51,082 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:42:51,083 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 12:42:51,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:51,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:51,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:42:51,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:51,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1352640526, now seen corresponding path program 1 times [2025-02-06 12:42:51,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:51,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999526317] [2025-02-06 12:42:51,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:51,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:51,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:42:51,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:42:51,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:42:51,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:42:51,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:51,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:51,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:42:51,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:51,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:51,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:51,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999526317] [2025-02-06 12:42:51,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999526317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:51,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:42:51,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249944559] [2025-02-06 12:42:51,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:42:51,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:51,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:42:51,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:42:51,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 12:42:51,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:51,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:51,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 12:42:51,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:51,989 INFO L124 PetriNetUnfolderBase]: 783/1303 cut-off events. [2025-02-06 12:42:51,989 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:42:51,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2597 conditions, 1303 events. 783/1303 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6151 event pairs, 55 based on Foata normal form. 96/1396 useless extension candidates. Maximal degree in co-relation 2587. Up to 1149 conditions per place. [2025-02-06 12:42:51,997 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2025-02-06 12:42:51,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 174 flow [2025-02-06 12:42:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:42:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:42:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-02-06 12:42:52,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2025-02-06 12:42:52,007 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 68 transitions. [2025-02-06 12:42:52,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 174 flow [2025-02-06 12:42:52,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:42:52,011 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow [2025-02-06 12:42:52,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-02-06 12:42:52,015 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-02-06 12:42:52,015 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow [2025-02-06 12:42:52,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:52,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:52,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:52,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:42:52,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:52,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:52,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash 378380996, now seen corresponding path program 1 times [2025-02-06 12:42:52,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:52,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969692633] [2025-02-06 12:42:52,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:52,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:52,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:52,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:42:52,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:42:52,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:42:52,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:42:52,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:52,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:52,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:42:52,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:52,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:52,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:52,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969692633] [2025-02-06 12:42:52,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969692633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:52,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:52,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:42:52,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157747315] [2025-02-06 12:42:52,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:52,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:42:52,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:52,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:42:52,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:42:52,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-02-06 12:42:52,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:52,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:52,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-02-06 12:42:52,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:52,470 INFO L124 PetriNetUnfolderBase]: 701/1251 cut-off events. [2025-02-06 12:42:52,470 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:42:52,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 1251 events. 701/1251 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6284 event pairs, 701 based on Foata normal form. 48/1290 useless extension candidates. Maximal degree in co-relation 2459. Up to 1146 conditions per place. [2025-02-06 12:42:52,477 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 22 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2025-02-06 12:42:52,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 114 flow [2025-02-06 12:42:52,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:42:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:42:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-02-06 12:42:52,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4144144144144144 [2025-02-06 12:42:52,479 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 46 transitions. [2025-02-06 12:42:52,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 114 flow [2025-02-06 12:42:52,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:42:52,480 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2025-02-06 12:42:52,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-02-06 12:42:52,480 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-02-06 12:42:52,481 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2025-02-06 12:42:52,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:52,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:52,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:52,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:42:52,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:52,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:52,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:52,683 INFO L85 PathProgramCache]: Analyzing trace with hash 378381579, now seen corresponding path program 1 times [2025-02-06 12:42:52,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:52,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64702264] [2025-02-06 12:42:52,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:52,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:52,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:52,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:42:52,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:42:52,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:42:52,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:42:52,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:52,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:52,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:42:52,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:52,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:52,766 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:52,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64702264] [2025-02-06 12:42:52,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64702264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:52,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:52,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:42:52,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434985061] [2025-02-06 12:42:52,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:52,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:42:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:52,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:42:52,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:42:52,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 12:42:52,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:52,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:52,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 12:42:52,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:52,930 INFO L124 PetriNetUnfolderBase]: 389/765 cut-off events. [2025-02-06 12:42:52,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:52,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 765 events. 389/765 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3599 event pairs, 103 based on Foata normal form. 48/810 useless extension candidates. Maximal degree in co-relation 1467. Up to 349 conditions per place. [2025-02-06 12:42:52,936 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 44 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2025-02-06 12:42:52,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 214 flow [2025-02-06 12:42:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:42:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:42:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-06 12:42:52,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-02-06 12:42:52,939 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 4 states and 83 transitions. [2025-02-06 12:42:52,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 214 flow [2025-02-06 12:42:52,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:42:52,940 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 87 flow [2025-02-06 12:42:52,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-02-06 12:42:52,941 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2025-02-06 12:42:52,942 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 87 flow [2025-02-06 12:42:52,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:52,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:52,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:52,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:42:53,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:53,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:53,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:53,146 INFO L85 PathProgramCache]: Analyzing trace with hash 630438115, now seen corresponding path program 1 times [2025-02-06 12:42:53,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:53,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124782091] [2025-02-06 12:42:53,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:53,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:53,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:53,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:42:53,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:42:53,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:42:53,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:42:53,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:53,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:53,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:42:53,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:53,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:53,267 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:53,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124782091] [2025-02-06 12:42:53,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124782091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:53,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:53,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:42:53,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869659696] [2025-02-06 12:42:53,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:53,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:42:53,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:53,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:42:53,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:42:53,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 12:42:53,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:53,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:53,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 12:42:53,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:53,388 INFO L124 PetriNetUnfolderBase]: 181/353 cut-off events. [2025-02-06 12:42:53,388 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-06 12:42:53,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 353 events. 181/353 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1201 event pairs, 69 based on Foata normal form. 24/374 useless extension candidates. Maximal degree in co-relation 815. Up to 146 conditions per place. [2025-02-06 12:42:53,390 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 35 selfloop transitions, 6 changer transitions 1/47 dead transitions. [2025-02-06 12:42:53,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 210 flow [2025-02-06 12:42:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:42:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:42:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-02-06 12:42:53,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2025-02-06 12:42:53,391 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 87 flow. Second operand 5 states and 84 transitions. [2025-02-06 12:42:53,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 210 flow [2025-02-06 12:42:53,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 201 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:42:53,393 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 103 flow [2025-02-06 12:42:53,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-02-06 12:42:53,393 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2025-02-06 12:42:53,393 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 103 flow [2025-02-06 12:42:53,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:53,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:53,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:53,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:42:53,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:53,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:53,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash -735925924, now seen corresponding path program 1 times [2025-02-06 12:42:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976205589] [2025-02-06 12:42:53,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:53,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:53,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:53,604 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:42:53,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:42:53,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:42:53,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:42:53,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:53,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:53,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:42:53,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:53,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:53,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:53,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976205589] [2025-02-06 12:42:53,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976205589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:53,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:53,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:42:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209265634] [2025-02-06 12:42:53,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:53,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:42:53,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:53,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:42:53,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:42:53,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 12:42:53,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 103 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:53,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:53,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 12:42:53,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:54,122 INFO L124 PetriNetUnfolderBase]: 213/424 cut-off events. [2025-02-06 12:42:54,122 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-02-06 12:42:54,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 424 events. 213/424 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1565 event pairs, 37 based on Foata normal form. 4/427 useless extension candidates. Maximal degree in co-relation 1026. Up to 169 conditions per place. [2025-02-06 12:42:54,124 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 39 selfloop transitions, 5 changer transitions 26/75 dead transitions. [2025-02-06 12:42:54,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 377 flow [2025-02-06 12:42:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:42:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:42:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2025-02-06 12:42:54,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4294294294294294 [2025-02-06 12:42:54,126 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 103 flow. Second operand 9 states and 143 transitions. [2025-02-06 12:42:54,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 377 flow [2025-02-06 12:42:54,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 320 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-06 12:42:54,129 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 109 flow [2025-02-06 12:42:54,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=109, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2025-02-06 12:42:54,129 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-02-06 12:42:54,129 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 109 flow [2025-02-06 12:42:54,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:54,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:54,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:54,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:42:54,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:54,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:54,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:54,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1542732458, now seen corresponding path program 2 times [2025-02-06 12:42:54,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:54,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555604909] [2025-02-06 12:42:54,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:42:54,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:54,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:42:54,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:42:54,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:42:54,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:42:54,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:42:54,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:54,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 12:42:54,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:54,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:54,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555604909] [2025-02-06 12:42:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555604909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:54,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:54,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:42:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37661282] [2025-02-06 12:42:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:54,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:42:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:54,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:42:54,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:42:54,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 12:42:54,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 109 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:54,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:54,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 12:42:54,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:54,970 INFO L124 PetriNetUnfolderBase]: 187/383 cut-off events. [2025-02-06 12:42:54,970 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-02-06 12:42:54,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 383 events. 187/383 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1327 event pairs, 27 based on Foata normal form. 4/384 useless extension candidates. Maximal degree in co-relation 925. Up to 106 conditions per place. [2025-02-06 12:42:54,972 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 32 selfloop transitions, 4 changer transitions 25/66 dead transitions. [2025-02-06 12:42:54,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 338 flow [2025-02-06 12:42:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:42:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:42:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2025-02-06 12:42:54,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3675675675675676 [2025-02-06 12:42:54,974 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 109 flow. Second operand 10 states and 136 transitions. [2025-02-06 12:42:54,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 338 flow [2025-02-06 12:42:54,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 308 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-06 12:42:54,976 INFO L231 Difference]: Finished difference. Result has 54 places, 30 transitions, 104 flow [2025-02-06 12:42:54,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=104, PETRI_PLACES=54, PETRI_TRANSITIONS=30} [2025-02-06 12:42:54,977 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2025-02-06 12:42:54,977 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 30 transitions, 104 flow [2025-02-06 12:42:54,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:54,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:54,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:54,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:42:55,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:55,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:55,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash -73858350, now seen corresponding path program 3 times [2025-02-06 12:42:55,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:55,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260396375] [2025-02-06 12:42:55,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:42:55,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:55,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:55,186 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:42:55,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:42:55,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:42:55,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:42:55,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:42:55,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:55,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:42:55,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:55,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:55,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:55,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260396375] [2025-02-06 12:42:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260396375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:55,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:55,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:42:55,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824675452] [2025-02-06 12:42:55,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:55,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:42:55,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:55,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:42:55,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:42:55,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-06 12:42:55,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 30 transitions, 104 flow. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:55,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:55,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-06 12:42:55,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:55,778 INFO L124 PetriNetUnfolderBase]: 165/348 cut-off events. [2025-02-06 12:42:55,781 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-02-06 12:42:55,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 348 events. 165/348 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1228 event pairs, 35 based on Foata normal form. 4/351 useless extension candidates. Maximal degree in co-relation 860. Up to 150 conditions per place. [2025-02-06 12:42:55,783 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 25 selfloop transitions, 4 changer transitions 28/62 dead transitions. [2025-02-06 12:42:55,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 313 flow [2025-02-06 12:42:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:42:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:42:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2025-02-06 12:42:55,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39039039039039036 [2025-02-06 12:42:55,789 INFO L175 Difference]: Start difference. First operand has 54 places, 30 transitions, 104 flow. Second operand 9 states and 130 transitions. [2025-02-06 12:42:55,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 313 flow [2025-02-06 12:42:55,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 275 flow, removed 7 selfloop flow, removed 10 redundant places. [2025-02-06 12:42:55,794 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 104 flow [2025-02-06 12:42:55,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=104, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2025-02-06 12:42:55,795 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-02-06 12:42:55,795 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 104 flow [2025-02-06 12:42:55,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:55,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:55,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:55,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:42:55,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:55,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:42:55,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash -425106486, now seen corresponding path program 4 times [2025-02-06 12:42:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [960425172] [2025-02-06 12:42:55,999 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:42:55,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:55,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:56,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:42:56,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:42:56,053 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-06 12:42:56,067 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:42:56,068 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 12:42:56,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:42:56,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:42:56,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:42:56,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:42:56,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:56,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:42:56,138 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:42:56,138 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:42:56,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-06 12:42:56,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:42:56,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:42:56,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 12:42:56,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 12:42:56,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:42:56,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 12:42:56,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:56,341 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-02-06 12:42:56,375 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:42:56,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:42:56,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:42:56 BasicIcfg [2025-02-06 12:42:56,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:42:56,379 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:42:56,379 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:42:56,379 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:42:56,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:42:50" (3/4) ... [2025-02-06 12:42:56,384 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:42:56,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:42:56,385 INFO L158 Benchmark]: Toolchain (without parser) took 6661.96ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 90.2MB in the beginning and 127.7MB in the end (delta: -37.5MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2025-02-06 12:42:56,385 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:56,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.96ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 67.8MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:42:56,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.94ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:56,385 INFO L158 Benchmark]: Boogie Preprocessor took 34.30ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 62.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:56,385 INFO L158 Benchmark]: IcfgBuilder took 767.20ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 54.8MB in the end (delta: 7.6MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2025-02-06 12:42:56,386 INFO L158 Benchmark]: TraceAbstraction took 5500.21ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 54.0MB in the beginning and 127.7MB in the end (delta: -73.8MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2025-02-06 12:42:56,386 INFO L158 Benchmark]: Witness Printer took 5.53ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 127.7MB in the end (delta: 10.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:56,387 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.41ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.96ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 67.8MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.94ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.30ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 62.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 767.20ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 54.8MB in the end (delta: 7.6MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5500.21ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 54.0MB in the beginning and 127.7MB in the end (delta: -73.8MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. * Witness Printer took 5.53ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 127.7MB in the end (delta: 10.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t903=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t903=0, t904=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L782] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L788] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903=0, t904=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903=0, t904=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903=0, t904=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "mix034_pso.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1125 IncrementalHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 5 mSDtfsCounter, 1125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=5, InterpolantAutomatonStates: 43, 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, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 513 SizeOfPredicates, 23 NumberOfNonLiveVariables, 606 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:42:56,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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