./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_27-multiple-protecting2_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/goblint-regression/13-privatized_27-multiple-protecting2_true.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 2d0b9c4fc8b0005fb250fdf1ff8e25835b95e676b1936e4f5fe1cf72245ee5f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:57:21,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:57:21,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:57:21,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:57:21,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:57:21,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:57:21,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:57:21,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:57:21,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:57:21,109 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:57:21,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:57:21,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:57:21,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:57:21,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:57:21,110 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:57:21,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:57:21,110 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:57:21,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:57:21,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:57:21,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:57:21,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:57:21,111 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:57:21,111 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:57:21,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:57:21,111 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:57:21,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:57:21,111 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:57:21,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:57:21,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:57:21,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:57:21,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:57:21,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:57:21,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:57:21,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:21,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:57:21,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:57:21,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:57:21,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:57:21,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:21,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:57:21,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:57:21,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:57:21,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:57:21,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:57:21,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:57:21,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:57:21,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:57:21,113 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 -> 2d0b9c4fc8b0005fb250fdf1ff8e25835b95e676b1936e4f5fe1cf72245ee5f5 [2025-01-10 00:57:21,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:57:21,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:57:21,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:57:21,329 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:57:21,330 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:57:21,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-01-10 00:57:22,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c5089e18/0505b2993c584d1ebb7626d443cabf09/FLAG1a9fdf313 [2025-01-10 00:57:22,866 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:57:22,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-01-10 00:57:22,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c5089e18/0505b2993c584d1ebb7626d443cabf09/FLAG1a9fdf313 [2025-01-10 00:57:23,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c5089e18/0505b2993c584d1ebb7626d443cabf09 [2025-01-10 00:57:23,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:57:23,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:57:23,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:57:23,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:57:23,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:57:23,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736f61e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23, skipping insertion in model container [2025-01-10 00:57:23,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:57:23,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:57:23,442 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:57:23,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:57:23,507 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:57:23,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23 WrapperNode [2025-01-10 00:57:23,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:57:23,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:57:23,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:57:23,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:57:23,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,534 INFO L138 Inliner]: procedures = 163, calls = 55, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 117 [2025-01-10 00:57:23,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:57:23,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:57:23,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:57:23,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:57:23,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,555 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-10 00:57:23,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:57:23,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:57:23,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:57:23,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:57:23,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (1/1) ... [2025-01-10 00:57:23,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:23,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:57:23,598 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-01-10 00:57:23,602 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-01-10 00:57:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-01-10 00:57:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-01-10 00:57:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:57:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:57:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:57:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:57:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:57:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:57:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:57:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:57:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:57:23,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:57:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:57:23,620 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:57:23,721 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:57:23,723 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:57:23,898 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:57:23,898 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:57:24,009 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:57:24,010 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:57:24,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:24 BoogieIcfgContainer [2025-01-10 00:57:24,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:57:24,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:57:24,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:57:24,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:57:24,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:57:23" (1/3) ... [2025-01-10 00:57:24,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1243b5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:24, skipping insertion in model container [2025-01-10 00:57:24,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:23" (2/3) ... [2025-01-10 00:57:24,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1243b5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:24, skipping insertion in model container [2025-01-10 00:57:24,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:24" (3/3) ... [2025-01-10 00:57:24,017 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_27-multiple-protecting2_true.i [2025-01-10 00:57:24,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:57:24,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_27-multiple-protecting2_true.i that has 3 procedures, 87 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-01-10 00:57:24,028 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:57:24,062 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:57:24,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 94 transitions, 202 flow [2025-01-10 00:57:24,116 INFO L124 PetriNetUnfolderBase]: 8/92 cut-off events. [2025-01-10 00:57:24,118 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:57:24,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 92 events. 8/92 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2025-01-10 00:57:24,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 94 transitions, 202 flow [2025-01-10 00:57:24,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 91 transitions, 194 flow [2025-01-10 00:57:24,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:57:24,137 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;@223ab0ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:57:24,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:57:24,145 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:57:24,146 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-01-10 00:57:24,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:24,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:24,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:24,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:57:24,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1643910906, now seen corresponding path program 1 times [2025-01-10 00:57:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:24,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686494394] [2025-01-10 00:57:24,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:24,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:24,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:57:24,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:57:24,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:24,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:24,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686494394] [2025-01-10 00:57:24,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686494394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:24,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:24,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:24,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116298231] [2025-01-10 00:57:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:24,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:57:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:24,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:57:24,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:57:24,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 94 [2025-01-10 00:57:24,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-01-10 00:57:24,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:24,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 94 [2025-01-10 00:57:24,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:25,448 INFO L124 PetriNetUnfolderBase]: 5526/9846 cut-off events. [2025-01-10 00:57:25,448 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-10 00:57:25,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18561 conditions, 9846 events. 5526/9846 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 69860 event pairs, 1275 based on Foata normal form. 610/10136 useless extension candidates. Maximal degree in co-relation 18498. Up to 5197 conditions per place. [2025-01-10 00:57:25,502 INFO L140 encePairwiseOnDemand]: 70/94 looper letters, 101 selfloop transitions, 19 changer transitions 0/146 dead transitions. [2025-01-10 00:57:25,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 146 transitions, 547 flow [2025-01-10 00:57:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:57:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:57:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 276 transitions. [2025-01-10 00:57:25,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5872340425531914 [2025-01-10 00:57:25,518 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 194 flow. Second operand 5 states and 276 transitions. [2025-01-10 00:57:25,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 146 transitions, 547 flow [2025-01-10 00:57:25,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 146 transitions, 537 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:57:25,529 INFO L231 Difference]: Finished difference. Result has 90 places, 91 transitions, 286 flow [2025-01-10 00:57:25,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=90, PETRI_TRANSITIONS=91} [2025-01-10 00:57:25,535 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 0 predicate places. [2025-01-10 00:57:25,537 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 91 transitions, 286 flow [2025-01-10 00:57:25,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-01-10 00:57:25,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:25,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:25,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:57:25,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:57:25,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1778297083, now seen corresponding path program 1 times [2025-01-10 00:57:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351345417] [2025-01-10 00:57:25,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:25,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:57:25,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:57:25,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:25,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:25,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:25,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351345417] [2025-01-10 00:57:25,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351345417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:25,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:25,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307481374] [2025-01-10 00:57:25,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:25,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:57:25,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:25,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:57:25,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:57:25,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 94 [2025-01-10 00:57:25,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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-01-10 00:57:25,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:25,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 94 [2025-01-10 00:57:25,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:26,344 INFO L124 PetriNetUnfolderBase]: 2893/6063 cut-off events. [2025-01-10 00:57:26,344 INFO L125 PetriNetUnfolderBase]: For 1450/1558 co-relation queries the response was YES. [2025-01-10 00:57:26,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12927 conditions, 6063 events. 2893/6063 cut-off events. For 1450/1558 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 44154 event pairs, 781 based on Foata normal form. 220/6270 useless extension candidates. Maximal degree in co-relation 8399. Up to 3317 conditions per place. [2025-01-10 00:57:26,462 INFO L140 encePairwiseOnDemand]: 87/94 looper letters, 101 selfloop transitions, 7 changer transitions 0/142 dead transitions. [2025-01-10 00:57:26,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 142 transitions, 675 flow [2025-01-10 00:57:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:57:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:57:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2025-01-10 00:57:26,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904255319148937 [2025-01-10 00:57:26,465 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 286 flow. Second operand 4 states and 222 transitions. [2025-01-10 00:57:26,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 142 transitions, 675 flow [2025-01-10 00:57:26,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 142 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:57:26,484 INFO L231 Difference]: Finished difference. Result has 94 places, 95 transitions, 322 flow [2025-01-10 00:57:26,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=94, PETRI_TRANSITIONS=95} [2025-01-10 00:57:26,485 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-01-10 00:57:26,485 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 95 transitions, 322 flow [2025-01-10 00:57:26,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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-01-10 00:57:26,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:26,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:26,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:57:26,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:57:26,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2007176012, now seen corresponding path program 1 times [2025-01-10 00:57:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254770834] [2025-01-10 00:57:26,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:26,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:57:26,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:57:26,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:26,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:26,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:26,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254770834] [2025-01-10 00:57:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254770834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:26,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:26,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:26,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689756508] [2025-01-10 00:57:26,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:26,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:26,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:26,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:26,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 94 [2025-01-10 00:57:26,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 95 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-01-10 00:57:26,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:26,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 94 [2025-01-10 00:57:26,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:27,194 INFO L124 PetriNetUnfolderBase]: 3323/6429 cut-off events. [2025-01-10 00:57:27,194 INFO L125 PetriNetUnfolderBase]: For 2381/2381 co-relation queries the response was YES. [2025-01-10 00:57:27,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15207 conditions, 6429 events. 3323/6429 cut-off events. For 2381/2381 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 44327 event pairs, 1615 based on Foata normal form. 100/6515 useless extension candidates. Maximal degree in co-relation 9766. Up to 3061 conditions per place. [2025-01-10 00:57:27,215 INFO L140 encePairwiseOnDemand]: 77/94 looper letters, 113 selfloop transitions, 32 changer transitions 0/171 dead transitions. [2025-01-10 00:57:27,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 171 transitions, 865 flow [2025-01-10 00:57:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:57:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:57:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 297 transitions. [2025-01-10 00:57:27,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.526595744680851 [2025-01-10 00:57:27,217 INFO L175 Difference]: Start difference. First operand has 94 places, 95 transitions, 322 flow. Second operand 6 states and 297 transitions. [2025-01-10 00:57:27,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 171 transitions, 865 flow [2025-01-10 00:57:27,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 171 transitions, 864 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:57:27,225 INFO L231 Difference]: Finished difference. Result has 100 places, 110 transitions, 526 flow [2025-01-10 00:57:27,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=526, PETRI_PLACES=100, PETRI_TRANSITIONS=110} [2025-01-10 00:57:27,226 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 10 predicate places. [2025-01-10 00:57:27,226 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 110 transitions, 526 flow [2025-01-10 00:57:27,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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-01-10 00:57:27,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:27,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:27,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:57:27,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:57:27,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash 397928239, now seen corresponding path program 1 times [2025-01-10 00:57:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:27,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470142105] [2025-01-10 00:57:27,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:27,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:57:27,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:57:27,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:27,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:27,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470142105] [2025-01-10 00:57:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470142105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:27,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627549839] [2025-01-10 00:57:27,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:27,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:57:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:27,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:57:27,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:57:27,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 94 [2025-01-10 00:57:27,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 110 transitions, 526 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-01-10 00:57:27,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:27,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 94 [2025-01-10 00:57:27,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:27,758 INFO L124 PetriNetUnfolderBase]: 3359/6476 cut-off events. [2025-01-10 00:57:27,758 INFO L125 PetriNetUnfolderBase]: For 6240/6240 co-relation queries the response was YES. [2025-01-10 00:57:27,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17293 conditions, 6476 events. 3359/6476 cut-off events. For 6240/6240 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 44956 event pairs, 834 based on Foata normal form. 44/6512 useless extension candidates. Maximal degree in co-relation 9821. Up to 3763 conditions per place. [2025-01-10 00:57:27,782 INFO L140 encePairwiseOnDemand]: 82/94 looper letters, 125 selfloop transitions, 48 changer transitions 0/199 dead transitions. [2025-01-10 00:57:27,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 199 transitions, 1337 flow [2025-01-10 00:57:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:57:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:57:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 259 transitions. [2025-01-10 00:57:27,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551063829787234 [2025-01-10 00:57:27,784 INFO L175 Difference]: Start difference. First operand has 100 places, 110 transitions, 526 flow. Second operand 5 states and 259 transitions. [2025-01-10 00:57:27,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 199 transitions, 1337 flow [2025-01-10 00:57:27,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 199 transitions, 1299 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:27,796 INFO L231 Difference]: Finished difference. Result has 106 places, 132 transitions, 877 flow [2025-01-10 00:57:27,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=877, PETRI_PLACES=106, PETRI_TRANSITIONS=132} [2025-01-10 00:57:27,796 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 16 predicate places. [2025-01-10 00:57:27,796 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 132 transitions, 877 flow [2025-01-10 00:57:27,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-01-10 00:57:27,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:27,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:27,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:57:27,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:57:27,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1707016101, now seen corresponding path program 1 times [2025-01-10 00:57:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873384141] [2025-01-10 00:57:27,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:27,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:27,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:57:27,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:57:27,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:27,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:27,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873384141] [2025-01-10 00:57:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873384141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:27,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:27,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691086534] [2025-01-10 00:57:27,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:27,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:57:27,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:27,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:57:27,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:57:27,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 94 [2025-01-10 00:57:27,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 132 transitions, 877 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-01-10 00:57:27,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:27,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 94 [2025-01-10 00:57:27,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:28,229 INFO L124 PetriNetUnfolderBase]: 1798/3969 cut-off events. [2025-01-10 00:57:28,229 INFO L125 PetriNetUnfolderBase]: For 4502/4546 co-relation queries the response was YES. [2025-01-10 00:57:28,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11606 conditions, 3969 events. 1798/3969 cut-off events. For 4502/4546 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 27418 event pairs, 577 based on Foata normal form. 407/4307 useless extension candidates. Maximal degree in co-relation 8461. Up to 1812 conditions per place. [2025-01-10 00:57:28,246 INFO L140 encePairwiseOnDemand]: 75/94 looper letters, 96 selfloop transitions, 21 changer transitions 0/164 dead transitions. [2025-01-10 00:57:28,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 164 transitions, 1234 flow [2025-01-10 00:57:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:57:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:57:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2025-01-10 00:57:28,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5851063829787234 [2025-01-10 00:57:28,248 INFO L175 Difference]: Start difference. First operand has 106 places, 132 transitions, 877 flow. Second operand 4 states and 220 transitions. [2025-01-10 00:57:28,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 164 transitions, 1234 flow [2025-01-10 00:57:28,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 164 transitions, 1197 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 00:57:28,271 INFO L231 Difference]: Finished difference. Result has 109 places, 137 transitions, 886 flow [2025-01-10 00:57:28,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=886, PETRI_PLACES=109, PETRI_TRANSITIONS=137} [2025-01-10 00:57:28,272 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 19 predicate places. [2025-01-10 00:57:28,272 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 137 transitions, 886 flow [2025-01-10 00:57:28,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-01-10 00:57:28,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:28,272 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-01-10 00:57:28,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:57:28,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:57:28,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:28,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1088780335, now seen corresponding path program 1 times [2025-01-10 00:57:28,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:28,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371448153] [2025-01-10 00:57:28,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:28,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:28,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:57:28,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:57:28,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:28,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:28,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371448153] [2025-01-10 00:57:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371448153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:28,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577503422] [2025-01-10 00:57:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:28,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:28,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:28,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:28,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 94 [2025-01-10 00:57:28,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 137 transitions, 886 flow. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 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-01-10 00:57:28,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:28,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 94 [2025-01-10 00:57:28,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:28,964 INFO L124 PetriNetUnfolderBase]: 1265/3035 cut-off events. [2025-01-10 00:57:28,965 INFO L125 PetriNetUnfolderBase]: For 3833/3854 co-relation queries the response was YES. [2025-01-10 00:57:28,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9597 conditions, 3035 events. 1265/3035 cut-off events. For 3833/3854 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19632 event pairs, 326 based on Foata normal form. 86/3113 useless extension candidates. Maximal degree in co-relation 6872. Up to 2164 conditions per place. [2025-01-10 00:57:28,990 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 83 selfloop transitions, 8 changer transitions 0/127 dead transitions. [2025-01-10 00:57:28,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 127 transitions, 953 flow [2025-01-10 00:57:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:57:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:57:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2025-01-10 00:57:28,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5026595744680851 [2025-01-10 00:57:28,995 INFO L175 Difference]: Start difference. First operand has 109 places, 137 transitions, 886 flow. Second operand 4 states and 189 transitions. [2025-01-10 00:57:28,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 127 transitions, 953 flow [2025-01-10 00:57:29,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 127 transitions, 828 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 00:57:29,015 INFO L231 Difference]: Finished difference. Result has 96 places, 112 transitions, 609 flow [2025-01-10 00:57:29,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=609, PETRI_PLACES=96, PETRI_TRANSITIONS=112} [2025-01-10 00:57:29,015 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places. [2025-01-10 00:57:29,016 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 112 transitions, 609 flow [2025-01-10 00:57:29,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 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-01-10 00:57:29,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:29,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:29,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:57:29,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:57:29,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:29,020 INFO L85 PathProgramCache]: Analyzing trace with hash -219360816, now seen corresponding path program 1 times [2025-01-10 00:57:29,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:29,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-01-10 00:57:29,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:29,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:29,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 00:57:29,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 00:57:29,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:29,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:29,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-01-10 00:57:29,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122822815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:29,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:29,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:57:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666796419] [2025-01-10 00:57:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:29,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:57:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:29,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:57:29,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:57:29,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 94 [2025-01-10 00:57:29,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 112 transitions, 609 flow. Second operand has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 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-01-10 00:57:29,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:29,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 94 [2025-01-10 00:57:29,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:29,550 INFO L124 PetriNetUnfolderBase]: 808/2035 cut-off events. [2025-01-10 00:57:29,550 INFO L125 PetriNetUnfolderBase]: For 2016/2016 co-relation queries the response was YES. [2025-01-10 00:57:29,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5894 conditions, 2035 events. 808/2035 cut-off events. For 2016/2016 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 11905 event pairs, 294 based on Foata normal form. 56/2085 useless extension candidates. Maximal degree in co-relation 4471. Up to 1095 conditions per place. [2025-01-10 00:57:29,560 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 99 selfloop transitions, 7 changer transitions 0/142 dead transitions. [2025-01-10 00:57:29,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 142 transitions, 999 flow [2025-01-10 00:57:29,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:57:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:57:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2025-01-10 00:57:29,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.526595744680851 [2025-01-10 00:57:29,561 INFO L175 Difference]: Start difference. First operand has 96 places, 112 transitions, 609 flow. Second operand 4 states and 198 transitions. [2025-01-10 00:57:29,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 142 transitions, 999 flow [2025-01-10 00:57:29,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 142 transitions, 954 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 00:57:29,567 INFO L231 Difference]: Finished difference. Result has 95 places, 109 transitions, 577 flow [2025-01-10 00:57:29,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=577, PETRI_PLACES=95, PETRI_TRANSITIONS=109} [2025-01-10 00:57:29,568 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-01-10 00:57:29,568 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 109 transitions, 577 flow [2025-01-10 00:57:29,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 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-01-10 00:57:29,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:29,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:29,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:57:29,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:57:29,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1949243083, now seen corresponding path program 1 times [2025-01-10 00:57:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:29,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890785270] [2025-01-10 00:57:29,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:29,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:29,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 00:57:29,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 00:57:29,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:29,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:29,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890785270] [2025-01-10 00:57:29,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890785270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:29,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:29,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:29,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764308177] [2025-01-10 00:57:29,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:29,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:29,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:29,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:29,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 94 [2025-01-10 00:57:29,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 109 transitions, 577 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-01-10 00:57:29,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:29,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 94 [2025-01-10 00:57:29,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:29,942 INFO L124 PetriNetUnfolderBase]: 875/2032 cut-off events. [2025-01-10 00:57:29,943 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2025-01-10 00:57:29,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 2032 events. 875/2032 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11470 event pairs, 513 based on Foata normal form. 12/2033 useless extension candidates. Maximal degree in co-relation 3107. Up to 1275 conditions per place. [2025-01-10 00:57:29,950 INFO L140 encePairwiseOnDemand]: 82/94 looper letters, 89 selfloop transitions, 43 changer transitions 0/150 dead transitions. [2025-01-10 00:57:29,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 150 transitions, 1059 flow [2025-01-10 00:57:29,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:57:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:57:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 251 transitions. [2025-01-10 00:57:29,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4450354609929078 [2025-01-10 00:57:29,952 INFO L175 Difference]: Start difference. First operand has 95 places, 109 transitions, 577 flow. Second operand 6 states and 251 transitions. [2025-01-10 00:57:29,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 150 transitions, 1059 flow [2025-01-10 00:57:29,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 150 transitions, 1033 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:57:29,957 INFO L231 Difference]: Finished difference. Result has 94 places, 115 transitions, 696 flow [2025-01-10 00:57:29,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=696, PETRI_PLACES=94, PETRI_TRANSITIONS=115} [2025-01-10 00:57:29,957 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-01-10 00:57:29,957 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 115 transitions, 696 flow [2025-01-10 00:57:29,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-01-10 00:57:29,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:29,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 00:57:29,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:57:29,958 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:57:29,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash 725235584, now seen corresponding path program 1 times [2025-01-10 00:57:29,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:29,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516308374] [2025-01-10 00:57:29,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:29,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:29,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 00:57:29,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 00:57:29,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:29,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:30,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:30,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516308374] [2025-01-10 00:57:30,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516308374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:30,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:30,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:30,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326931813] [2025-01-10 00:57:30,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:30,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:30,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:30,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:30,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 94 [2025-01-10 00:57:30,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 115 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-01-10 00:57:30,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:30,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 94 [2025-01-10 00:57:30,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:30,232 INFO L124 PetriNetUnfolderBase]: 800/1946 cut-off events. [2025-01-10 00:57:30,232 INFO L125 PetriNetUnfolderBase]: For 1779/1779 co-relation queries the response was YES. [2025-01-10 00:57:30,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5895 conditions, 1946 events. 800/1946 cut-off events. For 1779/1779 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11208 event pairs, 670 based on Foata normal form. 1/1931 useless extension candidates. Maximal degree in co-relation 988. Up to 1659 conditions per place. [2025-01-10 00:57:30,240 INFO L140 encePairwiseOnDemand]: 92/94 looper letters, 0 selfloop transitions, 0 changer transitions 114/114 dead transitions. [2025-01-10 00:57:30,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 114 transitions, 848 flow [2025-01-10 00:57:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-01-10 00:57:30,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4929078014184397 [2025-01-10 00:57:30,241 INFO L175 Difference]: Start difference. First operand has 94 places, 115 transitions, 696 flow. Second operand 3 states and 139 transitions. [2025-01-10 00:57:30,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 114 transitions, 848 flow [2025-01-10 00:57:30,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 114 transitions, 847 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:57:30,249 INFO L231 Difference]: Finished difference. Result has 94 places, 0 transitions, 0 flow [2025-01-10 00:57:30,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=94, PETRI_TRANSITIONS=0} [2025-01-10 00:57:30,250 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-01-10 00:57:30,253 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 0 transitions, 0 flow [2025-01-10 00:57:30,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-01-10 00:57:30,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-01-10 00:57:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:57:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:57:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-01-10 00:57:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-01-10 00:57:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-01-10 00:57:30,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2025-01-10 00:57:30,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:57:30,257 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:30,263 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:57:30,263 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:57:30,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:57:30 BasicIcfg [2025-01-10 00:57:30,270 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:57:30,270 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:57:30,270 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:57:30,270 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:57:30,271 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:24" (3/4) ... [2025-01-10 00:57:30,272 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:57:30,279 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2025-01-10 00:57:30,279 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-10 00:57:30,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2025-01-10 00:57:30,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 00:57:30,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 00:57:30,285 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 00:57:30,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:57:30,385 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:57:30,385 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:57:30,385 INFO L158 Benchmark]: Toolchain (without parser) took 7233.33ms. Allocated memory was 167.8MB in the beginning and 897.6MB in the end (delta: 729.8MB). Free memory was 122.4MB in the beginning and 707.5MB in the end (delta: -585.1MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2025-01-10 00:57:30,385 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:57:30,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.20ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 102.2MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:57:30,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.79ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 100.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:57:30,386 INFO L158 Benchmark]: Boogie Preprocessor took 32.08ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 98.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:57:30,386 INFO L158 Benchmark]: RCFGBuilder took 442.52ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 55.8MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 00:57:30,386 INFO L158 Benchmark]: TraceAbstraction took 6258.13ms. Allocated memory was 167.8MB in the beginning and 897.6MB in the end (delta: 729.8MB). Free memory was 55.1MB in the beginning and 711.9MB in the end (delta: -656.8MB). Peak memory consumption was 531.0MB. Max. memory is 16.1GB. [2025-01-10 00:57:30,387 INFO L158 Benchmark]: Witness Printer took 114.53ms. Allocated memory is still 897.6MB. Free memory was 711.9MB in the beginning and 707.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:57:30,388 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.24ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.20ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 102.2MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.79ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 100.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.08ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 98.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 442.52ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 55.8MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6258.13ms. Allocated memory was 167.8MB in the beginning and 897.6MB in the end (delta: 729.8MB). Free memory was 55.1MB in the beginning and 711.9MB in the end (delta: -656.8MB). Peak memory consumption was 531.0MB. Max. memory is 16.1GB. * Witness Printer took 114.53ms. Allocated memory is still 897.6MB. Free memory was 711.9MB in the beginning and 707.5MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 707]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 117 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 542 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 529 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1394 IncrementalHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 15 mSDtfsCounter, 1394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=886occurred in iteration=5, InterpolantAutomatonStates: 41, 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.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 1248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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 - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 00:57:30,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE