./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix038.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/mix038.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:19:00,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:19:00,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:19:00,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:19:00,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:19:00,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:19:00,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:19:00,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:19:00,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:19:00,751 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:19:00,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:19:00,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:19:00,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:19:00,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:19:00,753 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:19:00,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:19:00,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:19:00,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:19:00,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:19:00,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:19:00,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:19:00,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:19:00,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:19:00,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:19:00,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:19:00,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:19:00,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:19:00,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:19:00,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:19:00,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:19:00,756 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a [2025-02-08 08:19:01,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:19:01,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:19:01,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:19:01,029 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:19:01,029 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:19:01,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix038.opt.i [2025-02-08 08:19:02,292 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d954e0ec/e703503aa641459cb9e674c78f73f68f/FLAGb9bba05da [2025-02-08 08:19:02,634 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:19:02,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2025-02-08 08:19:02,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d954e0ec/e703503aa641459cb9e674c78f73f68f/FLAGb9bba05da [2025-02-08 08:19:02,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d954e0ec/e703503aa641459cb9e674c78f73f68f [2025-02-08 08:19:02,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:19:02,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:19:02,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:19:02,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:19:02,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:19:02,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:19:02" (1/1) ... [2025-02-08 08:19:02,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd5da9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:02, skipping insertion in model container [2025-02-08 08:19:02,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:19:02" (1/1) ... [2025-02-08 08:19:02,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:19:03,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:19:03,192 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:19:03,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:19:03,279 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:19:03,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03 WrapperNode [2025-02-08 08:19:03,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:19:03,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:19:03,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:19:03,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:19:03,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,309 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2025-02-08 08:19:03,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:19:03,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:19:03,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:19:03,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:19:03,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,335 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-08 08:19:03,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,340 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:19:03,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:19:03,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:19:03,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:19:03,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (1/1) ... [2025-02-08 08:19:03,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:19:03,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:19:03,368 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-08 08:19:03,370 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-08 08:19:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:19:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:19:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:19:03,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:19:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:19:03,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:19:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:19:03,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:19:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:19:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:19:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:19:03,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:19:03,390 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:19:03,491 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:19:03,493 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:19:03,724 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:19:03,724 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:19:03,879 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:19:03,879 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:19:03,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:19:03 BoogieIcfgContainer [2025-02-08 08:19:03,880 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:19:03,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:19:03,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:19:03,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:19:03,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:19:02" (1/3) ... [2025-02-08 08:19:03,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f193b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:19:03, skipping insertion in model container [2025-02-08 08:19:03,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:03" (2/3) ... [2025-02-08 08:19:03,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f193b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:19:03, skipping insertion in model container [2025-02-08 08:19:03,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:19:03" (3/3) ... [2025-02-08 08:19:03,887 INFO L128 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2025-02-08 08:19:03,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:19:03,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix038.opt.i that has 4 procedures, 45 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:19:03,900 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:19:03,959 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:19:03,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2025-02-08 08:19:04,026 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2025-02-08 08:19:04,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:19:04,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-08 08:19:04,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2025-02-08 08:19:04,035 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2025-02-08 08:19:04,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:19:04,055 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;@a79b5b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:19:04,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:19:04,065 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:19:04,067 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-02-08 08:19:04,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:19:04,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:04,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:04,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:04,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash 652021099, now seen corresponding path program 1 times [2025-02-08 08:19:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:04,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331616239] [2025-02-08 08:19:04,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:04,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:04,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:19:04,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:19:04,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:04,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:04,514 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-08 08:19:04,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:04,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331616239] [2025-02-08 08:19:04,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331616239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:04,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:04,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:19:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142483998] [2025-02-08 08:19:04,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:04,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:19:04,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:04,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:19:04,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:19:04,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:19:04,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:19:04,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:04,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:19:04,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:05,541 INFO L124 PetriNetUnfolderBase]: 7163/10281 cut-off events. [2025-02-08 08:19:05,542 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 08:19:05,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20500 conditions, 10281 events. 7163/10281 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 56384 event pairs, 695 based on Foata normal form. 576/10852 useless extension candidates. Maximal degree in co-relation 20489. Up to 8989 conditions per place. [2025-02-08 08:19:05,596 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-02-08 08:19:05,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 227 flow [2025-02-08 08:19:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:19:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:19:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-08 08:19:05,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2025-02-08 08:19:05,613 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 86 transitions. [2025-02-08 08:19:05,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 227 flow [2025-02-08 08:19:05,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:19:05,620 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2025-02-08 08:19:05,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-02-08 08:19:05,626 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-02-08 08:19:05,627 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2025-02-08 08:19:05,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:19:05,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:05,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:05,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:19:05,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:05,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash 73534953, now seen corresponding path program 1 times [2025-02-08 08:19:05,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:05,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357074834] [2025-02-08 08:19:05,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:05,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:19:05,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:19:05,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:05,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:05,732 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-08 08:19:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357074834] [2025-02-08 08:19:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357074834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:05,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:05,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:19:05,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228741948] [2025-02-08 08:19:05,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:05,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:19:05,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:05,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:19:05,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:19:05,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:19:05,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 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-08 08:19:05,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:05,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:19:05,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:06,344 INFO L124 PetriNetUnfolderBase]: 6431/9837 cut-off events. [2025-02-08 08:19:06,345 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-02-08 08:19:06,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19359 conditions, 9837 events. 6431/9837 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 58632 event pairs, 6431 based on Foata normal form. 288/10084 useless extension candidates. Maximal degree in co-relation 19349. Up to 9108 conditions per place. [2025-02-08 08:19:06,378 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2025-02-08 08:19:06,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 146 flow [2025-02-08 08:19:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:19:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:19:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-08 08:19:06,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2025-02-08 08:19:06,379 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 59 transitions. [2025-02-08 08:19:06,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 146 flow [2025-02-08 08:19:06,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:19:06,381 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2025-02-08 08:19:06,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-08 08:19:06,382 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-02-08 08:19:06,382 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2025-02-08 08:19:06,382 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-08 08:19:06,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:06,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:06,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:19:06,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:06,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:06,383 INFO L85 PathProgramCache]: Analyzing trace with hash 73536262, now seen corresponding path program 1 times [2025-02-08 08:19:06,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:06,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162930686] [2025-02-08 08:19:06,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:06,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:19:06,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:19:06,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:06,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:06,558 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-08 08:19:06,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:06,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162930686] [2025-02-08 08:19:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162930686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:19:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141314680] [2025-02-08 08:19:06,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:06,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:19:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:06,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:19:06,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:19:06,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:19:06,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 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-08 08:19:06,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:06,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:19:06,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:08,164 INFO L124 PetriNetUnfolderBase]: 13123/19343 cut-off events. [2025-02-08 08:19:08,164 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:19:08,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38265 conditions, 19343 events. 13123/19343 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 121207 event pairs, 3276 based on Foata normal form. 0/18884 useless extension candidates. Maximal degree in co-relation 38259. Up to 8035 conditions per place. [2025-02-08 08:19:08,223 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 49 selfloop transitions, 6 changer transitions 107/167 dead transitions. [2025-02-08 08:19:08,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 167 transitions, 668 flow [2025-02-08 08:19:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:19:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:19:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2025-02-08 08:19:08,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5917874396135265 [2025-02-08 08:19:08,225 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 9 states and 245 transitions. [2025-02-08 08:19:08,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 167 transitions, 668 flow [2025-02-08 08:19:08,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 167 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:19:08,229 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 161 flow [2025-02-08 08:19:08,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=161, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-02-08 08:19:08,230 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2025-02-08 08:19:08,230 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 161 flow [2025-02-08 08:19:08,230 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-08 08:19:08,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:08,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:08,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:19:08,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:08,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash -44511675, now seen corresponding path program 1 times [2025-02-08 08:19:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:08,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045261592] [2025-02-08 08:19:08,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:08,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:08,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:19:08,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:19:08,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:08,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:08,407 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-08 08:19:08,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045261592] [2025-02-08 08:19:08,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045261592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:08,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:08,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:19:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371768388] [2025-02-08 08:19:08,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:08,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:19:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:08,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:19:08,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:19:08,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:19:08,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:19:08,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:08,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:19:08,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:09,475 INFO L124 PetriNetUnfolderBase]: 9320/13853 cut-off events. [2025-02-08 08:19:09,475 INFO L125 PetriNetUnfolderBase]: For 13277/13277 co-relation queries the response was YES. [2025-02-08 08:19:09,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37489 conditions, 13853 events. 9320/13853 cut-off events. For 13277/13277 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 81568 event pairs, 2314 based on Foata normal form. 400/14249 useless extension candidates. Maximal degree in co-relation 37474. Up to 5365 conditions per place. [2025-02-08 08:19:09,519 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 58 selfloop transitions, 7 changer transitions 80/150 dead transitions. [2025-02-08 08:19:09,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 150 transitions, 825 flow [2025-02-08 08:19:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:19:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:19:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 231 transitions. [2025-02-08 08:19:09,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5021739130434782 [2025-02-08 08:19:09,523 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 161 flow. Second operand 10 states and 231 transitions. [2025-02-08 08:19:09,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 150 transitions, 825 flow [2025-02-08 08:19:09,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 150 transitions, 741 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-02-08 08:19:09,563 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 203 flow [2025-02-08 08:19:09,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=203, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2025-02-08 08:19:09,563 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2025-02-08 08:19:09,564 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 203 flow [2025-02-08 08:19:09,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:19:09,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:09,564 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-08 08:19:09,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:19:09,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:09,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1604949901, now seen corresponding path program 1 times [2025-02-08 08:19:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:09,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964459131] [2025-02-08 08:19:09,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:09,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:19:09,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:19:09,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:09,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:09,734 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-08 08:19:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964459131] [2025-02-08 08:19:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964459131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:09,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:09,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:19:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006519616] [2025-02-08 08:19:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:09,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:19:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:09,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:19:09,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:19:09,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:19:09,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 203 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-08 08:19:09,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:09,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:19:09,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:10,865 INFO L124 PetriNetUnfolderBase]: 8585/12797 cut-off events. [2025-02-08 08:19:10,865 INFO L125 PetriNetUnfolderBase]: For 20230/20230 co-relation queries the response was YES. [2025-02-08 08:19:10,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36701 conditions, 12797 events. 8585/12797 cut-off events. For 20230/20230 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 76372 event pairs, 1467 based on Foata normal form. 296/13090 useless extension candidates. Maximal degree in co-relation 36679. Up to 6717 conditions per place. [2025-02-08 08:19:10,918 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 63 selfloop transitions, 13 changer transitions 70/151 dead transitions. [2025-02-08 08:19:10,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 151 transitions, 909 flow [2025-02-08 08:19:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:19:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:19:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 234 transitions. [2025-02-08 08:19:10,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.508695652173913 [2025-02-08 08:19:10,920 INFO L175 Difference]: Start difference. First operand has 67 places, 43 transitions, 203 flow. Second operand 10 states and 234 transitions. [2025-02-08 08:19:10,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 151 transitions, 909 flow [2025-02-08 08:19:11,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 151 transitions, 859 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-02-08 08:19:11,045 INFO L231 Difference]: Finished difference. Result has 73 places, 47 transitions, 276 flow [2025-02-08 08:19:11,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=276, PETRI_PLACES=73, PETRI_TRANSITIONS=47} [2025-02-08 08:19:11,046 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2025-02-08 08:19:11,046 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 47 transitions, 276 flow [2025-02-08 08:19:11,046 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-08 08:19:11,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:11,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:11,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:19:11,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:11,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:11,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1560046444, now seen corresponding path program 1 times [2025-02-08 08:19:11,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:11,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569794277] [2025-02-08 08:19:11,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:11,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:19:11,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:19:11,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:11,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:11,160 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-08 08:19:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569794277] [2025-02-08 08:19:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569794277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:11,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:11,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:19:11,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96276658] [2025-02-08 08:19:11,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:11,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:19:11,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:11,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:19:11,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:19:11,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:19:11,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 47 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:19:11,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:11,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:19:11,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:11,863 INFO L124 PetriNetUnfolderBase]: 6393/9880 cut-off events. [2025-02-08 08:19:11,863 INFO L125 PetriNetUnfolderBase]: For 18828/18828 co-relation queries the response was YES. [2025-02-08 08:19:11,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29148 conditions, 9880 events. 6393/9880 cut-off events. For 18828/18828 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 58761 event pairs, 1086 based on Foata normal form. 468/10344 useless extension candidates. Maximal degree in co-relation 29121. Up to 5052 conditions per place. [2025-02-08 08:19:11,913 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 91 selfloop transitions, 5 changer transitions 1/102 dead transitions. [2025-02-08 08:19:11,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 102 transitions, 834 flow [2025-02-08 08:19:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:19:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:19:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-02-08 08:19:11,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.592391304347826 [2025-02-08 08:19:11,914 INFO L175 Difference]: Start difference. First operand has 73 places, 47 transitions, 276 flow. Second operand 4 states and 109 transitions. [2025-02-08 08:19:11,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 102 transitions, 834 flow [2025-02-08 08:19:12,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 102 transitions, 784 flow, removed 25 selfloop flow, removed 10 redundant places. [2025-02-08 08:19:12,045 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 284 flow [2025-02-08 08:19:12,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2025-02-08 08:19:12,046 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2025-02-08 08:19:12,046 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 284 flow [2025-02-08 08:19:12,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:19:12,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:12,046 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] [2025-02-08 08:19:12,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:19:12,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:12,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1750212246, now seen corresponding path program 1 times [2025-02-08 08:19:12,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:12,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65319331] [2025-02-08 08:19:12,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:12,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:12,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:19:12,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:19:12,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:12,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:12,207 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-08 08:19:12,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:12,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65319331] [2025-02-08 08:19:12,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65319331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:12,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:12,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:19:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228794979] [2025-02-08 08:19:12,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:12,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:19:12,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:12,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:19:12,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:19:12,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:19:12,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-08 08:19:12,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:12,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:19:12,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:12,938 INFO L124 PetriNetUnfolderBase]: 7770/11752 cut-off events. [2025-02-08 08:19:12,938 INFO L125 PetriNetUnfolderBase]: For 15225/15225 co-relation queries the response was YES. [2025-02-08 08:19:12,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35488 conditions, 11752 events. 7770/11752 cut-off events. For 15225/15225 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 68964 event pairs, 3371 based on Foata normal form. 166/11915 useless extension candidates. Maximal degree in co-relation 35467. Up to 5988 conditions per place. [2025-02-08 08:19:12,997 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 61 selfloop transitions, 6 changer transitions 54/126 dead transitions. [2025-02-08 08:19:12,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 126 transitions, 830 flow [2025-02-08 08:19:12,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:19:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:19:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2025-02-08 08:19:12,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5248447204968945 [2025-02-08 08:19:12,999 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 284 flow. Second operand 7 states and 169 transitions. [2025-02-08 08:19:12,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 126 transitions, 830 flow [2025-02-08 08:19:13,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 126 transitions, 815 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 08:19:13,012 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 286 flow [2025-02-08 08:19:13,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=286, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2025-02-08 08:19:13,012 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2025-02-08 08:19:13,012 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 286 flow [2025-02-08 08:19:13,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-08 08:19:13,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:13,013 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] [2025-02-08 08:19:13,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:19:13,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:13,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:13,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1881285838, now seen corresponding path program 1 times [2025-02-08 08:19:13,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:13,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521330781] [2025-02-08 08:19:13,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:13,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:13,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:19:13,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:19:13,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:13,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:13,165 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-08 08:19:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521330781] [2025-02-08 08:19:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521330781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:19:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918501344] [2025-02-08 08:19:13,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:13,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:19:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:13,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:19:13,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:19:13,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:19:13,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-08 08:19:13,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:13,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:19:13,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:13,621 INFO L124 PetriNetUnfolderBase]: 3947/6180 cut-off events. [2025-02-08 08:19:13,622 INFO L125 PetriNetUnfolderBase]: For 10865/10865 co-relation queries the response was YES. [2025-02-08 08:19:13,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18371 conditions, 6180 events. 3947/6180 cut-off events. For 10865/10865 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 34018 event pairs, 613 based on Foata normal form. 368/6544 useless extension candidates. Maximal degree in co-relation 18346. Up to 2012 conditions per place. [2025-02-08 08:19:13,647 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 92 selfloop transitions, 8 changer transitions 10/115 dead transitions. [2025-02-08 08:19:13,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 115 transitions, 921 flow [2025-02-08 08:19:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:19:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:19:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-02-08 08:19:13,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6043478260869565 [2025-02-08 08:19:13,649 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 286 flow. Second operand 5 states and 139 transitions. [2025-02-08 08:19:13,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 115 transitions, 921 flow [2025-02-08 08:19:13,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 115 transitions, 862 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 08:19:13,660 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 299 flow [2025-02-08 08:19:13,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2025-02-08 08:19:13,662 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2025-02-08 08:19:13,662 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 299 flow [2025-02-08 08:19:13,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-08 08:19:13,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:13,663 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-08 08:19:13,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:19:13,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:13,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1827425361, now seen corresponding path program 1 times [2025-02-08 08:19:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:13,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015715523] [2025-02-08 08:19:13,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:13,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:19:13,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:19:13,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:13,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:13,894 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-08 08:19:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015715523] [2025-02-08 08:19:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015715523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:19:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056189183] [2025-02-08 08:19:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:13,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:19:13,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:13,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:19:13,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:19:13,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:19:13,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 299 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-08 08:19:13,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:13,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:19:13,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:14,200 INFO L124 PetriNetUnfolderBase]: 2359/3684 cut-off events. [2025-02-08 08:19:14,201 INFO L125 PetriNetUnfolderBase]: For 7088/7088 co-relation queries the response was YES. [2025-02-08 08:19:14,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11871 conditions, 3684 events. 2359/3684 cut-off events. For 7088/7088 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 18531 event pairs, 487 based on Foata normal form. 144/3824 useless extension candidates. Maximal degree in co-relation 11848. Up to 1304 conditions per place. [2025-02-08 08:19:14,213 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 74 selfloop transitions, 11 changer transitions 9/99 dead transitions. [2025-02-08 08:19:14,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 743 flow [2025-02-08 08:19:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:19:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:19:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2025-02-08 08:19:14,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5036231884057971 [2025-02-08 08:19:14,215 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 299 flow. Second operand 6 states and 139 transitions. [2025-02-08 08:19:14,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 743 flow [2025-02-08 08:19:14,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 99 transitions, 696 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 08:19:14,228 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 268 flow [2025-02-08 08:19:14,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2025-02-08 08:19:14,229 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2025-02-08 08:19:14,229 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 268 flow [2025-02-08 08:19:14,229 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-08 08:19:14,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:14,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:14,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:19:14,230 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:14,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash -671945168, now seen corresponding path program 1 times [2025-02-08 08:19:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:14,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026306358] [2025-02-08 08:19:14,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:14,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:19:14,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:19:14,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:14,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:14,403 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-08 08:19:14,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:14,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026306358] [2025-02-08 08:19:14,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026306358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:14,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:14,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:19:14,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287869410] [2025-02-08 08:19:14,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:14,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:19:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:14,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:19:14,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:19:14,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:19:14,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-08 08:19:14,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:14,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:19:14,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:14,646 INFO L124 PetriNetUnfolderBase]: 1399/2195 cut-off events. [2025-02-08 08:19:14,646 INFO L125 PetriNetUnfolderBase]: For 3462/3462 co-relation queries the response was YES. [2025-02-08 08:19:14,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7105 conditions, 2195 events. 1399/2195 cut-off events. For 3462/3462 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9480 event pairs, 254 based on Foata normal form. 8/2202 useless extension candidates. Maximal degree in co-relation 7083. Up to 1303 conditions per place. [2025-02-08 08:19:14,653 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 60 selfloop transitions, 12 changer transitions 18/95 dead transitions. [2025-02-08 08:19:14,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 95 transitions, 667 flow [2025-02-08 08:19:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:19:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:19:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2025-02-08 08:19:14,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-02-08 08:19:14,654 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 268 flow. Second operand 7 states and 138 transitions. [2025-02-08 08:19:14,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 95 transitions, 667 flow [2025-02-08 08:19:14,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 502 flow, removed 38 selfloop flow, removed 13 redundant places. [2025-02-08 08:19:14,661 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 267 flow [2025-02-08 08:19:14,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2025-02-08 08:19:14,663 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-02-08 08:19:14,663 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 267 flow [2025-02-08 08:19:14,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-08 08:19:14,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:14,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:14,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:19:14,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:14,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1775476288, now seen corresponding path program 2 times [2025-02-08 08:19:14,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:14,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936883378] [2025-02-08 08:19:14,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:19:14,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:14,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:19:14,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:19:14,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:19:14,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:14,811 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-08 08:19:14,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:14,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936883378] [2025-02-08 08:19:14,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936883378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:14,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:14,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:19:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554390780] [2025-02-08 08:19:14,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:19:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:14,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:19:14,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:19:14,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:19:14,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-08 08:19:14,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:14,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:19:14,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:15,056 INFO L124 PetriNetUnfolderBase]: 1787/2799 cut-off events. [2025-02-08 08:19:15,057 INFO L125 PetriNetUnfolderBase]: For 2984/2984 co-relation queries the response was YES. [2025-02-08 08:19:15,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7676 conditions, 2799 events. 1787/2799 cut-off events. For 2984/2984 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12884 event pairs, 543 based on Foata normal form. 8/2806 useless extension candidates. Maximal degree in co-relation 7659. Up to 1428 conditions per place. [2025-02-08 08:19:15,063 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 39 selfloop transitions, 1 changer transitions 47/92 dead transitions. [2025-02-08 08:19:15,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 92 transitions, 564 flow [2025-02-08 08:19:15,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:19:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:19:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-02-08 08:19:15,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4384057971014493 [2025-02-08 08:19:15,064 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 267 flow. Second operand 6 states and 121 transitions. [2025-02-08 08:19:15,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 92 transitions, 564 flow [2025-02-08 08:19:15,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 556 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-08 08:19:15,067 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 164 flow [2025-02-08 08:19:15,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=69, PETRI_TRANSITIONS=41} [2025-02-08 08:19:15,068 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2025-02-08 08:19:15,068 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 41 transitions, 164 flow [2025-02-08 08:19:15,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-08 08:19:15,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:15,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:15,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:19:15,068 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:15,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:15,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1808162468, now seen corresponding path program 3 times [2025-02-08 08:19:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:15,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824495657] [2025-02-08 08:19:15,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:19:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:15,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:19:15,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:19:15,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:19:15,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:15,361 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-08 08:19:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:19:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824495657] [2025-02-08 08:19:15,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824495657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:15,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:15,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:19:15,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178655299] [2025-02-08 08:19:15,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:15,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:19:15,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:19:15,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:19:15,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:19:15,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:19:15,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 41 transitions, 164 flow. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-08 08:19:15,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:15,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:19:15,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:15,580 INFO L124 PetriNetUnfolderBase]: 724/1198 cut-off events. [2025-02-08 08:19:15,580 INFO L125 PetriNetUnfolderBase]: For 1196/1196 co-relation queries the response was YES. [2025-02-08 08:19:15,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3098 conditions, 1198 events. 724/1198 cut-off events. For 1196/1196 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4843 event pairs, 212 based on Foata normal form. 8/1206 useless extension candidates. Maximal degree in co-relation 3079. Up to 560 conditions per place. [2025-02-08 08:19:15,583 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 38 selfloop transitions, 2 changer transitions 42/87 dead transitions. [2025-02-08 08:19:15,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 488 flow [2025-02-08 08:19:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:19:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:19:15,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2025-02-08 08:19:15,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38315217391304346 [2025-02-08 08:19:15,584 INFO L175 Difference]: Start difference. First operand has 69 places, 41 transitions, 164 flow. Second operand 8 states and 141 transitions. [2025-02-08 08:19:15,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 488 flow [2025-02-08 08:19:15,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 420 flow, removed 11 selfloop flow, removed 14 redundant places. [2025-02-08 08:19:15,585 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 142 flow [2025-02-08 08:19:15,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=8, PETRI_FLOW=142, PETRI_PLACES=64, PETRI_TRANSITIONS=41} [2025-02-08 08:19:15,585 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2025-02-08 08:19:15,585 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 142 flow [2025-02-08 08:19:15,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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-08 08:19:15,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:15,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:15,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:19:15,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:15,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:15,586 INFO L85 PathProgramCache]: Analyzing trace with hash 945517006, now seen corresponding path program 4 times [2025-02-08 08:19:15,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:19:15,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101363742] [2025-02-08 08:19:15,586 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:19:15,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:19:15,592 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-08 08:19:15,615 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:19:15,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:19:15,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:19:15,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:19:15,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:19:15,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:19:15,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:15,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:19:15,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:19:15,659 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:19:15,660 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-08 08:19:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:19:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:19:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:19:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-08 08:19:15,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-08 08:19:15,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:19:15,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:19:15,662 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:15,722 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:19:15,722 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:19:15,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:19:15 BasicIcfg [2025-02-08 08:19:15,730 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:19:15,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:19:15,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:19:15,730 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:19:15,731 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:19:03" (3/4) ... [2025-02-08 08:19:15,732 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:19:15,733 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:19:15,734 INFO L158 Benchmark]: Toolchain (without parser) took 12852.16ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 121.4MB in the beginning and 1.1GB in the end (delta: -967.9MB). Peak memory consumption was 364.2MB. Max. memory is 16.1GB. [2025-02-08 08:19:15,734 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:19:15,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.17ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 98.4MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:19:15,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.65ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 96.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:19:15,735 INFO L158 Benchmark]: Boogie Preprocessor took 30.75ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 93.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:19:15,735 INFO L158 Benchmark]: IcfgBuilder took 535.74ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 47.1MB in the end (delta: 46.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 08:19:15,735 INFO L158 Benchmark]: TraceAbstraction took 11848.06ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 46.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 288.7MB. Max. memory is 16.1GB. [2025-02-08 08:19:15,735 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 207.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:19:15,736 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.28ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.17ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 98.4MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.65ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 96.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.75ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 93.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 535.74ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 47.1MB in the end (delta: 46.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11848.06ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 46.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 288.7MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 207.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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-2, t1005=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-2, t1005=-1, t1006=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-2, t1005=-1, t1006=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-2, t1005=-1, t1006=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-2, t1005=-1, t1006=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix038.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 838]: 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, 72 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: 11.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 733 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 728 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2226 IncrementalHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 3 mSDtfsCounter, 2226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=8, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 1200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 08:19:15,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix038.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:19:17,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:19:17,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:19:18,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:19:18,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:19:18,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:19:18,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:19:18,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:19:18,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:19:18,057 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:19:18,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:19:18,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:19:18,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:19:18,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:19:18,059 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:19:18,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:19:18,060 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:19:18,061 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:19:18,061 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:19:18,061 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:19:18,061 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:19:18,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:19:18,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:19:18,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:19:18,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:19:18,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:19:18,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:19:18,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:19:18,062 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:19:18,062 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:19:18,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:19:18,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:19:18,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:19:18,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:19:18,063 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a [2025-02-08 08:19:18,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:19:18,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:19:18,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:19:18,311 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:19:18,311 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:19:18,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix038.opt.i [2025-02-08 08:19:19,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccac7ee86/d241b00829fc47129b3efaf4ba6ede5b/FLAG5edbfbddc [2025-02-08 08:19:19,896 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:19:19,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2025-02-08 08:19:19,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccac7ee86/d241b00829fc47129b3efaf4ba6ede5b/FLAG5edbfbddc [2025-02-08 08:19:19,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccac7ee86/d241b00829fc47129b3efaf4ba6ede5b [2025-02-08 08:19:19,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:19:19,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:19:19,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:19:19,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:19:19,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:19:19,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:19:19" (1/1) ... [2025-02-08 08:19:19,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c91dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:19, skipping insertion in model container [2025-02-08 08:19:19,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:19:19" (1/1) ... [2025-02-08 08:19:19,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:19:20,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:19:20,212 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:19:20,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:19:20,281 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:19:20,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20 WrapperNode [2025-02-08 08:19:20,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:19:20,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:19:20,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:19:20,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:19:20,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,334 INFO L138 Inliner]: procedures = 176, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2025-02-08 08:19:20,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:19:20,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:19:20,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:19:20,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:19:20,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,365 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-08 08:19:20,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:19:20,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:19:20,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:19:20,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:19:20,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (1/1) ... [2025-02-08 08:19:20,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:19:20,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:19:20,413 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-08 08:19:20,417 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-08 08:19:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:19:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:19:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:19:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:19:20,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:19:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:19:20,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:19:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:19:20,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:19:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:19:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:19:20,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:19:20,441 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:19:20,533 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:19:20,535 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:19:20,803 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:19:20,803 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:19:20,993 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:19:20,993 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:19:20,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:19:20 BoogieIcfgContainer [2025-02-08 08:19:20,994 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:19:20,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:19:20,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:19:21,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:19:21,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:19:19" (1/3) ... [2025-02-08 08:19:21,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46545d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:19:21, skipping insertion in model container [2025-02-08 08:19:21,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:19:20" (2/3) ... [2025-02-08 08:19:21,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46545d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:19:21, skipping insertion in model container [2025-02-08 08:19:21,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:19:20" (3/3) ... [2025-02-08 08:19:21,004 INFO L128 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2025-02-08 08:19:21,015 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:19:21,016 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix038.opt.i that has 4 procedures, 45 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:19:21,016 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:19:21,060 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:19:21,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 104 flow [2025-02-08 08:19:21,133 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2025-02-08 08:19:21,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:19:21,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 2/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-08 08:19:21,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 46 transitions, 104 flow [2025-02-08 08:19:21,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 43 transitions, 95 flow [2025-02-08 08:19:21,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:19:21,159 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;@2236e8b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:19:21,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:19:21,164 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:19:21,165 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-02-08 08:19:21,165 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:19:21,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:21,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:21,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:21,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1676848747, now seen corresponding path program 1 times [2025-02-08 08:19:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:19:21,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135753176] [2025-02-08 08:19:21,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:21,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:19:21,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:19:21,184 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-08 08:19:21,185 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-08 08:19:21,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:19:21,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:19:21,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:21,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:21,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:19:21,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:19:21,301 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-08 08:19:21,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:19:21,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:19:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135753176] [2025-02-08 08:19:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135753176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:21,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:19:21,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623338030] [2025-02-08 08:19:21,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:21,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:19:21,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:19:21,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:19:21,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:19:21,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:19:21,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:19:21,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:21,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:19:21,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:22,239 INFO L124 PetriNetUnfolderBase]: 7163/10281 cut-off events. [2025-02-08 08:19:22,239 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 08:19:22,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20500 conditions, 10281 events. 7163/10281 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 56491 event pairs, 695 based on Foata normal form. 576/10852 useless extension candidates. Maximal degree in co-relation 20489. Up to 8989 conditions per place. [2025-02-08 08:19:22,291 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-02-08 08:19:22,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 227 flow [2025-02-08 08:19:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:19:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:19:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-08 08:19:22,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2025-02-08 08:19:22,300 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 95 flow. Second operand 3 states and 86 transitions. [2025-02-08 08:19:22,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 227 flow [2025-02-08 08:19:22,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:19:22,305 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 86 flow [2025-02-08 08:19:22,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-02-08 08:19:22,309 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2025-02-08 08:19:22,309 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 86 flow [2025-02-08 08:19:22,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:19:22,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:22,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:22,321 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-08 08:19:22,510 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-08 08:19:22,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:22,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:22,511 INFO L85 PathProgramCache]: Analyzing trace with hash -533162965, now seen corresponding path program 1 times [2025-02-08 08:19:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:19:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718513176] [2025-02-08 08:19:22,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:22,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:19:22,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:19:22,516 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-08 08:19:22,517 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-08 08:19:22,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:19:22,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:19:22,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:22,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:22,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:19:22,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:19:22,613 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-08 08:19:22,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:19:22,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:19:22,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718513176] [2025-02-08 08:19:22,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718513176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:22,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:22,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:19:22,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070579017] [2025-02-08 08:19:22,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:22,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:19:22,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:19:22,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:19:22,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:19:22,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2025-02-08 08:19:22,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 86 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-08 08:19:22,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:22,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2025-02-08 08:19:22,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:23,344 INFO L124 PetriNetUnfolderBase]: 6431/9837 cut-off events. [2025-02-08 08:19:23,345 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2025-02-08 08:19:23,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19359 conditions, 9837 events. 6431/9837 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 58617 event pairs, 6431 based on Foata normal form. 288/10084 useless extension candidates. Maximal degree in co-relation 19349. Up to 9108 conditions per place. [2025-02-08 08:19:23,388 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 29 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2025-02-08 08:19:23,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 146 flow [2025-02-08 08:19:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:19:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:19:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-02-08 08:19:23,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2025-02-08 08:19:23,390 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 86 flow. Second operand 3 states and 59 transitions. [2025-02-08 08:19:23,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 146 flow [2025-02-08 08:19:23,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:19:23,392 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2025-02-08 08:19:23,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-08 08:19:23,393 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-02-08 08:19:23,393 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 80 flow [2025-02-08 08:19:23,393 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-08 08:19:23,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:23,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:23,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:19:23,594 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-08 08:19:23,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:23,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:23,596 INFO L85 PathProgramCache]: Analyzing trace with hash -533161656, now seen corresponding path program 1 times [2025-02-08 08:19:23,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:19:23,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910898907] [2025-02-08 08:19:23,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:23,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:19:23,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:19:23,600 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-08 08:19:23,601 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-08 08:19:23,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:19:23,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:19:23,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:23,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:23,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:19:23,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:19:23,702 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-08 08:19:23,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:19:23,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:19:23,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910898907] [2025-02-08 08:19:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910898907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:23,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:19:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100215917] [2025-02-08 08:19:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:23,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:19:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:19:23,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:19:23,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:19:23,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:19:23,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 80 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-08 08:19:23,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:23,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:19:23,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:24,212 INFO L124 PetriNetUnfolderBase]: 4511/7197 cut-off events. [2025-02-08 08:19:24,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:19:24,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13899 conditions, 7197 events. 4511/7197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 43568 event pairs, 755 based on Foata normal form. 288/7480 useless extension candidates. Maximal degree in co-relation 13893. Up to 3817 conditions per place. [2025-02-08 08:19:24,241 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 61 selfloop transitions, 5 changer transitions 1/73 dead transitions. [2025-02-08 08:19:24,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 73 transitions, 292 flow [2025-02-08 08:19:24,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:19:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:19:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-02-08 08:19:24,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.592391304347826 [2025-02-08 08:19:24,243 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 80 flow. Second operand 4 states and 109 transitions. [2025-02-08 08:19:24,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 73 transitions, 292 flow [2025-02-08 08:19:24,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:19:24,244 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 113 flow [2025-02-08 08:19:24,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-02-08 08:19:24,245 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2025-02-08 08:19:24,245 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 113 flow [2025-02-08 08:19:24,245 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-08 08:19:24,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:24,245 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-08 08:19:24,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:19:24,451 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-08 08:19:24,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:24,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash -117670227, now seen corresponding path program 1 times [2025-02-08 08:19:24,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:19:24,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262497497] [2025-02-08 08:19:24,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:24,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:19:24,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:19:24,455 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-08 08:19:24,457 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-08 08:19:24,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:19:24,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:19:24,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:24,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:24,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:19:24,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:19:24,554 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-08 08:19:24,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:19:24,554 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:19:24,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262497497] [2025-02-08 08:19:24,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262497497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:24,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:19:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393450884] [2025-02-08 08:19:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:24,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:19:24,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:19:24,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:19:24,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:19:24,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:19:24,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 113 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-08 08:19:24,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:24,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:19:24,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:24,889 INFO L124 PetriNetUnfolderBase]: 2431/3869 cut-off events. [2025-02-08 08:19:24,889 INFO L125 PetriNetUnfolderBase]: For 804/804 co-relation queries the response was YES. [2025-02-08 08:19:24,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8718 conditions, 3869 events. 2431/3869 cut-off events. For 804/804 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 19996 event pairs, 483 based on Foata normal form. 192/4056 useless extension candidates. Maximal degree in co-relation 8709. Up to 1272 conditions per place. [2025-02-08 08:19:24,904 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 78 selfloop transitions, 8 changer transitions 1/93 dead transitions. [2025-02-08 08:19:24,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 93 transitions, 416 flow [2025-02-08 08:19:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:19:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:19:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-02-08 08:19:24,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6043478260869565 [2025-02-08 08:19:24,906 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 113 flow. Second operand 5 states and 139 transitions. [2025-02-08 08:19:24,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 93 transitions, 416 flow [2025-02-08 08:19:24,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 406 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:19:24,909 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 153 flow [2025-02-08 08:19:24,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2025-02-08 08:19:24,910 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2025-02-08 08:19:24,910 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 153 flow [2025-02-08 08:19:24,910 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-08 08:19:24,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:24,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:24,917 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-08 08:19:25,111 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-08 08:19:25,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:25,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:25,116 INFO L85 PathProgramCache]: Analyzing trace with hash 243567228, now seen corresponding path program 1 times [2025-02-08 08:19:25,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:19:25,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40305920] [2025-02-08 08:19:25,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:25,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:19:25,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:19:25,119 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-08 08:19:25,121 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-08 08:19:25,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:19:25,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:19:25,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:25,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:25,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:19:25,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:19:25,256 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-08 08:19:25,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:19:25,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:19:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40305920] [2025-02-08 08:19:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40305920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:19:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93739685] [2025-02-08 08:19:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:25,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:19:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:19:25,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:19:25,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:19:25,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:19:25,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-08 08:19:25,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:25,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:19:25,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:25,549 INFO L124 PetriNetUnfolderBase]: 1495/2301 cut-off events. [2025-02-08 08:19:25,550 INFO L125 PetriNetUnfolderBase]: For 1478/1478 co-relation queries the response was YES. [2025-02-08 08:19:25,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 2301 events. 1495/2301 cut-off events. For 1478/1478 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10357 event pairs, 435 based on Foata normal form. 64/2360 useless extension candidates. Maximal degree in co-relation 5675. Up to 880 conditions per place. [2025-02-08 08:19:25,557 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 65 selfloop transitions, 11 changer transitions 1/83 dead transitions. [2025-02-08 08:19:25,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 399 flow [2025-02-08 08:19:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:19:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:19:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2025-02-08 08:19:25,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5036231884057971 [2025-02-08 08:19:25,560 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 153 flow. Second operand 6 states and 139 transitions. [2025-02-08 08:19:25,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 399 flow [2025-02-08 08:19:25,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 374 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 08:19:25,566 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 167 flow [2025-02-08 08:19:25,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-02-08 08:19:25,567 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2025-02-08 08:19:25,567 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 167 flow [2025-02-08 08:19:25,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-08 08:19:25,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:25,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:25,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:19:25,771 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-08 08:19:25,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:25,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -389189870, now seen corresponding path program 1 times [2025-02-08 08:19:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:19:25,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267141575] [2025-02-08 08:19:25,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:19:25,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:19:25,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:19:25,774 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-08 08:19:25,776 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-08 08:19:25,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:19:25,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:19:25,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:25,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:25,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:19:25,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:19:26,008 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-08 08:19:26,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:19:26,008 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:19:26,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267141575] [2025-02-08 08:19:26,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267141575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:26,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:26,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:19:26,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142184263] [2025-02-08 08:19:26,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:26,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:19:26,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:19:26,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:19:26,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:19:26,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:19:26,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:19:26,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:26,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:19:26,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:26,423 INFO L124 PetriNetUnfolderBase]: 1891/2916 cut-off events. [2025-02-08 08:19:26,423 INFO L125 PetriNetUnfolderBase]: For 1964/1964 co-relation queries the response was YES. [2025-02-08 08:19:26,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7350 conditions, 2916 events. 1891/2916 cut-off events. For 1964/1964 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13908 event pairs, 259 based on Foata normal form. 8/2922 useless extension candidates. Maximal degree in co-relation 7338. Up to 1449 conditions per place. [2025-02-08 08:19:26,433 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 59 selfloop transitions, 7 changer transitions 41/113 dead transitions. [2025-02-08 08:19:26,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 113 transitions, 615 flow [2025-02-08 08:19:26,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:19:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:19:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2025-02-08 08:19:26,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.463768115942029 [2025-02-08 08:19:26,435 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 167 flow. Second operand 9 states and 192 transitions. [2025-02-08 08:19:26,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 113 transitions, 615 flow [2025-02-08 08:19:26,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 498 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-08 08:19:26,446 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 155 flow [2025-02-08 08:19:26,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=155, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2025-02-08 08:19:26,447 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2025-02-08 08:19:26,447 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 155 flow [2025-02-08 08:19:26,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:19:26,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:26,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:26,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:19:26,648 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-08 08:19:26,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:26,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash 247225062, now seen corresponding path program 2 times [2025-02-08 08:19:26,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:19:26,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118136629] [2025-02-08 08:19:26,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:19:26,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:19:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:19:26,653 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-08 08:19:26,658 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-08 08:19:26,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:19:26,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:19:26,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:19:26,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:19:26,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:19:26,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:19:26,807 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-08 08:19:26,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:19:26,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:19:26,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118136629] [2025-02-08 08:19:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118136629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:19:26,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:19:26,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:19:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379398294] [2025-02-08 08:19:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:19:26,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:19:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:19:26,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:19:26,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:19:26,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2025-02-08 08:19:26,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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-08 08:19:26,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:19:26,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2025-02-08 08:19:26,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:19:27,140 INFO L124 PetriNetUnfolderBase]: 2081/3231 cut-off events. [2025-02-08 08:19:27,141 INFO L125 PetriNetUnfolderBase]: For 852/852 co-relation queries the response was YES. [2025-02-08 08:19:27,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7807 conditions, 3231 events. 2081/3231 cut-off events. For 852/852 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15884 event pairs, 471 based on Foata normal form. 8/3236 useless extension candidates. Maximal degree in co-relation 7793. Up to 1289 conditions per place. [2025-02-08 08:19:27,175 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 67 selfloop transitions, 11 changer transitions 27/111 dead transitions. [2025-02-08 08:19:27,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 111 transitions, 545 flow [2025-02-08 08:19:27,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:19:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:19:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2025-02-08 08:19:27,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.483695652173913 [2025-02-08 08:19:27,180 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 155 flow. Second operand 8 states and 178 transitions. [2025-02-08 08:19:27,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 111 transitions, 545 flow [2025-02-08 08:19:27,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 513 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-08 08:19:27,182 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 178 flow [2025-02-08 08:19:27,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2025-02-08 08:19:27,183 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2025-02-08 08:19:27,183 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 178 flow [2025-02-08 08:19:27,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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-08 08:19:27,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:19:27,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:19:27,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 08:19:27,384 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-08 08:19:27,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:19:27,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:19:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1845599640, now seen corresponding path program 3 times [2025-02-08 08:19:27,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:19:27,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452867537] [2025-02-08 08:19:27,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:19:27,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:19:27,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:19:27,388 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-08 08:19:27,389 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-08 08:19:27,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:19:27,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:19:27,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:19:27,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:19:27,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:19:27,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 08:19:27,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 08:19:27,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:19:27,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:19:27,513 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:19:27,514 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:19:27,514 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-08 08:19:27,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:19:27,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:19:27,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:19:27,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-08 08:19:27,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-08 08:19:27,516 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:19:27,522 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-08 08:19:27,716 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-08 08:19:27,717 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-02-08 08:19:27,767 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:19:27,768 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:19:27,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:19:27 BasicIcfg [2025-02-08 08:19:27,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:19:27,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:19:27,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:19:27,772 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:19:27,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:19:20" (3/4) ... [2025-02-08 08:19:27,773 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:19:27,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:19:27,774 INFO L158 Benchmark]: Toolchain (without parser) took 7846.66ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 114.5MB in the beginning and 507.7MB in the end (delta: -393.2MB). Peak memory consumption was 148.4MB. Max. memory is 16.1GB. [2025-02-08 08:19:27,774 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:19:27,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.20ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 91.5MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:19:27,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.75ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:19:27,775 INFO L158 Benchmark]: Boogie Preprocessor took 43.13ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 86.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:19:27,775 INFO L158 Benchmark]: IcfgBuilder took 615.79ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 92.6MB in the end (delta: -6.8MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2025-02-08 08:19:27,775 INFO L158 Benchmark]: TraceAbstraction took 6775.16ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 92.6MB in the beginning and 508.0MB in the end (delta: -415.4MB). Peak memory consumption was 117.5MB. Max. memory is 16.1GB. [2025-02-08 08:19:27,776 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 679.5MB. Free memory was 508.0MB in the beginning and 507.7MB in the end (delta: 319.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:19:27,776 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.49ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.20ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 91.5MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.75ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.13ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 86.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 615.79ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 92.6MB in the end (delta: -6.8MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6775.16ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 92.6MB in the beginning and 508.0MB in the end (delta: -415.4MB). Peak memory consumption was 117.5MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 679.5MB. Free memory was 508.0MB in the beginning and 507.7MB in the end (delta: 319.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-2, t1005=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-2, t1005=-1, t1006=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-2, t1005=-1, t1006=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-2, t1005=-1, t1006=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-2, t1005=-1, t1006=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix038.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 834]: 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, 72 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: 6.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1248 IncrementalHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 0 mSDtfsCounter, 1248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 472 SizeOfPredicates, 18 NumberOfNonLiveVariables, 675 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 08:19:27,792 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