./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix032.oepc.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/mix032.oepc.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 f271a38be9caac1825a663eb11850ec78cc50bf41fe675769961ef9ec85f6a9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:42:15,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:42:16,039 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:16,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:42:16,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:42:16,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:42:16,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:42:16,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:42:16,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:42:16,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:42:16,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:42:16,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:42:16,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:42:16,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:42:16,059 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:42:16,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:42:16,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:42:16,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:42:16,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:42:16,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:42:16,059 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:42:16,059 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:42:16,059 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:42:16,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:42:16,060 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:42:16,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:42:16,060 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:42:16,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:42:16,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:42:16,060 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:42:16,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:42:16,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:42:16,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:42:16,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:42:16,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:42:16,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:42:16,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:42:16,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:42:16,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:42:16,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:42:16,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:42:16,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:42:16,062 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 -> f271a38be9caac1825a663eb11850ec78cc50bf41fe675769961ef9ec85f6a9e [2025-02-06 12:42:16,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:42:16,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:42:16,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:42:16,317 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:42:16,317 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:42:16,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix032.oepc.i [2025-02-06 12:42:17,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25a98cb5a/e80bd4ea14f54199836a6c9781692604/FLAG3d7a7e02b [2025-02-06 12:42:17,909 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:42:17,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix032.oepc.i [2025-02-06 12:42:17,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25a98cb5a/e80bd4ea14f54199836a6c9781692604/FLAG3d7a7e02b [2025-02-06 12:42:18,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25a98cb5a/e80bd4ea14f54199836a6c9781692604 [2025-02-06 12:42:18,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:42:18,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:42:18,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:42:18,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:42:18,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:42:18,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:42:18" (1/1) ... [2025-02-06 12:42:18,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a49cb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:18, skipping insertion in model container [2025-02-06 12:42:18,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:42:18" (1/1) ... [2025-02-06 12:42:18,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:42:18,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:42:18,466 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:42:18,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:42:18,572 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:42:18,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:18 WrapperNode [2025-02-06 12:42:18,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:42:18,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:42:18,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:42:18,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:42:18,580 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:18" (1/1) ... [2025-02-06 12:42:18,594 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:18" (1/1) ... [2025-02-06 12:42:18,610 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 124 [2025-02-06 12:42:18,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:42:18,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:42:18,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:42:18,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:42:18,620 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:18" (1/1) ... [2025-02-06 12:42:18,620 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:18" (1/1) ... [2025-02-06 12:42:18,623 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:18" (1/1) ... [2025-02-06 12:42:18,647 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:18,648 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:18" (1/1) ... [2025-02-06 12:42:18,648 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:18" (1/1) ... [2025-02-06 12:42:18,655 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:18" (1/1) ... [2025-02-06 12:42:18,659 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:18" (1/1) ... [2025-02-06 12:42:18,660 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:18" (1/1) ... [2025-02-06 12:42:18,661 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:18" (1/1) ... [2025-02-06 12:42:18,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:42:18,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:42:18,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:42:18,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:42:18,668 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:18" (1/1) ... [2025-02-06 12:42:18,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:42:18,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:18,704 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:18,708 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:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:42:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:42:18,727 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:42:18,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:42:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:42:18,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:42:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:42:18,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:42:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:42:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:42:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:42:18,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:42:18,730 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:18,850 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:42:18,852 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:42:19,105 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:42:19,106 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:42:19,294 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:42:19,294 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:42:19,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:42:19 BoogieIcfgContainer [2025-02-06 12:42:19,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:42:19,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:42:19,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:42:19,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:42:19,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:42:18" (1/3) ... [2025-02-06 12:42:19,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d688ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:42:19, skipping insertion in model container [2025-02-06 12:42:19,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:18" (2/3) ... [2025-02-06 12:42:19,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d688ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:42:19, skipping insertion in model container [2025-02-06 12:42:19,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:42:19" (3/3) ... [2025-02-06 12:42:19,304 INFO L128 eAbstractionObserver]: Analyzing ICFG mix032.oepc.i [2025-02-06 12:42:19,315 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:42:19,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix032.oepc.i that has 4 procedures, 47 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:42:19,317 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:42:19,397 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:42:19,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2025-02-06 12:42:19,451 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2025-02-06 12:42:19,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:19,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-02-06 12:42:19,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2025-02-06 12:42:19,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2025-02-06 12:42:19,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:42:19,483 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;@621113a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:42:19,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:42:19,489 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:42:19,491 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-06 12:42:19,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:19,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:19,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:42:19,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:19,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:19,497 INFO L85 PathProgramCache]: Analyzing trace with hash 12451793, now seen corresponding path program 1 times [2025-02-06 12:42:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:19,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775341472] [2025-02-06 12:42:19,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:19,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:42:19,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:42:19,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:19,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:19,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:19,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:19,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775341472] [2025-02-06 12:42:19,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775341472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:19,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:19,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:42:19,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791632007] [2025-02-06 12:42:19,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:19,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:42:19,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:19,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:42:19,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:42:19,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:19,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 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:19,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:19,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:19,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:21,272 INFO L124 PetriNetUnfolderBase]: 9711/13872 cut-off events. [2025-02-06 12:42:21,273 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-06 12:42:21,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27647 conditions, 13872 events. 9711/13872 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 81784 event pairs, 1071 based on Foata normal form. 760/14623 useless extension candidates. Maximal degree in co-relation 27636. Up to 11931 conditions per place. [2025-02-06 12:42:21,342 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 57 selfloop transitions, 2 changer transitions 2/68 dead transitions. [2025-02-06 12:42:21,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 273 flow [2025-02-06 12:42:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:42:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:42:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-02-06 12:42:21,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 12:42:21,352 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 96 transitions. [2025-02-06 12:42:21,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 273 flow [2025-02-06 12:42:21,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:42:21,358 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2025-02-06 12:42:21,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-02-06 12:42:21,366 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-02-06 12:42:21,366 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2025-02-06 12:42:21,366 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:21,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:21,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:21,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:42:21,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:21,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:21,368 INFO L85 PathProgramCache]: Analyzing trace with hash -634513324, now seen corresponding path program 1 times [2025-02-06 12:42:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:21,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189685089] [2025-02-06 12:42:21,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:21,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:42:21,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:42:21,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:21,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:21,479 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:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189685089] [2025-02-06 12:42:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189685089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:21,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:21,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:42:21,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911809184] [2025-02-06 12:42:21,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:21,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:42:21,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:21,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:42:21,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:42:21,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-02-06 12:42:21,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:21,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:21,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-02-06 12:42:21,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:22,765 INFO L124 PetriNetUnfolderBase]: 8719/13255 cut-off events. [2025-02-06 12:42:22,765 INFO L125 PetriNetUnfolderBase]: For 594/594 co-relation queries the response was YES. [2025-02-06 12:42:22,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26247 conditions, 13255 events. 8719/13255 cut-off events. For 594/594 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 81326 event pairs, 8719 based on Foata normal form. 384/13584 useless extension candidates. Maximal degree in co-relation 26237. Up to 12284 conditions per place. [2025-02-06 12:42:22,837 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 31 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-02-06 12:42:22,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 154 flow [2025-02-06 12:42:22,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:42:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:42:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-02-06 12:42:22,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2025-02-06 12:42:22,839 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 3 states and 61 transitions. [2025-02-06 12:42:22,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 154 flow [2025-02-06 12:42:22,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:42:22,841 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2025-02-06 12:42:22,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-02-06 12:42:22,841 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-02-06 12:42:22,845 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2025-02-06 12:42:22,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:22,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:22,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:22,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:42:22,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:22,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash -634512917, now seen corresponding path program 1 times [2025-02-06 12:42:22,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:22,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156482429] [2025-02-06 12:42:22,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:22,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:22,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:42:22,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:42:22,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:22,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:23,101 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:23,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:23,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156482429] [2025-02-06 12:42:23,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156482429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:23,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:23,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:42:23,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520253215] [2025-02-06 12:42:23,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:23,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:42:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:23,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:42:23,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:42:23,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-02-06 12:42:23,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:23,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:23,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-02-06 12:42:23,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:24,251 INFO L124 PetriNetUnfolderBase]: 9895/14527 cut-off events. [2025-02-06 12:42:24,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:24,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28677 conditions, 14527 events. 9895/14527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 84100 event pairs, 2317 based on Foata normal form. 0/14280 useless extension candidates. Maximal degree in co-relation 28671. Up to 6737 conditions per place. [2025-02-06 12:42:24,289 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 46 selfloop transitions, 2 changer transitions 84/137 dead transitions. [2025-02-06 12:42:24,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 137 transitions, 546 flow [2025-02-06 12:42:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:42:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:42:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2025-02-06 12:42:24,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-02-06 12:42:24,291 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 8 states and 206 transitions. [2025-02-06 12:42:24,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 137 transitions, 546 flow [2025-02-06 12:42:24,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 137 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:42:24,294 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 97 flow [2025-02-06 12:42:24,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=97, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2025-02-06 12:42:24,295 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2025-02-06 12:42:24,295 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 97 flow [2025-02-06 12:42:24,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:24,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:24,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:24,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:42:24,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:24,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:24,296 INFO L85 PathProgramCache]: Analyzing trace with hash -325823871, now seen corresponding path program 1 times [2025-02-06 12:42:24,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:24,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733687804] [2025-02-06 12:42:24,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:24,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:24,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 12:42:24,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 12:42:24,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:24,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:24,521 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:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:24,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733687804] [2025-02-06 12:42:24,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733687804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:24,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:24,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:42:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838121091] [2025-02-06 12:42:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:42:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:24,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:42:24,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:42:24,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-02-06 12:42:24,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:24,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:24,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-02-06 12:42:24,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:26,110 INFO L124 PetriNetUnfolderBase]: 6900/10170 cut-off events. [2025-02-06 12:42:26,110 INFO L125 PetriNetUnfolderBase]: For 1788/1788 co-relation queries the response was YES. [2025-02-06 12:42:26,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21949 conditions, 10170 events. 6900/10170 cut-off events. For 1788/1788 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 56481 event pairs, 1991 based on Foata normal form. 240/10403 useless extension candidates. Maximal degree in co-relation 21937. Up to 5926 conditions per place. [2025-02-06 12:42:26,167 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 48 selfloop transitions, 2 changer transitions 53/108 dead transitions. [2025-02-06 12:42:26,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 108 transitions, 460 flow [2025-02-06 12:42:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:42:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:42:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-02-06 12:42:26,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-06 12:42:26,171 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 97 flow. Second operand 7 states and 168 transitions. [2025-02-06 12:42:26,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 108 transitions, 460 flow [2025-02-06 12:42:26,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 438 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 12:42:26,257 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 101 flow [2025-02-06 12:42:26,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2025-02-06 12:42:26,259 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2025-02-06 12:42:26,259 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 101 flow [2025-02-06 12:42:26,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:26,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:26,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:26,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:42:26,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:26,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash -773096679, now seen corresponding path program 1 times [2025-02-06 12:42:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:26,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663995735] [2025-02-06 12:42:26,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:26,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:42:26,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:42:26,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:26,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:26,404 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:26,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663995735] [2025-02-06 12:42:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663995735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:26,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:26,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:42:26,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917443414] [2025-02-06 12:42:26,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:26,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:42:26,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:26,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:42:26,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:42:26,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:26,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:26,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:26,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:26,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:27,196 INFO L124 PetriNetUnfolderBase]: 4978/7540 cut-off events. [2025-02-06 12:42:27,196 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-02-06 12:42:27,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16318 conditions, 7540 events. 4978/7540 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 41441 event pairs, 1119 based on Foata normal form. 384/7919 useless extension candidates. Maximal degree in co-relation 16305. Up to 3514 conditions per place. [2025-02-06 12:42:27,219 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 67 selfloop transitions, 5 changer transitions 1/78 dead transitions. [2025-02-06 12:42:27,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 341 flow [2025-02-06 12:42:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:42:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:42:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-02-06 12:42:27,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-02-06 12:42:27,220 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 101 flow. Second operand 4 states and 115 transitions. [2025-02-06 12:42:27,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 341 flow [2025-02-06 12:42:27,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 325 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-06 12:42:27,230 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 123 flow [2025-02-06 12:42:27,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-02-06 12:42:27,231 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2025-02-06 12:42:27,231 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 123 flow [2025-02-06 12:42:27,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:27,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:27,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:27,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:42:27,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:27,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1680225979, now seen corresponding path program 1 times [2025-02-06 12:42:27,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:27,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109062485] [2025-02-06 12:42:27,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:27,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:42:27,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:42:27,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:27,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:27,417 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:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109062485] [2025-02-06 12:42:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109062485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:27,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:27,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:42:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275220898] [2025-02-06 12:42:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:27,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:42:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:27,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:42:27,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:42:27,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-02-06 12:42:27,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:27,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:27,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-02-06 12:42:27,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:28,325 INFO L124 PetriNetUnfolderBase]: 6566/9872 cut-off events. [2025-02-06 12:42:28,325 INFO L125 PetriNetUnfolderBase]: For 2671/2671 co-relation queries the response was YES. [2025-02-06 12:42:28,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23514 conditions, 9872 events. 6566/9872 cut-off events. For 2671/2671 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 55427 event pairs, 763 based on Foata normal form. 96/9961 useless extension candidates. Maximal degree in co-relation 23503. Up to 5291 conditions per place. [2025-02-06 12:42:28,352 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 65 selfloop transitions, 2 changer transitions 35/107 dead transitions. [2025-02-06 12:42:28,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 107 transitions, 523 flow [2025-02-06 12:42:28,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:42:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:42:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-02-06 12:42:28,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2025-02-06 12:42:28,353 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 123 flow. Second operand 6 states and 149 transitions. [2025-02-06 12:42:28,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 107 transitions, 523 flow [2025-02-06 12:42:28,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 107 transitions, 502 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-06 12:42:28,356 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 132 flow [2025-02-06 12:42:28,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2025-02-06 12:42:28,357 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-02-06 12:42:28,357 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 132 flow [2025-02-06 12:42:28,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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:28,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:28,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:28,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:42:28,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:28,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:28,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1437063427, now seen corresponding path program 2 times [2025-02-06 12:42:28,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:28,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947649164] [2025-02-06 12:42:28,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:42:28,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:28,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-02-06 12:42:28,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 12:42:28,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:42:28,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:28,500 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:28,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:28,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947649164] [2025-02-06 12:42:28,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947649164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:28,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:28,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:42:28,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069045134] [2025-02-06 12:42:28,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:28,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:42:28,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:28,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:42:28,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:42:28,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:28,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:28,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:28,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:28,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:28,938 INFO L124 PetriNetUnfolderBase]: 4217/6501 cut-off events. [2025-02-06 12:42:28,938 INFO L125 PetriNetUnfolderBase]: For 1752/1752 co-relation queries the response was YES. [2025-02-06 12:42:28,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15207 conditions, 6501 events. 4217/6501 cut-off events. For 1752/1752 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 34956 event pairs, 937 based on Foata normal form. 368/6864 useless extension candidates. Maximal degree in co-relation 15193. Up to 2358 conditions per place. [2025-02-06 12:42:28,957 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 85 selfloop transitions, 8 changer transitions 4/102 dead transitions. [2025-02-06 12:42:28,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 102 transitions, 496 flow [2025-02-06 12:42:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:42:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:42:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-02-06 12:42:28,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6125 [2025-02-06 12:42:28,958 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 132 flow. Second operand 5 states and 147 transitions. [2025-02-06 12:42:28,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 102 transitions, 496 flow [2025-02-06 12:42:28,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 102 transitions, 488 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 12:42:28,966 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 175 flow [2025-02-06 12:42:28,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2025-02-06 12:42:28,967 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2025-02-06 12:42:28,967 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 175 flow [2025-02-06 12:42:28,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:28,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:28,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:28,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:42:28,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:28,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1026740549, now seen corresponding path program 1 times [2025-02-06 12:42:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:28,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250242168] [2025-02-06 12:42:28,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:28,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 12:42:29,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 12:42:29,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:29,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:29,278 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:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250242168] [2025-02-06 12:42:29,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250242168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:29,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:29,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:42:29,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260848064] [2025-02-06 12:42:29,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:29,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:42:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:29,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:42:29,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:42:29,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:29,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:29,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:29,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:29,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:29,714 INFO L124 PetriNetUnfolderBase]: 2759/4195 cut-off events. [2025-02-06 12:42:29,715 INFO L125 PetriNetUnfolderBase]: For 2962/2962 co-relation queries the response was YES. [2025-02-06 12:42:29,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10984 conditions, 4195 events. 2759/4195 cut-off events. For 2962/2962 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 20818 event pairs, 813 based on Foata normal form. 124/4314 useless extension candidates. Maximal degree in co-relation 10969. Up to 1612 conditions per place. [2025-02-06 12:42:29,727 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 67 selfloop transitions, 11 changer transitions 7/90 dead transitions. [2025-02-06 12:42:29,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 465 flow [2025-02-06 12:42:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:42:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:42:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-06 12:42:29,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2025-02-06 12:42:29,728 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 175 flow. Second operand 6 states and 145 transitions. [2025-02-06 12:42:29,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 465 flow [2025-02-06 12:42:29,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 90 transitions, 428 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 12:42:29,746 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 175 flow [2025-02-06 12:42:29,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=175, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2025-02-06 12:42:29,747 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2025-02-06 12:42:29,747 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 175 flow [2025-02-06 12:42:29,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:29,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:29,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:29,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:42:29,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:29,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash -73840845, now seen corresponding path program 1 times [2025-02-06 12:42:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:29,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354199689] [2025-02-06 12:42:29,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:29,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:42:29,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:42:29,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:29,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:30,036 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:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354199689] [2025-02-06 12:42:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354199689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:30,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:30,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:42:30,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357089370] [2025-02-06 12:42:30,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:30,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:42:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:30,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:42:30,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:42:30,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-02-06 12:42:30,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:30,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:30,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-02-06 12:42:30,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:30,512 INFO L124 PetriNetUnfolderBase]: 2745/4237 cut-off events. [2025-02-06 12:42:30,514 INFO L125 PetriNetUnfolderBase]: For 3020/3020 co-relation queries the response was YES. [2025-02-06 12:42:30,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10793 conditions, 4237 events. 2745/4237 cut-off events. For 3020/3020 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 21735 event pairs, 509 based on Foata normal form. 8/4243 useless extension candidates. Maximal degree in co-relation 10779. Up to 2304 conditions per place. [2025-02-06 12:42:30,524 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 43 selfloop transitions, 1 changer transitions 47/96 dead transitions. [2025-02-06 12:42:30,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 571 flow [2025-02-06 12:42:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:42:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:42:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-02-06 12:42:30,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-02-06 12:42:30,526 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 175 flow. Second operand 6 states and 132 transitions. [2025-02-06 12:42:30,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 571 flow [2025-02-06 12:42:30,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 96 transitions, 442 flow, removed 22 selfloop flow, removed 9 redundant places. [2025-02-06 12:42:30,537 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 128 flow [2025-02-06 12:42:30,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2025-02-06 12:42:30,538 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2025-02-06 12:42:30,538 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 128 flow [2025-02-06 12:42:30,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:30,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:30,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:30,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:42:30,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:30,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1872922593, now seen corresponding path program 2 times [2025-02-06 12:42:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:30,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007693550] [2025-02-06 12:42:30,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:42:30,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:30,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:42:30,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:42:30,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:42:30,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:31,321 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:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:42:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007693550] [2025-02-06 12:42:31,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007693550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:31,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:31,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:42:31,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386912984] [2025-02-06 12:42:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:31,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:42:31,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:42:31,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:42:31,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:42:31,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-02-06 12:42:31,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 128 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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:31,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:31,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-02-06 12:42:31,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:31,828 INFO L124 PetriNetUnfolderBase]: 2017/3194 cut-off events. [2025-02-06 12:42:31,828 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2025-02-06 12:42:31,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7286 conditions, 3194 events. 2017/3194 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16144 event pairs, 321 based on Foata normal form. 8/3201 useless extension candidates. Maximal degree in co-relation 7274. Up to 1348 conditions per place. [2025-02-06 12:42:31,834 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 51 selfloop transitions, 4 changer transitions 58/118 dead transitions. [2025-02-06 12:42:31,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 118 transitions, 568 flow [2025-02-06 12:42:31,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:42:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:42:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2025-02-06 12:42:31,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41435185185185186 [2025-02-06 12:42:31,836 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 128 flow. Second operand 9 states and 179 transitions. [2025-02-06 12:42:31,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 118 transitions, 568 flow [2025-02-06 12:42:31,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 118 transitions, 554 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 12:42:31,838 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 139 flow [2025-02-06 12:42:31,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=139, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-02-06 12:42:31,840 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-02-06 12:42:31,840 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 139 flow [2025-02-06 12:42:31,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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:31,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:31,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:31,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:42:31,841 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:31,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:31,842 INFO L85 PathProgramCache]: Analyzing trace with hash -800806253, now seen corresponding path program 3 times [2025-02-06 12:42:31,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:42:31,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276931657] [2025-02-06 12:42:31,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:42:31,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:42:31,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:42:31,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:42:31,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:42:31,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:42:31,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:42:31,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:42:31,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:42:31,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:31,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:42:32,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:42:32,012 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:42:32,013 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 12:42:32,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:42:32,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:42:32,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:42:32,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-06 12:42:32,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-06 12:42:32,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:42:32,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:42:32,019 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:32,088 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:42:32,088 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:42:32,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:42:32 BasicIcfg [2025-02-06 12:42:32,093 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:42:32,095 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:42:32,095 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:42:32,095 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:42:32,096 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:19" (3/4) ... [2025-02-06 12:42:32,097 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:42:32,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:42:32,099 INFO L158 Benchmark]: Toolchain (without parser) took 13952.83ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 122.5MB in the beginning and 828.1MB in the end (delta: -705.6MB). Peak memory consumption was 979.6MB. Max. memory is 16.1GB. [2025-02-06 12:42:32,099 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 209.7MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:32,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.40ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 98.8MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:42:32,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.45ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 96.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:32,099 INFO L158 Benchmark]: Boogie Preprocessor took 51.81ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 93.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:32,100 INFO L158 Benchmark]: IcfgBuilder took 631.79ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 37.7MB in the end (delta: 56.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 12:42:32,100 INFO L158 Benchmark]: TraceAbstraction took 12798.06ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 37.2MB in the beginning and 828.4MB in the end (delta: -791.1MB). Peak memory consumption was 895.7MB. Max. memory is 16.1GB. [2025-02-06 12:42:32,100 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 1.9GB. Free memory was 828.4MB in the beginning and 828.1MB in the end (delta: 252.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:32,101 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.16ms. Allocated memory is still 209.7MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.40ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 98.8MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.45ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 96.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.81ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 93.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 631.79ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 37.7MB in the end (delta: 56.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12798.06ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 37.2MB in the beginning and 828.4MB in the end (delta: -791.1MB). Peak memory consumption was 895.7MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 1.9GB. Free memory was 828.4MB in the beginning and 828.1MB in the end (delta: 252.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [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; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t849; [L856] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t850; [L858] FCALL, FORK 0 pthread_create(&t850, ((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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-2, t850=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t851; [L860] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L811] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L801] 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, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix032.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 858]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 665 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1961 IncrementalHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 2 mSDtfsCounter, 1961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=7, InterpolantAutomatonStates: 57, 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.3s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 938 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:42:32,115 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 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/mix032.oepc.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 f271a38be9caac1825a663eb11850ec78cc50bf41fe675769961ef9ec85f6a9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:42:34,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:42:34,709 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:34,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:42:34,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:42:34,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:42:34,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:42:34,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:42:34,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:42:34,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:42:34,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:42:34,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:42:34,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:42:34,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:42:34,744 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:42:34,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:42:34,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:42:34,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:42:34,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:42:34,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:42:34,745 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:42:34,745 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:42:34,745 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:42:34,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:42:34,745 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:42:34,745 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:42:34,746 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:42:34,746 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:42:34,746 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:42:34,746 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:42:34,746 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:42:34,746 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:42:34,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:42:34,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:42:34,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:42:34,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:42:34,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:42:34,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:42:34,747 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:42:34,747 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:42:34,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:42:34,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:42:34,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:42:34,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:42:34,748 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 -> f271a38be9caac1825a663eb11850ec78cc50bf41fe675769961ef9ec85f6a9e [2025-02-06 12:42:35,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:42:35,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:42:35,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:42:35,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:42:35,185 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:42:35,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix032.oepc.i [2025-02-06 12:42:36,590 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a819b10f0/bafb2ea9045143e69bc983aedb229b59/FLAG668288792 [2025-02-06 12:42:36,874 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:42:36,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix032.oepc.i [2025-02-06 12:42:36,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a819b10f0/bafb2ea9045143e69bc983aedb229b59/FLAG668288792 [2025-02-06 12:42:36,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a819b10f0/bafb2ea9045143e69bc983aedb229b59 [2025-02-06 12:42:36,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:42:36,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:42:36,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:42:36,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:42:36,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:42:36,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:42:36" (1/1) ... [2025-02-06 12:42:36,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6b91dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:36, skipping insertion in model container [2025-02-06 12:42:36,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:42:36" (1/1) ... [2025-02-06 12:42:36,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:42:37,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:42:37,282 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:42:37,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:42:37,407 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:42:37,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:37 WrapperNode [2025-02-06 12:42:37,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:42:37,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:42:37,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:42:37,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:42:37,421 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:37" (1/1) ... [2025-02-06 12:42:37,444 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:37" (1/1) ... [2025-02-06 12:42:37,469 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2025-02-06 12:42:37,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:42:37,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:42:37,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:42:37,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:42:37,486 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:37" (1/1) ... [2025-02-06 12:42:37,489 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:37" (1/1) ... [2025-02-06 12:42:37,493 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:37" (1/1) ... [2025-02-06 12:42:37,515 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:37,519 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:37" (1/1) ... [2025-02-06 12:42:37,520 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:37" (1/1) ... [2025-02-06 12:42:37,529 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:37" (1/1) ... [2025-02-06 12:42:37,530 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:37" (1/1) ... [2025-02-06 12:42:37,534 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:37" (1/1) ... [2025-02-06 12:42:37,535 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:37" (1/1) ... [2025-02-06 12:42:37,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:42:37,539 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:42:37,539 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:42:37,539 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:42:37,540 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:37" (1/1) ... [2025-02-06 12:42:37,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:42:37,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:37,664 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:37,668 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:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:42:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:42:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:42:37,690 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:42:37,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:42:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:42:37,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:42:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:42:37,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:42:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:42:37,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:42:37,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:42:37,692 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:37,882 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:42:37,884 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:42:38,273 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:42:38,273 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:42:38,597 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:42:38,597 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:42:38,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:42:38 BoogieIcfgContainer [2025-02-06 12:42:38,598 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:42:38,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:42:38,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:42:38,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:42:38,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:42:36" (1/3) ... [2025-02-06 12:42:38,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74591629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:42:38, skipping insertion in model container [2025-02-06 12:42:38,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:42:37" (2/3) ... [2025-02-06 12:42:38,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74591629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:42:38, skipping insertion in model container [2025-02-06 12:42:38,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:42:38" (3/3) ... [2025-02-06 12:42:38,612 INFO L128 eAbstractionObserver]: Analyzing ICFG mix032.oepc.i [2025-02-06 12:42:38,645 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:42:38,652 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix032.oepc.i that has 4 procedures, 47 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:42:38,652 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:42:38,721 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:42:38,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2025-02-06 12:42:38,802 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2025-02-06 12:42:38,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:38,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-02-06 12:42:38,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2025-02-06 12:42:38,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2025-02-06 12:42:38,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:42:38,823 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;@d67518b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:42:38,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:42:38,826 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:42:38,828 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-06 12:42:38,828 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:38,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:38,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 12:42:38,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:38,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:38,834 INFO L85 PathProgramCache]: Analyzing trace with hash 12513361, now seen corresponding path program 1 times [2025-02-06 12:42:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:38,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683287919] [2025-02-06 12:42:38,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:38,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:38,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:38,849 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:38,850 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:38,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 12:42:38,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 12:42:39,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:39,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:39,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:42:39,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:39,052 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:39,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:39,056 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:39,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683287919] [2025-02-06 12:42:39,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683287919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:39,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:39,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:42:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548731005] [2025-02-06 12:42:39,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:39,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:42:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:39,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:42:39,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:42:39,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:39,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 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:39,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:39,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:39,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:40,899 INFO L124 PetriNetUnfolderBase]: 9711/13872 cut-off events. [2025-02-06 12:42:40,901 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-06 12:42:40,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27647 conditions, 13872 events. 9711/13872 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 81784 event pairs, 1071 based on Foata normal form. 760/14623 useless extension candidates. Maximal degree in co-relation 27636. Up to 11931 conditions per place. [2025-02-06 12:42:40,988 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 57 selfloop transitions, 2 changer transitions 2/68 dead transitions. [2025-02-06 12:42:40,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 273 flow [2025-02-06 12:42:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:42:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:42:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-02-06 12:42:41,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 12:42:41,002 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 96 transitions. [2025-02-06 12:42:41,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 273 flow [2025-02-06 12:42:41,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:42:41,010 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2025-02-06 12:42:41,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-02-06 12:42:41,014 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-02-06 12:42:41,015 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2025-02-06 12:42:41,016 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,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:41,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:41,027 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:41,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:41,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:41,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1241211242, now seen corresponding path program 1 times [2025-02-06 12:42:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:41,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1489031623] [2025-02-06 12:42:41,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:41,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:41,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:41,226 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:41,228 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:41,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:42:41,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:42:41,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:41,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:41,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:42:41,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:41,335 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,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:41,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489031623] [2025-02-06 12:42:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489031623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:41,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:42:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297231730] [2025-02-06 12:42:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:41,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:42:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:41,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:42:41,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:42:41,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2025-02-06 12:42:41,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:41,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:41,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2025-02-06 12:42:41,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:43,105 INFO L124 PetriNetUnfolderBase]: 8719/13255 cut-off events. [2025-02-06 12:42:43,106 INFO L125 PetriNetUnfolderBase]: For 594/594 co-relation queries the response was YES. [2025-02-06 12:42:43,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26247 conditions, 13255 events. 8719/13255 cut-off events. For 594/594 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 81287 event pairs, 8719 based on Foata normal form. 384/13584 useless extension candidates. Maximal degree in co-relation 26237. Up to 12284 conditions per place. [2025-02-06 12:42:43,166 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 31 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-02-06 12:42:43,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 154 flow [2025-02-06 12:42:43,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:42:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:42:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-02-06 12:42:43,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2025-02-06 12:42:43,168 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 3 states and 61 transitions. [2025-02-06 12:42:43,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 154 flow [2025-02-06 12:42:43,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:42:43,170 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2025-02-06 12:42:43,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-02-06 12:42:43,171 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-02-06 12:42:43,171 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2025-02-06 12:42:43,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:43,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:43,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:43,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:42:43,372 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:43,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:43,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:43,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1241210835, now seen corresponding path program 1 times [2025-02-06 12:42:43,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:43,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656049665] [2025-02-06 12:42:43,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:43,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:43,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:43,385 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:43,387 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:43,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:42:43,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:42:43,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:43,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:43,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:42:43,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:43,494 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,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:43,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:43,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656049665] [2025-02-06 12:42:43,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656049665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:43,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:43,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:42:43,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898858271] [2025-02-06 12:42:43,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:43,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:42:43,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:43,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:42:43,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:42:43,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:43,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:43,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:43,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:43,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:44,256 INFO L124 PetriNetUnfolderBase]: 5887/9319 cut-off events. [2025-02-06 12:42:44,256 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:42:44,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18021 conditions, 9319 events. 5887/9319 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 57556 event pairs, 1119 based on Foata normal form. 384/9698 useless extension candidates. Maximal degree in co-relation 18015. Up to 4801 conditions per place. [2025-02-06 12:42:44,299 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 67 selfloop transitions, 5 changer transitions 1/79 dead transitions. [2025-02-06 12:42:44,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 316 flow [2025-02-06 12:42:44,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:42:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:42:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-02-06 12:42:44,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2025-02-06 12:42:44,301 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 4 states and 115 transitions. [2025-02-06 12:42:44,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 316 flow [2025-02-06 12:42:44,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:42:44,303 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 117 flow [2025-02-06 12:42:44,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2025-02-06 12:42:44,303 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2025-02-06 12:42:44,303 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 117 flow [2025-02-06 12:42:44,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:44,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:44,303 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:44,310 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:44,508 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:44,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:44,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1966384283, now seen corresponding path program 1 times [2025-02-06 12:42:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019254686] [2025-02-06 12:42:44,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:44,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:44,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:44,513 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:44,515 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:44,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:42:44,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:42:44,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:44,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:44,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:42:44,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:44,614 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,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:44,615 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:44,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019254686] [2025-02-06 12:42:44,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019254686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:44,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:44,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:42:44,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372843930] [2025-02-06 12:42:44,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:44,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:42:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:44,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:42:44,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:42:44,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:44,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:44,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:44,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:44,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:45,071 INFO L124 PetriNetUnfolderBase]: 3103/4879 cut-off events. [2025-02-06 12:42:45,072 INFO L125 PetriNetUnfolderBase]: For 980/980 co-relation queries the response was YES. [2025-02-06 12:42:45,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10960 conditions, 4879 events. 3103/4879 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 25568 event pairs, 731 based on Foata normal form. 240/5114 useless extension candidates. Maximal degree in co-relation 10951. Up to 1692 conditions per place. [2025-02-06 12:42:45,089 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 86 selfloop transitions, 8 changer transitions 1/101 dead transitions. [2025-02-06 12:42:45,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 448 flow [2025-02-06 12:42:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:42:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:42:45,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-02-06 12:42:45,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6125 [2025-02-06 12:42:45,091 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 117 flow. Second operand 5 states and 147 transitions. [2025-02-06 12:42:45,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 101 transitions, 448 flow [2025-02-06 12:42:45,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 438 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:42:45,094 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 157 flow [2025-02-06 12:42:45,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-02-06 12:42:45,094 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-02-06 12:42:45,094 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 157 flow [2025-02-06 12:42:45,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:45,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:45,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:45,102 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:45,299 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:45,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:45,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash -421989311, now seen corresponding path program 1 times [2025-02-06 12:42:45,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:45,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836714363] [2025-02-06 12:42:45,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:45,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:45,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:45,310 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:45,317 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:45,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:42:45,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:42:45,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:45,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:45,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:42:45,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:45,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:45,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:45,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836714363] [2025-02-06 12:42:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836714363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:45,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:45,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:42:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228219147] [2025-02-06 12:42:45,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:45,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:42:45,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:45,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:42:45,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:42:45,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:45,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:45,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:45,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:45,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:45,836 INFO L124 PetriNetUnfolderBase]: 1979/3011 cut-off events. [2025-02-06 12:42:45,836 INFO L125 PetriNetUnfolderBase]: For 1682/1682 co-relation queries the response was YES. [2025-02-06 12:42:45,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7324 conditions, 3011 events. 1979/3011 cut-off events. For 1682/1682 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 14058 event pairs, 667 based on Foata normal form. 72/3078 useless extension candidates. Maximal degree in co-relation 7313. Up to 1168 conditions per place. [2025-02-06 12:42:45,851 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 71 selfloop transitions, 11 changer transitions 1/89 dead transitions. [2025-02-06 12:42:45,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 423 flow [2025-02-06 12:42:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:42:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:42:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-06 12:42:45,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2025-02-06 12:42:45,853 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 157 flow. Second operand 6 states and 145 transitions. [2025-02-06 12:42:45,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 423 flow [2025-02-06 12:42:45,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 398 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 12:42:45,864 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 171 flow [2025-02-06 12:42:45,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2025-02-06 12:42:45,864 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2025-02-06 12:42:45,865 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 171 flow [2025-02-06 12:42:45,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:45,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:45,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:45,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 12:42:46,065 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:46,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:46,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash 595681971, now seen corresponding path program 1 times [2025-02-06 12:42:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385862210] [2025-02-06 12:42:46,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:42:46,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:46,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:46,069 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:46,071 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:46,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:42:46,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:42:46,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:46,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:46,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:42:46,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:46,335 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:46,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:46,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385862210] [2025-02-06 12:42:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385862210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:42:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166683375] [2025-02-06 12:42:46,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:46,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:42:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:46,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:42:46,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:42:46,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:46,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 171 flow. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:46,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:46,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:46,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:46,942 INFO L124 PetriNetUnfolderBase]: 2885/4393 cut-off events. [2025-02-06 12:42:46,942 INFO L125 PetriNetUnfolderBase]: For 2694/2694 co-relation queries the response was YES. [2025-02-06 12:42:46,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10879 conditions, 4393 events. 2885/4393 cut-off events. For 2694/2694 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 22051 event pairs, 293 based on Foata normal form. 8/4400 useless extension candidates. Maximal degree in co-relation 10867. Up to 1793 conditions per place. [2025-02-06 12:42:46,954 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 61 selfloop transitions, 7 changer transitions 53/127 dead transitions. [2025-02-06 12:42:46,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 127 transitions, 673 flow [2025-02-06 12:42:46,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:42:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:42:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2025-02-06 12:42:46,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2025-02-06 12:42:46,955 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 171 flow. Second operand 9 states and 206 transitions. [2025-02-06 12:42:46,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 127 transitions, 673 flow [2025-02-06 12:42:46,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 127 transitions, 556 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:42:46,969 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 159 flow [2025-02-06 12:42:46,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2025-02-06 12:42:46,970 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2025-02-06 12:42:46,970 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 159 flow [2025-02-06 12:42:46,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:46,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:46,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:46,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 12:42:47,171 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:47,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:47,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:47,172 INFO L85 PathProgramCache]: Analyzing trace with hash 103001631, now seen corresponding path program 2 times [2025-02-06 12:42:47,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:47,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114718552] [2025-02-06 12:42:47,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:42:47,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:47,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:47,176 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:47,176 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:47,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:42:47,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:42:47,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:42:47,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:47,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:42:47,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:47,350 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:47,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:47,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:47,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114718552] [2025-02-06 12:42:47,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114718552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:47,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:47,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:42:47,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657584225] [2025-02-06 12:42:47,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:47,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:42:47,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:47,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:42:47,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:42:47,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:47,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 159 flow. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:47,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:47,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:47,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:47,800 INFO L124 PetriNetUnfolderBase]: 2469/3813 cut-off events. [2025-02-06 12:42:47,801 INFO L125 PetriNetUnfolderBase]: For 1025/1027 co-relation queries the response was YES. [2025-02-06 12:42:47,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9107 conditions, 3813 events. 2469/3813 cut-off events. For 1025/1027 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18763 event pairs, 341 based on Foata normal form. 8/3816 useless extension candidates. Maximal degree in co-relation 9093. Up to 1793 conditions per place. [2025-02-06 12:42:47,816 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 59 selfloop transitions, 10 changer transitions 44/119 dead transitions. [2025-02-06 12:42:47,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 119 transitions, 592 flow [2025-02-06 12:42:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:42:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:42:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2025-02-06 12:42:47,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4513888888888889 [2025-02-06 12:42:47,818 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 159 flow. Second operand 9 states and 195 transitions. [2025-02-06 12:42:47,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 119 transitions, 592 flow [2025-02-06 12:42:47,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 554 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-06 12:42:47,823 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 199 flow [2025-02-06 12:42:47,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=199, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2025-02-06 12:42:47,824 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2025-02-06 12:42:47,824 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 199 flow [2025-02-06 12:42:47,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:47,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:47,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:47,832 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:48,025 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:48,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:48,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:48,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2109177127, now seen corresponding path program 3 times [2025-02-06 12:42:48,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:48,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1554343996] [2025-02-06 12:42:48,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:42:48,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:48,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:48,034 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:48,035 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:48,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:42:48,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:42:48,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:42:48,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:48,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:42:48,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:48,543 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:48,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:48,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:48,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554343996] [2025-02-06 12:42:48,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554343996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:48,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:48,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:42:48,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970509785] [2025-02-06 12:42:48,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:48,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:42:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:48,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:42:48,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:42:48,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:48,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 199 flow. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 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:48,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:48,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:48,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:49,182 INFO L124 PetriNetUnfolderBase]: 2137/3330 cut-off events. [2025-02-06 12:42:49,182 INFO L125 PetriNetUnfolderBase]: For 1004/1004 co-relation queries the response was YES. [2025-02-06 12:42:49,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8480 conditions, 3330 events. 2137/3330 cut-off events. For 1004/1004 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16516 event pairs, 237 based on Foata normal form. 8/3337 useless extension candidates. Maximal degree in co-relation 8464. Up to 1380 conditions per place. [2025-02-06 12:42:49,196 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 80 selfloop transitions, 4 changer transitions 51/141 dead transitions. [2025-02-06 12:42:49,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 141 transitions, 798 flow [2025-02-06 12:42:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:42:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:42:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions. [2025-02-06 12:42:49,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2025-02-06 12:42:49,199 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 199 flow. Second operand 10 states and 202 transitions. [2025-02-06 12:42:49,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 141 transitions, 798 flow [2025-02-06 12:42:49,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 141 transitions, 762 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-06 12:42:49,202 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 188 flow [2025-02-06 12:42:49,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=188, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2025-02-06 12:42:49,203 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2025-02-06 12:42:49,203 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 188 flow [2025-02-06 12:42:49,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 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:49,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:49,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:49,213 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:49,404 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:49,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:49,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1988846669, now seen corresponding path program 4 times [2025-02-06 12:42:49,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:49,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979967269] [2025-02-06 12:42:49,405 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:42:49,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:49,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:49,410 INFO L229 MonitoredProcess]: Starting monitored process 10 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:49,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:42:49,468 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-02-06 12:42:49,482 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 34 statements. [2025-02-06 12:42:49,483 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 12:42:49,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:49,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 12:42:49,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:42:49,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:49,556 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:49,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979967269] [2025-02-06 12:42:49,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979967269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:49,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:49,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:42:49,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514940277] [2025-02-06 12:42:49,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:49,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:42:49,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:49,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:42:49,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:42:49,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:49,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 188 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:49,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:49,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:49,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:49,967 INFO L124 PetriNetUnfolderBase]: 1993/3169 cut-off events. [2025-02-06 12:42:49,968 INFO L125 PetriNetUnfolderBase]: For 1585/1587 co-relation queries the response was YES. [2025-02-06 12:42:49,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8077 conditions, 3169 events. 1993/3169 cut-off events. For 1585/1587 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 15676 event pairs, 521 based on Foata normal form. 8/3176 useless extension candidates. Maximal degree in co-relation 8059. Up to 2168 conditions per place. [2025-02-06 12:42:49,978 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 54 selfloop transitions, 2 changer transitions 38/100 dead transitions. [2025-02-06 12:42:49,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 530 flow [2025-02-06 12:42:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:42:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:42:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2025-02-06 12:42:49,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2025-02-06 12:42:49,980 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 188 flow. Second operand 7 states and 151 transitions. [2025-02-06 12:42:49,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 530 flow [2025-02-06 12:42:49,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 500 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-02-06 12:42:49,985 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 188 flow [2025-02-06 12:42:49,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2025-02-06 12:42:49,985 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2025-02-06 12:42:49,986 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 188 flow [2025-02-06 12:42:49,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:49,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:49,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:49,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 12:42:50,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:50,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:50,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash -938577959, now seen corresponding path program 5 times [2025-02-06 12:42:50,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:50,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957243515] [2025-02-06 12:42:50,192 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:42:50,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:50,194 INFO L229 MonitoredProcess]: Starting monitored process 11 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:50,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:42:50,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:42:50,277 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:42:50,277 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:42:50,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:42:50,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:42:50,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:42:50,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:50,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:42:50,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:42:50,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957243515] [2025-02-06 12:42:50,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957243515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:42:50,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:42:50,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:42:50,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174418095] [2025-02-06 12:42:50,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:42:50,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:42:50,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:42:50,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:42:50,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:42:50,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-02-06 12:42:50,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 188 flow. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:50,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:42:50,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-02-06 12:42:50,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:42:50,884 INFO L124 PetriNetUnfolderBase]: 1841/2973 cut-off events. [2025-02-06 12:42:50,884 INFO L125 PetriNetUnfolderBase]: For 1589/1593 co-relation queries the response was YES. [2025-02-06 12:42:50,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7317 conditions, 2973 events. 1841/2973 cut-off events. For 1589/1593 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14639 event pairs, 283 based on Foata normal form. 8/2976 useless extension candidates. Maximal degree in co-relation 7299. Up to 1384 conditions per place. [2025-02-06 12:42:50,892 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 46 selfloop transitions, 7 changer transitions 48/107 dead transitions. [2025-02-06 12:42:50,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 553 flow [2025-02-06 12:42:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:42:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:42:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2025-02-06 12:42:50,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-02-06 12:42:50,893 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 188 flow. Second operand 9 states and 184 transitions. [2025-02-06 12:42:50,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 553 flow [2025-02-06 12:42:50,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 524 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-06 12:42:50,897 INFO L231 Difference]: Finished difference. Result has 72 places, 46 transitions, 179 flow [2025-02-06 12:42:50,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=179, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2025-02-06 12:42:50,899 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2025-02-06 12:42:50,899 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 46 transitions, 179 flow [2025-02-06 12:42:50,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:42:50,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:42:50,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:42:50,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 12:42:51,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:51,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:42:51,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:42:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash 708604699, now seen corresponding path program 6 times [2025-02-06 12:42:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:42:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44319350] [2025-02-06 12:42:51,102 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 12:42:51,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:51,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:42:51,105 INFO L229 MonitoredProcess]: Starting monitored process 12 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,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 12:42:51,173 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:42:51,195 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:42:51,195 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 12:42:51,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:42:51,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:42:51,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:42:51,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:42:51,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:42:51,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:42:51,308 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:42:51,308 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:42:51,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 12:42:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:42:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:42:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:42:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-06 12:42:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-06 12:42:51,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:42:51,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 12:42:51,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:42:51,512 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2025-02-06 12:42:51,573 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:42:51,573 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:42:51,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:42:51 BasicIcfg [2025-02-06 12:42:51,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:42:51,578 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:42:51,578 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:42:51,578 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:42:51,579 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:38" (3/4) ... [2025-02-06 12:42:51,581 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:42:51,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:42:51,582 INFO L158 Benchmark]: Toolchain (without parser) took 14672.34ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 90.2MB in the beginning and 908.9MB in the end (delta: -818.7MB). Peak memory consumption was 217.7MB. Max. memory is 16.1GB. [2025-02-06 12:42:51,583 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:51,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.43ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 66.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:42:51,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.18ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 64.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:51,583 INFO L158 Benchmark]: Boogie Preprocessor took 67.83ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 61.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:51,584 INFO L158 Benchmark]: IcfgBuilder took 1059.07ms. Allocated memory is still 117.4MB. Free memory was 61.5MB in the beginning and 41.2MB in the end (delta: 20.2MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2025-02-06 12:42:51,584 INFO L158 Benchmark]: TraceAbstraction took 12978.21ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 40.5MB in the beginning and 913.1MB in the end (delta: -872.6MB). Peak memory consumption was 170.7MB. Max. memory is 16.1GB. [2025-02-06 12:42:51,584 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 1.2GB. Free memory was 913.1MB in the beginning and 908.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:42:51,585 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.78ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.43ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 66.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.18ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 64.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.83ms. Allocated memory is still 117.4MB. Free memory was 64.3MB in the beginning and 61.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1059.07ms. Allocated memory is still 117.4MB. Free memory was 61.5MB in the beginning and 41.2MB in the end (delta: 20.2MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12978.21ms. Allocated memory was 117.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 40.5MB in the beginning and 913.1MB in the end (delta: -872.6MB). Peak memory consumption was 170.7MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 1.2GB. Free memory was 913.1MB in the beginning and 908.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t849; [L856] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t850; [L858] FCALL, FORK 0 pthread_create(&t850, ((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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-2, t850=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t851; [L782] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L811] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L840] 3 __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, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-2, t850=-1, t851=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix032.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 858]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 666 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 656 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2830 IncrementalHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 3 mSDtfsCounter, 2830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=7, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 285 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 1138 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1097 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:42:51,601 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