./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.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 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:46:53,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:46:53,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:46:53,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:46:53,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:46:54,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:46:54,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:46:54,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:46:54,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:46:54,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:46:54,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:46:54,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:46:54,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:46:54,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:46:54,006 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:46:54,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:46:54,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:46:54,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:46:54,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:46:54,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:46:54,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:46:54,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:46:54,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:46:54,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:46:54,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:46:54,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:46:54,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:46:54,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:46:54,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:46:54,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:46:54,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:46:54,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:46:54,008 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2025-02-06 12:46:54,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:46:54,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:46:54,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:46:54,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:46:54,224 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:46:54,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-02-06 12:46:55,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04870635d/6584fe5a664648bfbe376fb5c9645c88/FLAG0ab642ddd [2025-02-06 12:46:55,933 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:46:55,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-02-06 12:46:55,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04870635d/6584fe5a664648bfbe376fb5c9645c88/FLAG0ab642ddd [2025-02-06 12:46:56,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04870635d/6584fe5a664648bfbe376fb5c9645c88 [2025-02-06 12:46:56,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:46:56,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:46:56,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:46:56,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:46:56,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:46:56,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e194ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56, skipping insertion in model container [2025-02-06 12:46:56,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:46:56,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:46:56,548 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:46:56,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:46:56,627 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:46:56,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56 WrapperNode [2025-02-06 12:46:56,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:46:56,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:46:56,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:46:56,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:46:56,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,677 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2025-02-06 12:46:56,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:46:56,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:46:56,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:46:56,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:46:56,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,706 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:46:56,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,714 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:46:56,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:46:56,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:46:56,728 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:46:56,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (1/1) ... [2025-02-06 12:46:56,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:46:56,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:46:56,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:46:56,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:46:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:46:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:46:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:46:56,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:46:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:46:56,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:46:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:46:56,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:46:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:46:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:46:56,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:46:56,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:46:56,785 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:46:56,907 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:46:56,910 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:46:57,152 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:46:57,152 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:46:57,308 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:46:57,308 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:46:57,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:57 BoogieIcfgContainer [2025-02-06 12:46:57,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:46:57,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:46:57,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:46:57,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:46:57,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:46:56" (1/3) ... [2025-02-06 12:46:57,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70226447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:46:57, skipping insertion in model container [2025-02-06 12:46:57,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:46:56" (2/3) ... [2025-02-06 12:46:57,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70226447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:46:57, skipping insertion in model container [2025-02-06 12:46:57,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:57" (3/3) ... [2025-02-06 12:46:57,315 INFO L128 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-02-06 12:46:57,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:46:57,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:46:57,327 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:46:57,367 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:46:57,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2025-02-06 12:46:57,417 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-02-06 12:46:57,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:57,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-02-06 12:46:57,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2025-02-06 12:46:57,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2025-02-06 12:46:57,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:46:57,445 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;@4b91f4fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:46:57,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:46:57,451 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:46:57,451 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 12:46:57,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:46:57,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:57,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:46:57,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:46:57,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1899898102, now seen corresponding path program 1 times [2025-02-06 12:46:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:57,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889697603] [2025-02-06 12:46:57,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:57,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:46:57,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:46:57,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:57,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:57,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889697603] [2025-02-06 12:46:57,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889697603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:57,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:57,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:46:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735165532] [2025-02-06 12:46:57,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:57,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:46:57,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:57,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:46:57,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:46:57,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:46:57,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:46:57,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:57,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:46:57,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:58,979 INFO L124 PetriNetUnfolderBase]: 5315/7699 cut-off events. [2025-02-06 12:46:58,980 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-06 12:46:58,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15350 conditions, 7699 events. 5315/7699 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 42874 event pairs, 585 based on Foata normal form. 432/8119 useless extension candidates. Maximal degree in co-relation 15339. Up to 6591 conditions per place. [2025-02-06 12:46:59,036 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-02-06 12:46:59,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 230 flow [2025-02-06 12:46:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:46:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:46:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-06 12:46:59,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-02-06 12:46:59,050 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 86 transitions. [2025-02-06 12:46:59,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 230 flow [2025-02-06 12:46:59,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:46:59,059 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-02-06 12:46:59,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-06 12:46:59,066 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-02-06 12:46:59,066 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-02-06 12:46:59,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:46:59,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:59,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:59,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:46:59,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:46:59,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1289871428, now seen corresponding path program 1 times [2025-02-06 12:46:59,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:59,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207485858] [2025-02-06 12:46:59,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:59,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:59,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:46:59,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:46:59,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:59,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:46:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:46:59,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:46:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207485858] [2025-02-06 12:46:59,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207485858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:46:59,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:46:59,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:46:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666407497] [2025-02-06 12:46:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:46:59,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:46:59,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:46:59,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:46:59,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:46:59,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:46:59,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:46:59,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:46:59,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:46:59,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:46:59,843 INFO L124 PetriNetUnfolderBase]: 4775/7427 cut-off events. [2025-02-06 12:46:59,844 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-02-06 12:46:59,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14657 conditions, 7427 events. 4775/7427 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43867 event pairs, 4775 based on Foata normal form. 216/7592 useless extension candidates. Maximal degree in co-relation 14647. Up to 6804 conditions per place. [2025-02-06 12:46:59,876 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-02-06 12:46:59,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 138 flow [2025-02-06 12:46:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:46:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:46:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-06 12:46:59,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-02-06 12:46:59,878 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 57 transitions. [2025-02-06 12:46:59,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 138 flow [2025-02-06 12:46:59,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:46:59,880 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-02-06 12:46:59,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-02-06 12:46:59,881 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-02-06 12:46:59,882 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-02-06 12:46:59,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:46:59,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:46:59,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:46:59,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:46:59,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:46:59,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:46:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1289870955, now seen corresponding path program 1 times [2025-02-06 12:46:59,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:46:59,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562401806] [2025-02-06 12:46:59,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:46:59,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:46:59,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:46:59,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:46:59,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:46:59,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:00,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:00,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562401806] [2025-02-06 12:47:00,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562401806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:00,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:00,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:47:00,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000870968] [2025-02-06 12:47:00,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:00,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:47:00,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:00,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:47:00,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:47:00,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:47:00,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:00,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:00,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:47:00,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:00,969 INFO L124 PetriNetUnfolderBase]: 5831/8728 cut-off events. [2025-02-06 12:47:00,969 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:00,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17182 conditions, 8728 events. 5831/8728 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 51436 event pairs, 707 based on Foata normal form. 0/8545 useless extension candidates. Maximal degree in co-relation 17176. Up to 5183 conditions per place. [2025-02-06 12:47:01,004 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 2 changer transitions 70/121 dead transitions. [2025-02-06 12:47:01,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 121 transitions, 486 flow [2025-02-06 12:47:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:47:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:47:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2025-02-06 12:47:01,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5397727272727273 [2025-02-06 12:47:01,006 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 8 states and 190 transitions. [2025-02-06 12:47:01,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 121 transitions, 486 flow [2025-02-06 12:47:01,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 121 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:47:01,010 INFO L231 Difference]: Finished difference. Result has 54 places, 33 transitions, 89 flow [2025-02-06 12:47:01,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=89, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2025-02-06 12:47:01,010 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-02-06 12:47:01,011 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 89 flow [2025-02-06 12:47:01,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:01,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:01,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:01,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:47:01,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:01,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1605009780, now seen corresponding path program 1 times [2025-02-06 12:47:01,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:01,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170484190] [2025-02-06 12:47:01,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:01,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:01,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:47:01,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:47:01,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:01,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170484190] [2025-02-06 12:47:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170484190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:01,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:01,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:47:01,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14292558] [2025-02-06 12:47:01,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:01,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:47:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:01,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:47:01,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:47:01,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:47:01,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 89 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-06 12:47:01,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:01,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:47:01,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:02,691 INFO L124 PetriNetUnfolderBase]: 7204/10784 cut-off events. [2025-02-06 12:47:02,692 INFO L125 PetriNetUnfolderBase]: For 2594/2594 co-relation queries the response was YES. [2025-02-06 12:47:02,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23845 conditions, 10784 events. 7204/10784 cut-off events. For 2594/2594 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 63042 event pairs, 626 based on Foata normal form. 292/11065 useless extension candidates. Maximal degree in co-relation 23833. Up to 4949 conditions per place. [2025-02-06 12:47:02,748 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 56 selfloop transitions, 8 changer transitions 73/142 dead transitions. [2025-02-06 12:47:02,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 142 transitions, 615 flow [2025-02-06 12:47:02,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:47:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:47:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2025-02-06 12:47:02,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-02-06 12:47:02,755 INFO L175 Difference]: Start difference. First operand has 54 places, 33 transitions, 89 flow. Second operand 10 states and 230 transitions. [2025-02-06 12:47:02,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 142 transitions, 615 flow [2025-02-06 12:47:02,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 142 transitions, 579 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-02-06 12:47:02,880 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 154 flow [2025-02-06 12:47:02,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=154, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-02-06 12:47:02,881 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2025-02-06 12:47:02,881 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 154 flow [2025-02-06 12:47:02,881 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-06 12:47:02,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:02,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:02,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:47:02,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:02,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2137348350, now seen corresponding path program 1 times [2025-02-06 12:47:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:02,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391311532] [2025-02-06 12:47:02,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:02,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:02,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:47:02,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:47:02,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:02,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:03,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391311532] [2025-02-06 12:47:03,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391311532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:03,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:03,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:47:03,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762076163] [2025-02-06 12:47:03,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:03,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:47:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:03,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:47:03,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:47:03,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:47:03,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:03,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:03,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:47:03,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:04,329 INFO L124 PetriNetUnfolderBase]: 9825/14609 cut-off events. [2025-02-06 12:47:04,329 INFO L125 PetriNetUnfolderBase]: For 11881/11881 co-relation queries the response was YES. [2025-02-06 12:47:04,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37874 conditions, 14609 events. 9825/14609 cut-off events. For 11881/11881 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 87458 event pairs, 2047 based on Foata normal form. 248/14846 useless extension candidates. Maximal degree in co-relation 37857. Up to 5248 conditions per place. [2025-02-06 12:47:04,368 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 63 selfloop transitions, 9 changer transitions 46/123 dead transitions. [2025-02-06 12:47:04,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 123 transitions, 673 flow [2025-02-06 12:47:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:47:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:47:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-02-06 12:47:04,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2025-02-06 12:47:04,372 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 154 flow. Second operand 7 states and 174 transitions. [2025-02-06 12:47:04,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 123 transitions, 673 flow [2025-02-06 12:47:04,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 653 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:04,390 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 201 flow [2025-02-06 12:47:04,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2025-02-06 12:47:04,391 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2025-02-06 12:47:04,391 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 201 flow [2025-02-06 12:47:04,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:04,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:04,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:04,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:47:04,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:04,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:04,392 INFO L85 PathProgramCache]: Analyzing trace with hash -427897081, now seen corresponding path program 1 times [2025-02-06 12:47:04,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:04,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038350817] [2025-02-06 12:47:04,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:04,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:04,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:47:04,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:47:04,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:04,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:04,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:04,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038350817] [2025-02-06 12:47:04,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038350817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:04,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:04,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:47:04,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163113358] [2025-02-06 12:47:04,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:04,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:47:04,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:04,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:47:04,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:47:04,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:47:04,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:04,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:04,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:47:04,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:05,677 INFO L124 PetriNetUnfolderBase]: 7024/10515 cut-off events. [2025-02-06 12:47:05,677 INFO L125 PetriNetUnfolderBase]: For 12212/12212 co-relation queries the response was YES. [2025-02-06 12:47:05,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28438 conditions, 10515 events. 7024/10515 cut-off events. For 12212/12212 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 61276 event pairs, 1582 based on Foata normal form. 220/10733 useless extension candidates. Maximal degree in co-relation 28416. Up to 5259 conditions per place. [2025-02-06 12:47:05,723 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 52 selfloop transitions, 7 changer transitions 52/116 dead transitions. [2025-02-06 12:47:05,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 116 transitions, 687 flow [2025-02-06 12:47:05,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:47:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:47:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2025-02-06 12:47:05,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-06 12:47:05,724 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 201 flow. Second operand 8 states and 176 transitions. [2025-02-06 12:47:05,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 116 transitions, 687 flow [2025-02-06 12:47:05,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 116 transitions, 649 flow, removed 14 selfloop flow, removed 7 redundant places. [2025-02-06 12:47:05,773 INFO L231 Difference]: Finished difference. Result has 66 places, 40 transitions, 200 flow [2025-02-06 12:47:05,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=200, PETRI_PLACES=66, PETRI_TRANSITIONS=40} [2025-02-06 12:47:05,774 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2025-02-06 12:47:05,774 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 40 transitions, 200 flow [2025-02-06 12:47:05,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:05,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:05,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:05,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:47:05,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:05,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash -755118176, now seen corresponding path program 2 times [2025-02-06 12:47:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:05,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2425982] [2025-02-06 12:47:05,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:47:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:05,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:47:05,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:47:05,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:47:05,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:05,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2425982] [2025-02-06 12:47:05,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2425982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:05,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:05,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:47:05,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487387516] [2025-02-06 12:47:05,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:05,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:47:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:05,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:47:05,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:47:05,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:47:05,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 40 transitions, 200 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:05,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:05,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:47:05,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:06,821 INFO L124 PetriNetUnfolderBase]: 6942/10329 cut-off events. [2025-02-06 12:47:06,821 INFO L125 PetriNetUnfolderBase]: For 11787/11787 co-relation queries the response was YES. [2025-02-06 12:47:06,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27530 conditions, 10329 events. 6942/10329 cut-off events. For 11787/11787 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 58828 event pairs, 2277 based on Foata normal form. 264/10591 useless extension candidates. Maximal degree in co-relation 27508. Up to 5350 conditions per place. [2025-02-06 12:47:06,864 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 53 selfloop transitions, 8 changer transitions 39/105 dead transitions. [2025-02-06 12:47:06,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 105 transitions, 638 flow [2025-02-06 12:47:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:47:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:47:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-02-06 12:47:06,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5097402597402597 [2025-02-06 12:47:06,870 INFO L175 Difference]: Start difference. First operand has 66 places, 40 transitions, 200 flow. Second operand 7 states and 157 transitions. [2025-02-06 12:47:06,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 105 transitions, 638 flow [2025-02-06 12:47:06,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 105 transitions, 609 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 12:47:06,921 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 205 flow [2025-02-06 12:47:06,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2025-02-06 12:47:06,923 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2025-02-06 12:47:06,924 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 205 flow [2025-02-06 12:47:06,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:06,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:06,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:06,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:47:06,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:06,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1398441457, now seen corresponding path program 1 times [2025-02-06 12:47:06,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:06,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903930728] [2025-02-06 12:47:06,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:06,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:06,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:47:06,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:47:06,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:06,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:07,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903930728] [2025-02-06 12:47:07,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903930728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:07,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:07,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:47:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117135142] [2025-02-06 12:47:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:07,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:47:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:07,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:47:07,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:47:07,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:47:07,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-06 12:47:07,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:07,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:47:07,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:07,648 INFO L124 PetriNetUnfolderBase]: 3680/5529 cut-off events. [2025-02-06 12:47:07,648 INFO L125 PetriNetUnfolderBase]: For 6092/6094 co-relation queries the response was YES. [2025-02-06 12:47:07,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15402 conditions, 5529 events. 3680/5529 cut-off events. For 6092/6094 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 27465 event pairs, 753 based on Foata normal form. 81/5610 useless extension candidates. Maximal degree in co-relation 15380. Up to 2317 conditions per place. [2025-02-06 12:47:07,667 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 38 selfloop transitions, 3 changer transitions 55/101 dead transitions. [2025-02-06 12:47:07,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 561 flow [2025-02-06 12:47:07,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:47:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:47:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2025-02-06 12:47:07,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4715909090909091 [2025-02-06 12:47:07,668 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 205 flow. Second operand 8 states and 166 transitions. [2025-02-06 12:47:07,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 101 transitions, 561 flow [2025-02-06 12:47:07,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 531 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-02-06 12:47:07,682 INFO L231 Difference]: Finished difference. Result has 66 places, 33 transitions, 129 flow [2025-02-06 12:47:07,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=129, PETRI_PLACES=66, PETRI_TRANSITIONS=33} [2025-02-06 12:47:07,683 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2025-02-06 12:47:07,683 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 33 transitions, 129 flow [2025-02-06 12:47:07,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 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-06 12:47:07,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:07,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:07,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:47:07,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:07,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1864441645, now seen corresponding path program 2 times [2025-02-06 12:47:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098857348] [2025-02-06 12:47:07,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:47:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:07,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:47:07,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:47:07,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:47:07,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:07,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098857348] [2025-02-06 12:47:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098857348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:07,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:07,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:47:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185436065] [2025-02-06 12:47:07,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:07,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:47:07,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:07,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:47:07,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:47:07,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:07,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 33 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:07,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:07,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:07,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:08,001 INFO L124 PetriNetUnfolderBase]: 1531/2460 cut-off events. [2025-02-06 12:47:08,001 INFO L125 PetriNetUnfolderBase]: For 1705/1707 co-relation queries the response was YES. [2025-02-06 12:47:08,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6134 conditions, 2460 events. 1531/2460 cut-off events. For 1705/1707 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 12023 event pairs, 177 based on Foata normal form. 106/2566 useless extension candidates. Maximal degree in co-relation 6114. Up to 1447 conditions per place. [2025-02-06 12:47:08,010 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 49 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2025-02-06 12:47:08,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 349 flow [2025-02-06 12:47:08,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:47:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:47:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-02-06 12:47:08,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5511363636363636 [2025-02-06 12:47:08,011 INFO L175 Difference]: Start difference. First operand has 66 places, 33 transitions, 129 flow. Second operand 4 states and 97 transitions. [2025-02-06 12:47:08,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 349 flow [2025-02-06 12:47:08,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 287 flow, removed 10 selfloop flow, removed 14 redundant places. [2025-02-06 12:47:08,016 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 131 flow [2025-02-06 12:47:08,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2025-02-06 12:47:08,017 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2025-02-06 12:47:08,017 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 131 flow [2025-02-06 12:47:08,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:08,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:08,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:08,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:47:08,018 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:08,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1976924908, now seen corresponding path program 1 times [2025-02-06 12:47:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:08,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772076588] [2025-02-06 12:47:08,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:08,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:08,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:47:08,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:47:08,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:08,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:08,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:08,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772076588] [2025-02-06 12:47:08,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772076588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:08,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:08,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:47:08,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410048836] [2025-02-06 12:47:08,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:08,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:47:08,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:08,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:47:08,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:47:08,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:08,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 131 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-06 12:47:08,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:08,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:08,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:08,298 INFO L124 PetriNetUnfolderBase]: 959/1574 cut-off events. [2025-02-06 12:47:08,298 INFO L125 PetriNetUnfolderBase]: For 979/981 co-relation queries the response was YES. [2025-02-06 12:47:08,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 1574 events. 959/1574 cut-off events. For 979/981 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6888 event pairs, 91 based on Foata normal form. 84/1658 useless extension candidates. Maximal degree in co-relation 4108. Up to 661 conditions per place. [2025-02-06 12:47:08,303 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 56 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2025-02-06 12:47:08,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 378 flow [2025-02-06 12:47:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:47:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:47:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-02-06 12:47:08,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-02-06 12:47:08,304 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 131 flow. Second operand 5 states and 117 transitions. [2025-02-06 12:47:08,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 378 flow [2025-02-06 12:47:08,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 368 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:08,305 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 171 flow [2025-02-06 12:47:08,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2025-02-06 12:47:08,306 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2025-02-06 12:47:08,306 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 171 flow [2025-02-06 12:47:08,306 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-06 12:47:08,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:08,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:08,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:47:08,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1238108723, now seen corresponding path program 1 times [2025-02-06 12:47:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184314547] [2025-02-06 12:47:08,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:08,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:47:08,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:47:08,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:08,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:08,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184314547] [2025-02-06 12:47:08,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184314547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:08,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:08,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:47:08,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049930952] [2025-02-06 12:47:08,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:47:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:08,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:47:08,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:47:08,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:08,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:08,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:08,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:08,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:08,695 INFO L124 PetriNetUnfolderBase]: 525/860 cut-off events. [2025-02-06 12:47:08,698 INFO L125 PetriNetUnfolderBase]: For 1023/1025 co-relation queries the response was YES. [2025-02-06 12:47:08,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 860 events. 525/860 cut-off events. For 1023/1025 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3093 event pairs, 73 based on Foata normal form. 40/900 useless extension candidates. Maximal degree in co-relation 2448. Up to 284 conditions per place. [2025-02-06 12:47:08,705 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 49 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2025-02-06 12:47:08,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 375 flow [2025-02-06 12:47:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:47:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:47:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-02-06 12:47:08,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2025-02-06 12:47:08,709 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 171 flow. Second operand 6 states and 123 transitions. [2025-02-06 12:47:08,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 375 flow [2025-02-06 12:47:08,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 320 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-02-06 12:47:08,712 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 169 flow [2025-02-06 12:47:08,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2025-02-06 12:47:08,712 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2025-02-06 12:47:08,712 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 169 flow [2025-02-06 12:47:08,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:08,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:08,716 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] [2025-02-06 12:47:08,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:47:08,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:08,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1628786908, now seen corresponding path program 1 times [2025-02-06 12:47:08,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:08,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765906176] [2025-02-06 12:47:08,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:08,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:08,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:08,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:08,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:09,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:47:09,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765906176] [2025-02-06 12:47:09,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765906176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:09,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:09,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:47:09,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396948329] [2025-02-06 12:47:09,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:09,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:47:09,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:47:09,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:47:09,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:47:09,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:47:09,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:09,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:09,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:47:09,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:09,956 INFO L124 PetriNetUnfolderBase]: 677/1107 cut-off events. [2025-02-06 12:47:09,959 INFO L125 PetriNetUnfolderBase]: For 1144/1144 co-relation queries the response was YES. [2025-02-06 12:47:09,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 1107 events. 677/1107 cut-off events. For 1144/1144 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4377 event pairs, 98 based on Foata normal form. 8/1115 useless extension candidates. Maximal degree in co-relation 3043. Up to 502 conditions per place. [2025-02-06 12:47:09,964 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 45 selfloop transitions, 4 changer transitions 35/89 dead transitions. [2025-02-06 12:47:09,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 542 flow [2025-02-06 12:47:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:47:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:47:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2025-02-06 12:47:09,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2025-02-06 12:47:09,966 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 169 flow. Second operand 9 states and 152 transitions. [2025-02-06 12:47:09,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 542 flow [2025-02-06 12:47:09,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 417 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:47:09,970 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 131 flow [2025-02-06 12:47:09,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=131, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-02-06 12:47:09,973 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2025-02-06 12:47:09,973 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 131 flow [2025-02-06 12:47:09,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:09,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:09,978 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] [2025-02-06 12:47:09,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:47:09,979 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:09,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1430242196, now seen corresponding path program 2 times [2025-02-06 12:47:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:47:09,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890635203] [2025-02-06 12:47:09,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:47:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:47:09,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:10,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:10,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:47:10,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:47:10,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:47:10,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:10,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:10,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:10,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:47:10,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:47:10,124 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:47:10,125 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 12:47:10,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:47:10,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:47:10,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:47:10,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-06 12:47:10,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-06 12:47:10,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:47:10,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:47:10,128 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:10,187 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:47:10,187 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:47:10,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:47:10 BasicIcfg [2025-02-06 12:47:10,194 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:47:10,195 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:47:10,195 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:47:10,195 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:47:10,195 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:46:57" (3/4) ... [2025-02-06 12:47:10,196 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:47:10,196 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:47:10,200 INFO L158 Benchmark]: Toolchain (without parser) took 13989.07ms. Allocated memory was 201.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 154.1MB in the beginning and 851.5MB in the end (delta: -697.5MB). Peak memory consumption was 598.0MB. Max. memory is 16.1GB. [2025-02-06 12:47:10,201 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:10,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.03ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 131.3MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:47:10,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.54ms. Allocated memory is still 201.3MB. Free memory was 131.3MB in the beginning and 129.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:10,201 INFO L158 Benchmark]: Boogie Preprocessor took 49.02ms. Allocated memory is still 201.3MB. Free memory was 129.0MB in the beginning and 126.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:10,201 INFO L158 Benchmark]: IcfgBuilder took 580.53ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 73.5MB in the end (delta: 52.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-06 12:47:10,201 INFO L158 Benchmark]: TraceAbstraction took 12884.18ms. Allocated memory was 201.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 72.9MB in the beginning and 851.8MB in the end (delta: -778.9MB). Peak memory consumption was 505.7MB. Max. memory is 16.1GB. [2025-02-06 12:47:10,201 INFO L158 Benchmark]: Witness Printer took 1.80ms. Allocated memory is still 1.5GB. Free memory was 851.8MB in the beginning and 851.5MB in the end (delta: 315.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:47:10,202 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.03ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 131.3MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.54ms. Allocated memory is still 201.3MB. Free memory was 131.3MB in the beginning and 129.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.02ms. Allocated memory is still 201.3MB. Free memory was 129.0MB in the beginning and 126.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 580.53ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 73.5MB in the end (delta: 52.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12884.18ms. Allocated memory was 201.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 72.9MB in the beginning and 851.8MB in the end (delta: -778.9MB). Peak memory consumption was 505.7MB. Max. memory is 16.1GB. * Witness Printer took 1.80ms. Allocated memory is still 1.5GB. Free memory was 851.8MB in the beginning and 851.5MB in the end (delta: 315.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-2, t1829=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-2, t1829=-1, t1830=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-2, t1829=-1, t1830=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-2, t1829=-1, t1830=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-2, t1829=-1, t1830=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "safe002_power.opt_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 830]: 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: 832]: 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, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 786 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 782 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2101 IncrementalHoareTripleChecker+Invalid, 2140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 1 mSDtfsCounter, 2101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=7, 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, 2.7s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 961 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-06 12:47:10,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.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 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:47:12,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:47:12,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:47:12,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:47:12,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:47:12,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:47:12,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:47:12,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:47:12,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:47:12,684 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:47:12,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:47:12,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:47:12,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:47:12,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:47:12,686 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:47:12,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:47:12,686 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:47:12,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:47:12,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:47:12,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:47:12,687 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:47:12,687 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:47:12,687 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:47:12,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:47:12,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:47:12,687 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:47:12,687 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:47:12,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:47:12,688 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:47:12,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:47:12,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:47:12,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:47:12,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:47:12,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:47:12,689 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2025-02-06 12:47:12,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:47:12,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:47:12,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:47:12,990 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:47:12,990 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:47:12,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-02-06 12:47:14,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eff5846ed/0d593bf2811e419388cdd6d283ea9ff4/FLAG7e770c087 [2025-02-06 12:47:14,755 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:47:14,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-02-06 12:47:14,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eff5846ed/0d593bf2811e419388cdd6d283ea9ff4/FLAG7e770c087 [2025-02-06 12:47:15,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eff5846ed/0d593bf2811e419388cdd6d283ea9ff4 [2025-02-06 12:47:15,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:47:15,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:47:15,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:47:15,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:47:15,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:47:15,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7defdf8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15, skipping insertion in model container [2025-02-06 12:47:15,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:47:15,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:47:15,473 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:47:15,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:47:15,592 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:47:15,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15 WrapperNode [2025-02-06 12:47:15,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:47:15,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:47:15,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:47:15,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:47:15,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,652 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2025-02-06 12:47:15,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:47:15,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:47:15,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:47:15,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:47:15,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,687 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:47:15,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:47:15,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:47:15,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:47:15,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:47:15,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (1/1) ... [2025-02-06 12:47:15,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:47:15,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:15,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:47:15,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:47:15,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:47:15,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:47:15,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:47:15,764 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:47:15,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:47:15,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:47:15,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:47:15,764 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:47:15,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:47:15,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:47:15,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:47:15,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:47:15,766 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:47:15,877 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:47:15,878 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:47:16,213 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:47:16,213 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:47:16,417 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:47:16,418 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:47:16,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:16 BoogieIcfgContainer [2025-02-06 12:47:16,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:47:16,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:47:16,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:47:16,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:47:16,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:47:15" (1/3) ... [2025-02-06 12:47:16,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636e634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:47:16, skipping insertion in model container [2025-02-06 12:47:16,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:47:15" (2/3) ... [2025-02-06 12:47:16,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636e634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:47:16, skipping insertion in model container [2025-02-06 12:47:16,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:16" (3/3) ... [2025-02-06 12:47:16,426 INFO L128 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-02-06 12:47:16,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:47:16,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:47:16,442 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:47:16,521 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:47:16,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2025-02-06 12:47:16,573 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-02-06 12:47:16,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:16,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-02-06 12:47:16,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2025-02-06 12:47:16,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2025-02-06 12:47:16,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:47:16,595 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;@601cb102, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:47:16,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 12:47:16,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:47:16,599 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 12:47:16,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:16,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:16,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:47:16,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:16,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1840731190, now seen corresponding path program 1 times [2025-02-06 12:47:16,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:16,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392900029] [2025-02-06 12:47:16,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:16,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:16,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:16,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:47:16,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:47:16,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:47:16,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:47:16,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:16,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:16,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:47:16,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:16,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:16,769 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392900029] [2025-02-06 12:47:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392900029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:47:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132244847] [2025-02-06 12:47:16,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:16,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:47:16,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:16,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:47:16,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:47:16,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:16,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:16,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:16,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:16,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:17,778 INFO L124 PetriNetUnfolderBase]: 5315/7699 cut-off events. [2025-02-06 12:47:17,778 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-06 12:47:17,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15350 conditions, 7699 events. 5315/7699 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 42874 event pairs, 585 based on Foata normal form. 432/8119 useless extension candidates. Maximal degree in co-relation 15339. Up to 6591 conditions per place. [2025-02-06 12:47:17,818 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-02-06 12:47:17,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 230 flow [2025-02-06 12:47:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:47:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:47:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-06 12:47:17,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-02-06 12:47:17,828 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 86 transitions. [2025-02-06 12:47:17,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 230 flow [2025-02-06 12:47:17,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:47:17,833 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-02-06 12:47:17,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-06 12:47:17,836 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-02-06 12:47:17,836 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-02-06 12:47:17,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:17,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:17,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:17,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:47:18,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:18,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:18,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1896569346, now seen corresponding path program 1 times [2025-02-06 12:47:18,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:18,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223505264] [2025-02-06 12:47:18,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:18,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:18,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:18,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:47:18,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:47:18,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:47:18,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:47:18,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:18,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:18,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:47:18,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:18,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:18,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:18,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223505264] [2025-02-06 12:47:18,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223505264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:18,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:18,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:47:18,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174675610] [2025-02-06 12:47:18,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:18,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:47:18,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:18,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:47:18,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:47:18,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-06 12:47:18,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:18,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:18,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-06 12:47:18,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:18,770 INFO L124 PetriNetUnfolderBase]: 4775/7427 cut-off events. [2025-02-06 12:47:18,770 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-02-06 12:47:18,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14657 conditions, 7427 events. 4775/7427 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43867 event pairs, 4775 based on Foata normal form. 216/7592 useless extension candidates. Maximal degree in co-relation 14647. Up to 6804 conditions per place. [2025-02-06 12:47:18,806 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-02-06 12:47:18,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 138 flow [2025-02-06 12:47:18,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:47:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:47:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-02-06 12:47:18,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-02-06 12:47:18,808 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 57 transitions. [2025-02-06 12:47:18,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 138 flow [2025-02-06 12:47:18,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:18,809 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-02-06 12:47:18,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-02-06 12:47:18,810 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-02-06 12:47:18,810 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-02-06 12:47:18,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:18,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:18,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:18,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:47:19,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:19,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:19,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1896568873, now seen corresponding path program 1 times [2025-02-06 12:47:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:19,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690941287] [2025-02-06 12:47:19,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:19,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:19,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:19,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:47:19,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:47:19,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:47:19,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:47:19,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:19,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:19,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:47:19,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:19,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:19,129 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:19,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690941287] [2025-02-06 12:47:19,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690941287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:19,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:19,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:47:19,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570634336] [2025-02-06 12:47:19,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:19,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:47:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:19,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:47:19,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:47:19,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:19,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:19,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:19,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:19,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:19,589 INFO L124 PetriNetUnfolderBase]: 3471/5583 cut-off events. [2025-02-06 12:47:19,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:47:19,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10789 conditions, 5583 events. 3471/5583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 33176 event pairs, 535 based on Foata normal form. 216/5786 useless extension candidates. Maximal degree in co-relation 10783. Up to 3001 conditions per place. [2025-02-06 12:47:19,610 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 55 selfloop transitions, 5 changer transitions 1/67 dead transitions. [2025-02-06 12:47:19,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 268 flow [2025-02-06 12:47:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:47:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:47:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-06 12:47:19,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5852272727272727 [2025-02-06 12:47:19,611 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 103 transitions. [2025-02-06 12:47:19,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 268 flow [2025-02-06 12:47:19,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 267 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:47:19,613 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2025-02-06 12:47:19,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-02-06 12:47:19,614 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-02-06 12:47:19,614 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2025-02-06 12:47:19,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:19,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:19,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:19,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:47:19,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:19,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:19,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash -996973735, now seen corresponding path program 1 times [2025-02-06 12:47:19,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:19,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1066821924] [2025-02-06 12:47:19,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:19,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:19,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:19,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:47:19,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:47:19,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:47:19,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:47:19,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:19,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:19,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:47:19,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:19,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:19,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:19,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066821924] [2025-02-06 12:47:19,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066821924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:19,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:19,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:47:19,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293217530] [2025-02-06 12:47:19,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:19,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:47:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:19,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:47:19,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:47:19,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:19,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:19,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:19,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:19,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:20,229 INFO L124 PetriNetUnfolderBase]: 1935/3119 cut-off events. [2025-02-06 12:47:20,229 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2025-02-06 12:47:20,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7056 conditions, 3119 events. 1935/3119 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 15991 event pairs, 339 based on Foata normal form. 152/3258 useless extension candidates. Maximal degree in co-relation 7047. Up to 985 conditions per place. [2025-02-06 12:47:20,243 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 70 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-02-06 12:47:20,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 384 flow [2025-02-06 12:47:20,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:47:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:47:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-02-06 12:47:20,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5954545454545455 [2025-02-06 12:47:20,248 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 131 transitions. [2025-02-06 12:47:20,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 384 flow [2025-02-06 12:47:20,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 374 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:47:20,251 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2025-02-06 12:47:20,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-02-06 12:47:20,252 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2025-02-06 12:47:20,252 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2025-02-06 12:47:20,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:20,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:20,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:47:20,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:47:20,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:20,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:20,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:20,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1350063945, now seen corresponding path program 1 times [2025-02-06 12:47:20,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:20,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080658339] [2025-02-06 12:47:20,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:20,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:20,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:20,459 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:47:20,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:47:20,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 12:47:20,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 12:47:20,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:20,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:20,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:47:20,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:20,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:20,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:20,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080658339] [2025-02-06 12:47:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080658339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:20,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:47:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80985510] [2025-02-06 12:47:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:20,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:47:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:20,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:47:20,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:47:20,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:20,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 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-06 12:47:20,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:20,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:20,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:21,087 INFO L124 PetriNetUnfolderBase]: 1167/1823 cut-off events. [2025-02-06 12:47:21,088 INFO L125 PetriNetUnfolderBase]: For 1138/1138 co-relation queries the response was YES. [2025-02-06 12:47:21,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4568 conditions, 1823 events. 1167/1823 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8065 event pairs, 303 based on Foata normal form. 56/1866 useless extension candidates. Maximal degree in co-relation 4557. Up to 672 conditions per place. [2025-02-06 12:47:21,104 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 59 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2025-02-06 12:47:21,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 375 flow [2025-02-06 12:47:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:47:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 12:47:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-02-06 12:47:21,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2025-02-06 12:47:21,106 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 133 transitions. [2025-02-06 12:47:21,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 375 flow [2025-02-06 12:47:21,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 350 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 12:47:21,127 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2025-02-06 12:47:21,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-02-06 12:47:21,128 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-02-06 12:47:21,128 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2025-02-06 12:47:21,128 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-06 12:47:21,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:21,128 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] [2025-02-06 12:47:21,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:47:21,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:21,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:21,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:21,333 INFO L85 PathProgramCache]: Analyzing trace with hash 818878532, now seen corresponding path program 1 times [2025-02-06 12:47:21,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:21,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120896387] [2025-02-06 12:47:21,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:47:21,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:21,337 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:47:21,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:47:21,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:21,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:21,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:21,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:21,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:47:21,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:21,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:21,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:21,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120896387] [2025-02-06 12:47:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120896387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:21,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:21,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:47:21,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064405633] [2025-02-06 12:47:21,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:21,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:47:21,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:21,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:47:21,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:47:21,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:21,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:21,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:21,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:21,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:22,028 INFO L124 PetriNetUnfolderBase]: 1651/2579 cut-off events. [2025-02-06 12:47:22,028 INFO L125 PetriNetUnfolderBase]: For 1800/1800 co-relation queries the response was YES. [2025-02-06 12:47:22,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6549 conditions, 2579 events. 1651/2579 cut-off events. For 1800/1800 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12153 event pairs, 315 based on Foata normal form. 8/2578 useless extension candidates. Maximal degree in co-relation 6537. Up to 1084 conditions per place. [2025-02-06 12:47:22,038 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 59 selfloop transitions, 7 changer transitions 25/97 dead transitions. [2025-02-06 12:47:22,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 543 flow [2025-02-06 12:47:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:47:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:47:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2025-02-06 12:47:22,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967532467532468 [2025-02-06 12:47:22,039 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 7 states and 153 transitions. [2025-02-06 12:47:22,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 543 flow [2025-02-06 12:47:22,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 430 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-06 12:47:22,052 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 164 flow [2025-02-06 12:47:22,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-02-06 12:47:22,053 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2025-02-06 12:47:22,053 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 164 flow [2025-02-06 12:47:22,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:22,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:22,053 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] [2025-02-06 12:47:22,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:47:22,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:22,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:22,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:22,255 INFO L85 PathProgramCache]: Analyzing trace with hash 494645920, now seen corresponding path program 2 times [2025-02-06 12:47:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:22,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [859627008] [2025-02-06 12:47:22,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:47:22,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:22,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:22,258 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:47:22,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:47:22,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:22,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:22,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:47:22,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:22,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:47:22,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:22,536 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:22,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:22,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859627008] [2025-02-06 12:47:22,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859627008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:22,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:22,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:47:22,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934206610] [2025-02-06 12:47:22,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:22,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:47:22,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:22,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:47:22,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:47:22,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:22,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 164 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:22,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:22,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:22,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:23,082 INFO L124 PetriNetUnfolderBase]: 1441/2289 cut-off events. [2025-02-06 12:47:23,083 INFO L125 PetriNetUnfolderBase]: For 722/736 co-relation queries the response was YES. [2025-02-06 12:47:23,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 2289 events. 1441/2289 cut-off events. For 722/736 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10469 event pairs, 487 based on Foata normal form. 16/2304 useless extension candidates. Maximal degree in co-relation 5621. Up to 971 conditions per place. [2025-02-06 12:47:23,103 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 55 selfloop transitions, 7 changer transitions 30/98 dead transitions. [2025-02-06 12:47:23,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 513 flow [2025-02-06 12:47:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:47:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:47:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2025-02-06 12:47:23,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4837662337662338 [2025-02-06 12:47:23,105 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 164 flow. Second operand 7 states and 149 transitions. [2025-02-06 12:47:23,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 513 flow [2025-02-06 12:47:23,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 98 transitions, 496 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-06 12:47:23,111 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 203 flow [2025-02-06 12:47:23,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2025-02-06 12:47:23,112 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-02-06 12:47:23,114 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 203 flow [2025-02-06 12:47:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:23,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:23,114 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] [2025-02-06 12:47:23,125 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-06 12:47:23,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:23,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:23,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:23,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1253201114, now seen corresponding path program 3 times [2025-02-06 12:47:23,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:23,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767181242] [2025-02-06 12:47:23,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:47:23,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:23,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:23,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:47:23,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:47:23,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:23,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:23,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:47:23,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:23,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:47:23,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:23,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:23,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:23,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767181242] [2025-02-06 12:47:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767181242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:23,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:23,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:47:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826002860] [2025-02-06 12:47:23,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:23,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:47:23,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:23,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:47:23,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:47:23,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:23,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 203 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:23,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:23,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:23,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:24,161 INFO L124 PetriNetUnfolderBase]: 1053/1691 cut-off events. [2025-02-06 12:47:24,162 INFO L125 PetriNetUnfolderBase]: For 780/780 co-relation queries the response was YES. [2025-02-06 12:47:24,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 1691 events. 1053/1691 cut-off events. For 780/780 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7623 event pairs, 86 based on Foata normal form. 8/1699 useless extension candidates. Maximal degree in co-relation 4333. Up to 784 conditions per place. [2025-02-06 12:47:24,167 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 56 selfloop transitions, 4 changer transitions 45/111 dead transitions. [2025-02-06 12:47:24,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 111 transitions, 647 flow [2025-02-06 12:47:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:47:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:47:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2025-02-06 12:47:24,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2025-02-06 12:47:24,169 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 203 flow. Second operand 10 states and 178 transitions. [2025-02-06 12:47:24,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 111 transitions, 647 flow [2025-02-06 12:47:24,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 614 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-02-06 12:47:24,171 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 183 flow [2025-02-06 12:47:24,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=183, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2025-02-06 12:47:24,173 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2025-02-06 12:47:24,173 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 183 flow [2025-02-06 12:47:24,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:24,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:24,173 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] [2025-02-06 12:47:24,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 12:47:24,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:24,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:24,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash 941496364, now seen corresponding path program 4 times [2025-02-06 12:47:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:24,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069950160] [2025-02-06 12:47:24,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 12:47:24,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:24,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:24,377 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:47:24,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:47:24,448 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-06 12:47:24,459 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 30 statements. [2025-02-06 12:47:24,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 12:47:24,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:47:24,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 12:47:24,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:47:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:47:24,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:47:24,530 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:47:24,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069950160] [2025-02-06 12:47:24,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069950160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:47:24,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:47:24,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:47:24,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952498528] [2025-02-06 12:47:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:47:24,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:47:24,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:47:24,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:47:24,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:47:24,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-06 12:47:24,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:24,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:47:24,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-06 12:47:24,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:47:24,896 INFO L124 PetriNetUnfolderBase]: 941/1552 cut-off events. [2025-02-06 12:47:24,897 INFO L125 PetriNetUnfolderBase]: For 961/963 co-relation queries the response was YES. [2025-02-06 12:47:24,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3966 conditions, 1552 events. 941/1552 cut-off events. For 961/963 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6688 event pairs, 355 based on Foata normal form. 9/1561 useless extension candidates. Maximal degree in co-relation 3950. Up to 631 conditions per place. [2025-02-06 12:47:24,904 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 37 selfloop transitions, 2 changer transitions 50/95 dead transitions. [2025-02-06 12:47:24,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 539 flow [2025-02-06 12:47:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:47:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:47:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2025-02-06 12:47:24,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4289772727272727 [2025-02-06 12:47:24,906 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 183 flow. Second operand 8 states and 151 transitions. [2025-02-06 12:47:24,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 539 flow [2025-02-06 12:47:24,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 509 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-02-06 12:47:24,909 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 161 flow [2025-02-06 12:47:24,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=161, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2025-02-06 12:47:24,910 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2025-02-06 12:47:24,910 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 161 flow [2025-02-06 12:47:24,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:47:24,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:47:24,911 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] [2025-02-06 12:47:24,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 12:47:25,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:25,112 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-06 12:47:25,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:47:25,113 INFO L85 PathProgramCache]: Analyzing trace with hash -403387760, now seen corresponding path program 5 times [2025-02-06 12:47:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:47:25,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347953448] [2025-02-06 12:47:25,113 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 12:47:25,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:25,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:47:25,116 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:47:25,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:47:25,192 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:25,214 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:25,214 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:47:25,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:47:25,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:47:25,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:47:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:47:25,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:47:25,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:47:25,288 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:47:25,289 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:47:25,290 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 12:47:25,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-06 12:47:25,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-06 12:47:25,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-06 12:47:25,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-06 12:47:25,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-06 12:47:25,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-06 12:47:25,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 12:47:25,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:47:25,493 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-02-06 12:47:25,550 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:47:25,550 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:47:25,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:47:25 BasicIcfg [2025-02-06 12:47:25,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:47:25,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:47:25,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:47:25,558 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:47:25,559 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:47:16" (3/4) ... [2025-02-06 12:47:25,560 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:47:25,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:47:25,562 INFO L158 Benchmark]: Toolchain (without parser) took 10512.02ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 91.0MB in the beginning and 249.4MB in the end (delta: -158.4MB). Peak memory consumption was 144.0MB. Max. memory is 16.1GB. [2025-02-06 12:47:25,562 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:25,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.30ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 67.6MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:47:25,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.34ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 65.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:25,563 INFO L158 Benchmark]: Boogie Preprocessor took 46.96ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 62.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:25,563 INFO L158 Benchmark]: IcfgBuilder took 717.78ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 49.1MB in the end (delta: 13.6MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2025-02-06 12:47:25,563 INFO L158 Benchmark]: TraceAbstraction took 9133.72ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 48.1MB in the beginning and 249.4MB in the end (delta: -201.3MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2025-02-06 12:47:25,563 INFO L158 Benchmark]: Witness Printer took 3.69ms. Allocated memory is still 419.4MB. Free memory was 249.4MB in the beginning and 249.4MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:47:25,564 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.15ms. Allocated memory is still 83.9MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.30ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 67.6MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.34ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 65.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.96ms. Allocated memory is still 117.4MB. Free memory was 65.5MB in the beginning and 62.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 717.78ms. Allocated memory is still 117.4MB. Free memory was 62.7MB in the beginning and 49.1MB in the end (delta: 13.6MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9133.72ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 48.1MB in the beginning and 249.4MB in the end (delta: -201.3MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. * Witness Printer took 3.69ms. Allocated memory is still 419.4MB. Free memory was 249.4MB in the beginning and 249.4MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-2, t1829=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828=-2, t1829=-1, t1830=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-2, t1829=-1, t1830=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-2, t1829=-1, t1830=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828=-2, t1829=-1, t1830=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "safe002_power.opt_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 830]: 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: 832]: 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, 68 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: 9.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1623 IncrementalHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1 mSDtfsCounter, 1623 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=7, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 231 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 873 SizeOfPredicates, 31 NumberOfNonLiveVariables, 898 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:47:25,577 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