./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_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/36-apron_21-traces-cluster-based_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 cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:00:16,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:00:16,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:00:16,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:00:16,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:00:16,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:00:16,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:00:16,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:00:16,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:00:16,180 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:00:16,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:00:16,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:00:16,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:00:16,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:00:16,181 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:00:16,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:00:16,181 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:00:16,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:16,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:16,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:16,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:00:16,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:00:16,184 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 -> cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 [2025-01-10 01:00:16,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:00:16,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:00:16,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:00:16,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:00:16,449 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:00:16,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-01-10 01:00:17,544 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49bbf294e/40ac3f43a02d4f149933f4c34b39d67b/FLAG3ada8ef04 [2025-01-10 01:00:17,797 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:00:17,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-01-10 01:00:17,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49bbf294e/40ac3f43a02d4f149933f4c34b39d67b/FLAG3ada8ef04 [2025-01-10 01:00:18,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49bbf294e/40ac3f43a02d4f149933f4c34b39d67b [2025-01-10 01:00:18,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:00:18,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:00:18,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:18,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:00:18,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:00:18,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116a02a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18, skipping insertion in model container [2025-01-10 01:00:18,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:00:18,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:18,412 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:00:18,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:00:18,490 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:00:18,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18 WrapperNode [2025-01-10 01:00:18,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:00:18,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:18,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:00:18,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:00:18,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,530 INFO L138 Inliner]: procedures = 165, calls = 42, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 145 [2025-01-10 01:00:18,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:00:18,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:00:18,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:00:18,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:00:18,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,554 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-01-10 01:00:18,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:00:18,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:00:18,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:00:18,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:00:18,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (1/1) ... [2025-01-10 01:00:18,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:00:18,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:00:18,589 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 01:00:18,591 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 01:00:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-01-10 01:00:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-01-10 01:00:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 01:00:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:00:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2025-01-10 01:00:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2025-01-10 01:00:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 01:00:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 01:00:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:00:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:00:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:00:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 01:00:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:00:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:00:18,607 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 01:00:18,708 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:00:18,709 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:00:18,937 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:00:18,937 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:00:19,053 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:00:19,053 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:00:19,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:19 BoogieIcfgContainer [2025-01-10 01:00:19,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:00:19,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:00:19,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:00:19,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:00:19,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:00:18" (1/3) ... [2025-01-10 01:00:19,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a5ff84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:19, skipping insertion in model container [2025-01-10 01:00:19,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:00:18" (2/3) ... [2025-01-10 01:00:19,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a5ff84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:00:19, skipping insertion in model container [2025-01-10 01:00:19,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:00:19" (3/3) ... [2025-01-10 01:00:19,062 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2025-01-10 01:00:19,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:00:19,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_21-traces-cluster-based_true.i that has 4 procedures, 74 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-01-10 01:00:19,072 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:00:19,124 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:00:19,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 176 flow [2025-01-10 01:00:19,202 INFO L124 PetriNetUnfolderBase]: 9/79 cut-off events. [2025-01-10 01:00:19,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:00:19,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 79 events. 9/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2025-01-10 01:00:19,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 176 flow [2025-01-10 01:00:19,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 79 transitions, 167 flow [2025-01-10 01:00:19,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:00:19,234 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;@50b9e9ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:00:19,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 01:00:19,253 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:00:19,253 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2025-01-10 01:00:19,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:00:19,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:19,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:19,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 01:00:19,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1880598954, now seen corresponding path program 1 times [2025-01-10 01:00:19,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:19,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598258524] [2025-01-10 01:00:19,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:19,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:19,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:00:19,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:00:19,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:19,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:19,582 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 01:00:19,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:19,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598258524] [2025-01-10 01:00:19,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598258524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:19,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:19,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:19,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614229992] [2025-01-10 01:00:19,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:19,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:19,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:19,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:19,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 82 [2025-01-10 01:00:19,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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 01:00:19,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:19,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 82 [2025-01-10 01:00:19,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:23,393 INFO L124 PetriNetUnfolderBase]: 43763/66795 cut-off events. [2025-01-10 01:00:23,394 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-01-10 01:00:23,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127894 conditions, 66795 events. 43763/66795 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 1642. Compared 519114 event pairs, 10183 based on Foata normal form. 9296/75411 useless extension candidates. Maximal degree in co-relation 127883. Up to 16083 conditions per place. [2025-01-10 01:00:23,752 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 218 selfloop transitions, 11 changer transitions 0/250 dead transitions. [2025-01-10 01:00:23,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 250 transitions, 988 flow [2025-01-10 01:00:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:00:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:00:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 467 transitions. [2025-01-10 01:00:23,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.711890243902439 [2025-01-10 01:00:23,763 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 167 flow. Second operand 8 states and 467 transitions. [2025-01-10 01:00:23,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 250 transitions, 988 flow [2025-01-10 01:00:23,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 250 transitions, 978 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:00:23,777 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 201 flow [2025-01-10 01:00:23,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=201, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2025-01-10 01:00:23,782 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 4 predicate places. [2025-01-10 01:00:23,783 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 201 flow [2025-01-10 01:00:23,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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 01:00:23,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:23,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:23,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:00:23,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 01:00:23,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1634123195, now seen corresponding path program 1 times [2025-01-10 01:00:23,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:23,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005023586] [2025-01-10 01:00:23,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:23,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:23,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:00:23,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:00:23,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:23,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:24,026 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 01:00:24,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:24,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005023586] [2025-01-10 01:00:24,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005023586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:24,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167540303] [2025-01-10 01:00:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:24,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:24,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:24,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:24,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 82 [2025-01-10 01:00:24,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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 01:00:24,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:24,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 82 [2025-01-10 01:00:24,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:28,659 INFO L124 PetriNetUnfolderBase]: 58899/92217 cut-off events. [2025-01-10 01:00:28,660 INFO L125 PetriNetUnfolderBase]: For 17605/17605 co-relation queries the response was YES. [2025-01-10 01:00:28,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194647 conditions, 92217 events. 58899/92217 cut-off events. For 17605/17605 co-relation queries the response was YES. Maximal size of possible extension queue 2503. Compared 771975 event pairs, 12885 based on Foata normal form. 0/90733 useless extension candidates. Maximal degree in co-relation 194633. Up to 35145 conditions per place. [2025-01-10 01:00:29,177 INFO L140 encePairwiseOnDemand]: 70/82 looper letters, 205 selfloop transitions, 19 changer transitions 0/245 dead transitions. [2025-01-10 01:00:29,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 245 transitions, 1128 flow [2025-01-10 01:00:29,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:00:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:00:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 384 transitions. [2025-01-10 01:00:29,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-01-10 01:00:29,180 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 201 flow. Second operand 8 states and 384 transitions. [2025-01-10 01:00:29,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 245 transitions, 1128 flow [2025-01-10 01:00:30,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 245 transitions, 1128 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:00:30,193 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 310 flow [2025-01-10 01:00:30,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=310, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2025-01-10 01:00:30,194 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 15 predicate places. [2025-01-10 01:00:30,194 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 310 flow [2025-01-10 01:00:30,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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 01:00:30,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:30,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:30,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:00:30,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 01:00:30,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2104850499, now seen corresponding path program 1 times [2025-01-10 01:00:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:30,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166758614] [2025-01-10 01:00:30,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:30,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:00:30,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:00:30,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:30,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:30,432 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 01:00:30,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:30,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166758614] [2025-01-10 01:00:30,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166758614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:30,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:30,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:00:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134547564] [2025-01-10 01:00:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:30,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:00:30,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:30,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:00:30,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:00:30,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 82 [2025-01-10 01:00:30,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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 01:00:30,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:30,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 82 [2025-01-10 01:00:30,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:37,059 INFO L124 PetriNetUnfolderBase]: 76220/124239 cut-off events. [2025-01-10 01:00:37,059 INFO L125 PetriNetUnfolderBase]: For 50931/50931 co-relation queries the response was YES. [2025-01-10 01:00:37,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285901 conditions, 124239 events. 76220/124239 cut-off events. For 50931/50931 co-relation queries the response was YES. Maximal size of possible extension queue 3684. Compared 1145378 event pairs, 28525 based on Foata normal form. 0/122559 useless extension candidates. Maximal degree in co-relation 285881. Up to 54199 conditions per place. [2025-01-10 01:00:37,749 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 241 selfloop transitions, 17 changer transitions 0/282 dead transitions. [2025-01-10 01:00:37,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 282 transitions, 1516 flow [2025-01-10 01:00:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:00:37,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:00:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 398 transitions. [2025-01-10 01:00:37,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6067073170731707 [2025-01-10 01:00:37,751 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 310 flow. Second operand 8 states and 398 transitions. [2025-01-10 01:00:37,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 282 transitions, 1516 flow [2025-01-10 01:00:40,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 282 transitions, 1516 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:00:40,692 INFO L231 Difference]: Finished difference. Result has 106 places, 102 transitions, 419 flow [2025-01-10 01:00:40,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=419, PETRI_PLACES=106, PETRI_TRANSITIONS=102} [2025-01-10 01:00:40,692 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 26 predicate places. [2025-01-10 01:00:40,692 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 102 transitions, 419 flow [2025-01-10 01:00:40,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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 01:00:40,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:40,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:40,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:00:40,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 01:00:40,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2120303021, now seen corresponding path program 1 times [2025-01-10 01:00:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:40,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131937687] [2025-01-10 01:00:40,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:40,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:40,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:00:40,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:00:40,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:40,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:40,761 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 01:00:40,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:40,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131937687] [2025-01-10 01:00:40,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131937687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:40,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:40,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:00:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315375234] [2025-01-10 01:00:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:40,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:40,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:40,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:40,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:40,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 82 [2025-01-10 01:00:40,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 102 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 01:00:40,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:40,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 82 [2025-01-10 01:00:40,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:00:46,481 INFO L124 PetriNetUnfolderBase]: 56779/95146 cut-off events. [2025-01-10 01:00:46,481 INFO L125 PetriNetUnfolderBase]: For 60051/60051 co-relation queries the response was YES. [2025-01-10 01:00:46,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241973 conditions, 95146 events. 56779/95146 cut-off events. For 60051/60051 co-relation queries the response was YES. Maximal size of possible extension queue 3467. Compared 907642 event pairs, 20960 based on Foata normal form. 3727/98728 useless extension candidates. Maximal degree in co-relation 241947. Up to 51317 conditions per place. [2025-01-10 01:00:47,312 INFO L140 encePairwiseOnDemand]: 69/82 looper letters, 132 selfloop transitions, 13 changer transitions 0/171 dead transitions. [2025-01-10 01:00:47,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 171 transitions, 1028 flow [2025-01-10 01:00:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:00:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:00:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-01-10 01:00:47,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626016260162602 [2025-01-10 01:00:47,314 INFO L175 Difference]: Start difference. First operand has 106 places, 102 transitions, 419 flow. Second operand 3 states and 163 transitions. [2025-01-10 01:00:47,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 171 transitions, 1028 flow [2025-01-10 01:00:50,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 171 transitions, 1028 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:00:50,612 INFO L231 Difference]: Finished difference. Result has 109 places, 110 transitions, 490 flow [2025-01-10 01:00:50,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=109, PETRI_TRANSITIONS=110} [2025-01-10 01:00:50,613 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 29 predicate places. [2025-01-10 01:00:50,613 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 110 transitions, 490 flow [2025-01-10 01:00:50,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 01:00:50,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:00:50,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:00:50,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:00:50,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-01-10 01:00:50,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:00:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash 875421250, now seen corresponding path program 1 times [2025-01-10 01:00:50,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:00:50,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233805267] [2025-01-10 01:00:50,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:00:50,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:00:50,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:00:50,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:00:50,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:00:50,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:00:50,659 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 01:00:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:00:50,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233805267] [2025-01-10 01:00:50,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233805267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:00:50,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:00:50,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:00:50,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277104061] [2025-01-10 01:00:50,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:00:50,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:00:50,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:00:50,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:00:50,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:00:50,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 82 [2025-01-10 01:00:50,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 01:00:50,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:00:50,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 82 [2025-01-10 01:00:50,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand