./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.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/09-regions_09-arraylist-deref.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 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:55:26,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:26,804 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:55:26,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:26,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:26,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:26,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:26,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:26,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:26,825 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:26,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:26,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:26,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:26,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:26,825 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:26,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:26,825 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:26,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:26,826 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:26,826 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:26,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:26,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:26,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:26,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:26,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:26,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:26,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:26,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:26,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:26,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:26,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:26,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:55:26,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:55:26,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:26,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:26,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:26,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:26,828 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 -> 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 [2025-01-10 00:55:27,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:27,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:27,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:27,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:27,041 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:27,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2025-01-10 00:55:28,193 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7715269d4/e5148bbc3d814fc2ba96d51efb68e24f/FLAGa9bdb6a5e [2025-01-10 00:55:28,580 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:28,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2025-01-10 00:55:28,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7715269d4/e5148bbc3d814fc2ba96d51efb68e24f/FLAGa9bdb6a5e [2025-01-10 00:55:28,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7715269d4/e5148bbc3d814fc2ba96d51efb68e24f [2025-01-10 00:55:28,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:28,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:28,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:28,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:28,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:28,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:28" (1/1) ... [2025-01-10 00:55:28,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c07013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:28, skipping insertion in model container [2025-01-10 00:55:28,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:28" (1/1) ... [2025-01-10 00:55:28,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:29,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:29,184 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:29,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:29,308 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:29,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29 WrapperNode [2025-01-10 00:55:29,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:29,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:29,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:29,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:29,313 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:55:29" (1/1) ... [2025-01-10 00:55:29,324 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:55:29" (1/1) ... [2025-01-10 00:55:29,339 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 124 [2025-01-10 00:55:29,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:29,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:29,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:29,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:29,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,361 INFO L175 MemorySlicer]: Split 33 memory accesses to 3 slices as follows [5, 14, 14]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [5, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-01-10 00:55:29,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:29,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:29,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:29,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:29,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (1/1) ... [2025-01-10 00:55:29,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:29,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:29,398 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:55:29,403 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:55:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:55:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:55:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:55:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 00:55:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 00:55:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:55:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:55:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:55:29,418 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:55:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:55:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:55:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:55:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:29,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:29,419 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:55:29,579 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:29,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:29,852 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:29,853 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:29,983 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:29,984 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:55:29,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:29 BoogieIcfgContainer [2025-01-10 00:55:29,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:29,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:29,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:29,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:29,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:28" (1/3) ... [2025-01-10 00:55:29,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd5ce8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:29, skipping insertion in model container [2025-01-10 00:55:29,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:29" (2/3) ... [2025-01-10 00:55:29,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd5ce8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:29, skipping insertion in model container [2025-01-10 00:55:29,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:29" (3/3) ... [2025-01-10 00:55:29,990 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist-deref.i [2025-01-10 00:55:29,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:30,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_09-arraylist-deref.i that has 2 procedures, 70 locations, 1 initial locations, 0 loop locations, and 37 error locations. [2025-01-10 00:55:30,001 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:30,040 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:55:30,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 69 transitions, 142 flow [2025-01-10 00:55:30,081 INFO L124 PetriNetUnfolderBase]: 0/68 cut-off events. [2025-01-10 00:55:30,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:30,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 68 events. 0/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 164 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-10 00:55:30,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 69 transitions, 142 flow [2025-01-10 00:55:30,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 68 transitions, 139 flow [2025-01-10 00:55:30,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:30,097 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;@273faaff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:30,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 00:55:30,100 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:30,100 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:55:30,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:30,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:30,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:55:30,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:30,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash 12649, now seen corresponding path program 1 times [2025-01-10 00:55:30,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:30,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429587164] [2025-01-10 00:55:30,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:30,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:30,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:55:30,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:55:30,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:30,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:30,271 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:55:30,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:30,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429587164] [2025-01-10 00:55:30,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429587164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:30,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:30,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:30,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512260546] [2025-01-10 00:55:30,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:30,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:30,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:30,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:30,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:30,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 69 [2025-01-10 00:55:30,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:30,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:30,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 69 [2025-01-10 00:55:30,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:30,475 INFO L124 PetriNetUnfolderBase]: 63/260 cut-off events. [2025-01-10 00:55:30,475 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:30,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 260 events. 63/260 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1223 event pairs, 63 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 377. Up to 149 conditions per place. [2025-01-10 00:55:30,479 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 22 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2025-01-10 00:55:30,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 183 flow [2025-01-10 00:55:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-01-10 00:55:30,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7101449275362319 [2025-01-10 00:55:30,488 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 139 flow. Second operand 3 states and 147 transitions. [2025-01-10 00:55:30,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 183 flow [2025-01-10 00:55:30,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:30,492 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 138 flow [2025-01-10 00:55:30,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2025-01-10 00:55:30,495 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2025-01-10 00:55:30,496 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 138 flow [2025-01-10 00:55:30,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:30,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:30,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:55:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:55:30,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:30,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash 12650, now seen corresponding path program 1 times [2025-01-10 00:55:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:30,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020358222] [2025-01-10 00:55:30,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:30,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:30,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:55:30,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:55:30,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:30,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:30,586 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:55:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020358222] [2025-01-10 00:55:30,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020358222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:30,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:30,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:55:30,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039622118] [2025-01-10 00:55:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:30,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:30,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:30,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:30,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 69 [2025-01-10 00:55:30,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:30,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:30,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 69 [2025-01-10 00:55:30,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:30,729 INFO L124 PetriNetUnfolderBase]: 63/256 cut-off events. [2025-01-10 00:55:30,729 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:30,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 256 events. 63/256 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1205 event pairs, 63 based on Foata normal form. 4/205 useless extension candidates. Maximal degree in co-relation 396. Up to 149 conditions per place. [2025-01-10 00:55:30,731 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 20 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-01-10 00:55:30,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 178 flow [2025-01-10 00:55:30,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-01-10 00:55:30,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7294685990338164 [2025-01-10 00:55:30,732 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 138 flow. Second operand 3 states and 151 transitions. [2025-01-10 00:55:30,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 178 flow [2025-01-10 00:55:30,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:30,733 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 130 flow [2025-01-10 00:55:30,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-01-10 00:55:30,734 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2025-01-10 00:55:30,734 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 130 flow [2025-01-10 00:55:30,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:55:30,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:30,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:55:30,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:55:30,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:30,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash 12166573, now seen corresponding path program 1 times [2025-01-10 00:55:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:30,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833369772] [2025-01-10 00:55:30,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:30,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:55:30,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:55:30,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:30,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:30,884 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:55:30,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:30,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833369772] [2025-01-10 00:55:30,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833369772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:30,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:30,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:30,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911820893] [2025-01-10 00:55:30,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:30,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:30,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:30,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:30,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:30,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 69 [2025-01-10 00:55:30,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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:55:30,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:30,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 69 [2025-01-10 00:55:30,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:31,053 INFO L124 PetriNetUnfolderBase]: 72/274 cut-off events. [2025-01-10 00:55:31,053 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:31,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 274 events. 72/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1285 event pairs, 72 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 434. Up to 169 conditions per place. [2025-01-10 00:55:31,055 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 25 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-01-10 00:55:31,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 176 flow [2025-01-10 00:55:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-01-10 00:55:31,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2025-01-10 00:55:31,057 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 130 flow. Second operand 4 states and 183 transitions. [2025-01-10 00:55:31,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 176 flow [2025-01-10 00:55:31,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:31,058 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 118 flow [2025-01-10 00:55:31,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-01-10 00:55:31,059 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-01-10 00:55:31,059 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 118 flow [2025-01-10 00:55:31,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 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:55:31,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:31,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:55:31,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:55:31,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash 12166574, now seen corresponding path program 1 times [2025-01-10 00:55:31,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:31,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973818118] [2025-01-10 00:55:31,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:31,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:55:31,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:55:31,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:31,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:31,190 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:55:31,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:31,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973818118] [2025-01-10 00:55:31,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973818118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:31,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:31,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:31,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239526071] [2025-01-10 00:55:31,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:31,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:55:31,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:31,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:55:31,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:55:31,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2025-01-10 00:55:31,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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:55:31,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:31,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2025-01-10 00:55:31,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:31,332 INFO L124 PetriNetUnfolderBase]: 69/291 cut-off events. [2025-01-10 00:55:31,333 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:55:31,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 291 events. 69/291 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1530 event pairs, 24 based on Foata normal form. 3/231 useless extension candidates. Maximal degree in co-relation 451. Up to 124 conditions per place. [2025-01-10 00:55:31,334 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 31 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2025-01-10 00:55:31,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 204 flow [2025-01-10 00:55:31,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2025-01-10 00:55:31,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7463768115942029 [2025-01-10 00:55:31,336 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 118 flow. Second operand 4 states and 206 transitions. [2025-01-10 00:55:31,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 204 flow [2025-01-10 00:55:31,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:31,339 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 132 flow [2025-01-10 00:55:31,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-01-10 00:55:31,340 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-01-10 00:55:31,340 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 132 flow [2025-01-10 00:55:31,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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:55:31,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:31,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:31,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:55:31,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:31,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 464111316, now seen corresponding path program 1 times [2025-01-10 00:55:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:31,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561732836] [2025-01-10 00:55:31,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:31,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:55:31,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:55:31,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:31,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:31,649 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:55:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:31,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561732836] [2025-01-10 00:55:31,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561732836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:31,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:31,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:55:31,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380275230] [2025-01-10 00:55:31,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:31,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:31,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:31,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:31,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2025-01-10 00:55:31,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 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:55:31,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:31,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2025-01-10 00:55:31,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:32,165 INFO L124 PetriNetUnfolderBase]: 63/241 cut-off events. [2025-01-10 00:55:32,165 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 00:55:32,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 241 events. 63/241 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1113 event pairs, 54 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 418. Up to 126 conditions per place. [2025-01-10 00:55:32,167 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 25 selfloop transitions, 8 changer transitions 3/62 dead transitions. [2025-01-10 00:55:32,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 216 flow [2025-01-10 00:55:32,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-01-10 00:55:32,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5548654244306418 [2025-01-10 00:55:32,170 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 132 flow. Second operand 7 states and 268 transitions. [2025-01-10 00:55:32,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 216 flow [2025-01-10 00:55:32,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:32,171 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 139 flow [2025-01-10 00:55:32,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-01-10 00:55:32,172 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2025-01-10 00:55:32,172 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 139 flow [2025-01-10 00:55:32,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 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:55:32,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:32,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:32,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:55:32,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:32,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:32,176 INFO L85 PathProgramCache]: Analyzing trace with hash 464111315, now seen corresponding path program 1 times [2025-01-10 00:55:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:32,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732038073] [2025-01-10 00:55:32,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:32,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:32,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:55:32,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:55:32,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:32,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:32,349 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:55:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:32,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732038073] [2025-01-10 00:55:32,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732038073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:32,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:32,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:55:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469633380] [2025-01-10 00:55:32,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:32,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:32,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:32,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:32,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2025-01-10 00:55:32,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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:55:32,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:32,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2025-01-10 00:55:32,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:32,759 INFO L124 PetriNetUnfolderBase]: 63/239 cut-off events. [2025-01-10 00:55:32,759 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-10 00:55:32,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 239 events. 63/239 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1110 event pairs, 54 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 421. Up to 126 conditions per place. [2025-01-10 00:55:32,761 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 26 selfloop transitions, 8 changer transitions 3/60 dead transitions. [2025-01-10 00:55:32,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 225 flow [2025-01-10 00:55:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 290 transitions. [2025-01-10 00:55:32,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6004140786749482 [2025-01-10 00:55:32,762 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 139 flow. Second operand 7 states and 290 transitions. [2025-01-10 00:55:32,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 225 flow [2025-01-10 00:55:32,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 209 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:55:32,765 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 135 flow [2025-01-10 00:55:32,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2025-01-10 00:55:32,765 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-01-10 00:55:32,765 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 135 flow [2025-01-10 00:55:32,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 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:55:32,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:32,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:32,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:55:32,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:32,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash -665610695, now seen corresponding path program 1 times [2025-01-10 00:55:32,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:32,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103172179] [2025-01-10 00:55:32,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:32,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:55:32,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:55:32,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:32,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:32,930 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:55:32,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:32,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103172179] [2025-01-10 00:55:32,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103172179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:32,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:32,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:32,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677143951] [2025-01-10 00:55:32,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:32,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:32,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:32,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:32,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:33,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2025-01-10 00:55:33,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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:55:33,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:33,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2025-01-10 00:55:33,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:33,131 INFO L124 PetriNetUnfolderBase]: 63/238 cut-off events. [2025-01-10 00:55:33,131 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-10 00:55:33,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 238 events. 63/238 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1095 event pairs, 62 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 418. Up to 146 conditions per place. [2025-01-10 00:55:33,134 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 20 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2025-01-10 00:55:33,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 185 flow [2025-01-10 00:55:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2025-01-10 00:55:33,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-01-10 00:55:33,136 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 135 flow. Second operand 5 states and 225 transitions. [2025-01-10 00:55:33,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 185 flow [2025-01-10 00:55:33,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 169 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:55:33,139 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 129 flow [2025-01-10 00:55:33,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2025-01-10 00:55:33,141 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2025-01-10 00:55:33,141 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 129 flow [2025-01-10 00:55:33,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 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:55:33,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:33,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:33,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:55:33,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:33,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash -665610696, now seen corresponding path program 1 times [2025-01-10 00:55:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:33,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422989391] [2025-01-10 00:55:33,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:33,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:33,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:55:33,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:55:33,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:33,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:55:33,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:33,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422989391] [2025-01-10 00:55:33,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422989391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:33,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:33,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:33,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727399494] [2025-01-10 00:55:33,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:33,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:33,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:33,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:33,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:33,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 69 [2025-01-10 00:55:33,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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:55:33,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:33,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 69 [2025-01-10 00:55:33,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:33,396 INFO L124 PetriNetUnfolderBase]: 63/237 cut-off events. [2025-01-10 00:55:33,397 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-10 00:55:33,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 237 events. 63/237 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1106 event pairs, 62 based on Foata normal form. 1/199 useless extension candidates. Maximal degree in co-relation 408. Up to 146 conditions per place. [2025-01-10 00:55:33,399 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 22 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2025-01-10 00:55:33,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 183 flow [2025-01-10 00:55:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2025-01-10 00:55:33,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6289855072463768 [2025-01-10 00:55:33,404 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 129 flow. Second operand 5 states and 217 transitions. [2025-01-10 00:55:33,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 183 flow [2025-01-10 00:55:33,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 171 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:33,405 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 127 flow [2025-01-10 00:55:33,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2025-01-10 00:55:33,405 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2025-01-10 00:55:33,405 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 127 flow [2025-01-10 00:55:33,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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:55:33,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:33,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:33,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:55:33,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:33,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash -705953288, now seen corresponding path program 1 times [2025-01-10 00:55:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615401770] [2025-01-10 00:55:33,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:33,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:33,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:33,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:33,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:55:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615401770] [2025-01-10 00:55:33,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615401770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:33,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:33,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:33,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807474306] [2025-01-10 00:55:33,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:33,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:33,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:33,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:33,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2025-01-10 00:55:33,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:55:33,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:33,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2025-01-10 00:55:33,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:33,604 INFO L124 PetriNetUnfolderBase]: 70/253 cut-off events. [2025-01-10 00:55:33,604 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-10 00:55:33,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 253 events. 70/253 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1172 event pairs, 51 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 439. Up to 136 conditions per place. [2025-01-10 00:55:33,605 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 31 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-01-10 00:55:33,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 207 flow [2025-01-10 00:55:33,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-01-10 00:55:33,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7729468599033816 [2025-01-10 00:55:33,607 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 127 flow. Second operand 3 states and 160 transitions. [2025-01-10 00:55:33,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 207 flow [2025-01-10 00:55:33,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:33,610 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 117 flow [2025-01-10 00:55:33,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-01-10 00:55:33,611 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2025-01-10 00:55:33,611 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 117 flow [2025-01-10 00:55:33,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:55:33,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:33,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:33,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:55:33,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:33,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -705953287, now seen corresponding path program 1 times [2025-01-10 00:55:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:33,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630805895] [2025-01-10 00:55:33,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:33,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:33,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:33,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:33,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:33,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:55:33,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:33,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630805895] [2025-01-10 00:55:33,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630805895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:33,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:33,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:33,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52553389] [2025-01-10 00:55:33,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:33,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:33,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:33,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:33,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:33,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 69 [2025-01-10 00:55:33,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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:55:33,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:33,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 69 [2025-01-10 00:55:33,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:33,783 INFO L124 PetriNetUnfolderBase]: 63/231 cut-off events. [2025-01-10 00:55:33,783 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-10 00:55:33,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 231 events. 63/231 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1031 event pairs, 50 based on Foata normal form. 16/217 useless extension candidates. Maximal degree in co-relation 413. Up to 136 conditions per place. [2025-01-10 00:55:33,784 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 30 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-01-10 00:55:33,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 195 flow [2025-01-10 00:55:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-01-10 00:55:33,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2025-01-10 00:55:33,785 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 117 flow. Second operand 3 states and 162 transitions. [2025-01-10 00:55:33,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 195 flow [2025-01-10 00:55:33,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:33,786 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 113 flow [2025-01-10 00:55:33,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2025-01-10 00:55:33,787 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2025-01-10 00:55:33,787 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 113 flow [2025-01-10 00:55:33,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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:55:33,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:33,788 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:33,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:55:33,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:33,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash -464357448, now seen corresponding path program 1 times [2025-01-10 00:55:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:33,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497100118] [2025-01-10 00:55:33,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:33,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:33,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:55:33,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:55:33,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:33,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:33,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:33,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497100118] [2025-01-10 00:55:33,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497100118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:33,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:33,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:55:33,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71435729] [2025-01-10 00:55:33,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:33,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:55:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:33,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:55:33,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:55:34,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2025-01-10 00:55:34,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 113 flow. Second operand has 9 states, 9 states have (on average 41.44444444444444) internal successors, (373), 9 states have internal predecessors, (373), 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:55:34,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:34,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2025-01-10 00:55:34,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:34,427 INFO L124 PetriNetUnfolderBase]: 72/241 cut-off events. [2025-01-10 00:55:34,427 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-10 00:55:34,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 241 events. 72/241 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1042 event pairs, 54 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 446. Up to 125 conditions per place. [2025-01-10 00:55:34,428 INFO L140 encePairwiseOnDemand]: 58/69 looper letters, 31 selfloop transitions, 11 changer transitions 3/62 dead transitions. [2025-01-10 00:55:34,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 243 flow [2025-01-10 00:55:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:55:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:55:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 405 transitions. [2025-01-10 00:55:34,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-01-10 00:55:34,433 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 113 flow. Second operand 9 states and 405 transitions. [2025-01-10 00:55:34,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 243 flow [2025-01-10 00:55:34,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:34,434 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 127 flow [2025-01-10 00:55:34,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=127, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-01-10 00:55:34,435 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2025-01-10 00:55:34,435 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 127 flow [2025-01-10 00:55:34,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 41.44444444444444) internal successors, (373), 9 states have internal predecessors, (373), 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:55:34,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:34,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:34,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:55:34,437 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:34,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:34,437 INFO L85 PathProgramCache]: Analyzing trace with hash -464357449, now seen corresponding path program 1 times [2025-01-10 00:55:34,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:34,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031356255] [2025-01-10 00:55:34,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:34,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:34,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:55:34,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:55:34,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:34,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:55:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031356255] [2025-01-10 00:55:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031356255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:34,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:34,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:55:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826360409] [2025-01-10 00:55:34,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:34,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:34,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:34,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:34,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2025-01-10 00:55:34,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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:55:34,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:34,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2025-01-10 00:55:34,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:34,776 INFO L124 PetriNetUnfolderBase]: 72/231 cut-off events. [2025-01-10 00:55:34,776 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 00:55:34,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 231 events. 72/231 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 963 event pairs, 54 based on Foata normal form. 10/217 useless extension candidates. Maximal degree in co-relation 453. Up to 125 conditions per place. [2025-01-10 00:55:34,777 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 35 selfloop transitions, 7 changer transitions 3/61 dead transitions. [2025-01-10 00:55:34,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 251 flow [2025-01-10 00:55:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:55:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:55:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2025-01-10 00:55:34,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6884057971014492 [2025-01-10 00:55:34,779 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 127 flow. Second operand 6 states and 285 transitions. [2025-01-10 00:55:34,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 251 flow [2025-01-10 00:55:34,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 229 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 00:55:34,781 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 117 flow [2025-01-10 00:55:34,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2025-01-10 00:55:34,782 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2025-01-10 00:55:34,782 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 117 flow [2025-01-10 00:55:34,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 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:55:34,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:34,783 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:55:34,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:55:34,783 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:34,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:34,783 INFO L85 PathProgramCache]: Analyzing trace with hash 183735321, now seen corresponding path program 1 times [2025-01-10 00:55:34,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:34,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544292783] [2025-01-10 00:55:34,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:34,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:34,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:34,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:34,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:34,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:35,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:35,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544292783] [2025-01-10 00:55:35,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544292783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:35,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:35,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:55:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107170489] [2025-01-10 00:55:35,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:35,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:35,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:35,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:35,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:35,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 69 [2025-01-10 00:55:35,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 117 flow. Second operand has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 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:55:35,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:35,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 69 [2025-01-10 00:55:35,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:35,370 INFO L124 PetriNetUnfolderBase]: 72/244 cut-off events. [2025-01-10 00:55:35,371 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-10 00:55:35,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 244 events. 72/244 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1070 event pairs, 36 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 463. Up to 136 conditions per place. [2025-01-10 00:55:35,372 INFO L140 encePairwiseOnDemand]: 64/69 looper letters, 38 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-01-10 00:55:35,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 249 flow [2025-01-10 00:55:35,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-01-10 00:55:35,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6579710144927536 [2025-01-10 00:55:35,373 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 117 flow. Second operand 5 states and 227 transitions. [2025-01-10 00:55:35,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 249 flow [2025-01-10 00:55:35,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 223 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 00:55:35,373 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 111 flow [2025-01-10 00:55:35,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-01-10 00:55:35,374 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -21 predicate places. [2025-01-10 00:55:35,374 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 111 flow [2025-01-10 00:55:35,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.857142857142854) internal successors, (272), 7 states have internal predecessors, (272), 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:55:35,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:35,374 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:55:35,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:55:35,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:35,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1510178621, now seen corresponding path program 1 times [2025-01-10 00:55:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:35,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68469491] [2025-01-10 00:55:35,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:35,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:35,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:35,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:35,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:35,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:36,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68469491] [2025-01-10 00:55:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68469491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:55:36,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250820443] [2025-01-10 00:55:36,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:36,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 00:55:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:36,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 00:55:36,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-10 00:55:37,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 69 [2025-01-10 00:55:37,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 111 flow. Second operand has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 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:55:37,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:37,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 69 [2025-01-10 00:55:37,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:37,350 INFO L124 PetriNetUnfolderBase]: 123/352 cut-off events. [2025-01-10 00:55:37,350 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-10 00:55:37,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 352 events. 123/352 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1589 event pairs, 55 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 691. Up to 163 conditions per place. [2025-01-10 00:55:37,351 INFO L140 encePairwiseOnDemand]: 57/69 looper letters, 48 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2025-01-10 00:55:37,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 317 flow [2025-01-10 00:55:37,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:55:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:55:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 383 transitions. [2025-01-10 00:55:37,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5046113306982872 [2025-01-10 00:55:37,353 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 111 flow. Second operand 11 states and 383 transitions. [2025-01-10 00:55:37,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 317 flow [2025-01-10 00:55:37,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 295 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:37,354 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 173 flow [2025-01-10 00:55:37,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=173, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-01-10 00:55:37,355 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2025-01-10 00:55:37,355 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 173 flow [2025-01-10 00:55:37,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 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:55:37,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:37,355 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:55:37,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:55:37,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:37,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1510178622, now seen corresponding path program 1 times [2025-01-10 00:55:37,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:37,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190869996] [2025-01-10 00:55:37,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:37,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:37,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:55:37,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:55:37,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:37,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:37,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:37,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190869996] [2025-01-10 00:55:37,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190869996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:37,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:37,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 00:55:37,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692251458] [2025-01-10 00:55:37,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:37,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:55:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:37,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:55:37,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:55:38,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2025-01-10 00:55:38,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 173 flow. Second operand has 13 states, 13 states have (on average 34.23076923076923) internal successors, (445), 13 states have internal predecessors, (445), 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:55:38,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:38,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2025-01-10 00:55:38,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:39,029 INFO L124 PetriNetUnfolderBase]: 123/348 cut-off events. [2025-01-10 00:55:39,030 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-01-10 00:55:39,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 348 events. 123/348 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1571 event pairs, 34 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 751. Up to 118 conditions per place. [2025-01-10 00:55:39,032 INFO L140 encePairwiseOnDemand]: 56/69 looper letters, 44 selfloop transitions, 17 changer transitions 0/71 dead transitions. [2025-01-10 00:55:39,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 71 transitions, 341 flow [2025-01-10 00:55:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:55:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 00:55:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 424 transitions. [2025-01-10 00:55:39,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5586297760210803 [2025-01-10 00:55:39,034 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 173 flow. Second operand 11 states and 424 transitions. [2025-01-10 00:55:39,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 71 transitions, 341 flow [2025-01-10 00:55:39,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 327 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-01-10 00:55:39,038 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 217 flow [2025-01-10 00:55:39,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=217, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2025-01-10 00:55:39,038 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2025-01-10 00:55:39,038 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 217 flow [2025-01-10 00:55:39,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 34.23076923076923) internal successors, (445), 13 states have internal predecessors, (445), 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:55:39,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:39,039 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 00:55:39,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:55:39,039 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:39,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:39,039 INFO L85 PathProgramCache]: Analyzing trace with hash -262651708, now seen corresponding path program 1 times [2025-01-10 00:55:39,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:39,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626340712] [2025-01-10 00:55:39,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:39,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:55:39,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:55:39,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 00:55:39,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:39,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626340712] [2025-01-10 00:55:39,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626340712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:39,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:39,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052959047] [2025-01-10 00:55:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:39,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:39,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:39,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:39,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:39,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 69 [2025-01-10 00:55:39,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 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:55:39,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:39,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 69 [2025-01-10 00:55:39,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:39,151 INFO L124 PetriNetUnfolderBase]: 39/166 cut-off events. [2025-01-10 00:55:39,152 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-01-10 00:55:39,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 166 events. 39/166 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 591 event pairs, 15 based on Foata normal form. 9/159 useless extension candidates. Maximal degree in co-relation 389. Up to 67 conditions per place. [2025-01-10 00:55:39,153 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 30 selfloop transitions, 4 changer transitions 2/56 dead transitions. [2025-01-10 00:55:39,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 309 flow [2025-01-10 00:55:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-01-10 00:55:39,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8019323671497585 [2025-01-10 00:55:39,154 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 217 flow. Second operand 3 states and 166 transitions. [2025-01-10 00:55:39,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 309 flow [2025-01-10 00:55:39,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 273 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-01-10 00:55:39,156 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 177 flow [2025-01-10 00:55:39,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2025-01-10 00:55:39,157 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2025-01-10 00:55:39,157 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 177 flow [2025-01-10 00:55:39,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 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:55:39,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:39,157 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 00:55:39,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:55:39,157 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:55:39,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:39,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1400828105, now seen corresponding path program 1 times [2025-01-10 00:55:39,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:39,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694652123] [2025-01-10 00:55:39,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:39,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:55:39,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:55:39,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:55:39,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:55:39,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:55:39,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:55:39,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:55:39,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:55:39,239 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:55:39,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2025-01-10 00:55:39,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-01-10 00:55:39,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-01-10 00:55:39,244 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-01-10 00:55:39,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-01-10 00:55:39,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-01-10 00:55:39,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-01-10 00:55:39,245 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2025-01-10 00:55:39,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:55:39,246 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:39,282 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:55:39,282 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:55:39,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:55:39 BasicIcfg [2025-01-10 00:55:39,290 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:55:39,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:55:39,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:55:39,291 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:55:39,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:29" (3/4) ... [2025-01-10 00:55:39,292 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 00:55:39,333 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-01-10 00:55:39,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:55:39,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:55:39,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:55:39,412 INFO L158 Benchmark]: Toolchain (without parser) took 10619.90ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 104.1MB in the beginning and 234.6MB in the end (delta: -130.5MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2025-01-10 00:55:39,413 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:39,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.88ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 65.7MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 00:55:39,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.63ms. Allocated memory is still 142.6MB. Free memory was 65.7MB in the beginning and 63.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:39,413 INFO L158 Benchmark]: Boogie Preprocessor took 33.03ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 60.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:55:39,413 INFO L158 Benchmark]: RCFGBuilder took 610.97ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 66.2MB in the end (delta: -5.9MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2025-01-10 00:55:39,413 INFO L158 Benchmark]: TraceAbstraction took 9304.08ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 65.4MB in the beginning and 243.0MB in the end (delta: -177.6MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2025-01-10 00:55:39,414 INFO L158 Benchmark]: Witness Printer took 121.47ms. Allocated memory is still 360.7MB. Free memory was 243.0MB in the beginning and 234.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:55:39,415 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.32ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.88ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 65.7MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.63ms. Allocated memory is still 142.6MB. Free memory was 65.7MB in the beginning and 63.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.03ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 60.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 610.97ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 66.2MB in the end (delta: -5.9MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9304.08ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 65.4MB in the beginning and 243.0MB in the end (delta: -177.6MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * Witness Printer took 121.47ms. Allocated memory is still 360.7MB. Free memory was 243.0MB in the beginning and 234.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int j = __VERIFIER_nondet_int(); [L1255] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1255] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1256] 0 pthread_t t1; [L1257] 0 struct s *p; [L1258] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1258] RET, EXPR 0 new(1) [L1258] 0 slot[j] = new(1) [L1259] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1259] RET, EXPR 0 new(2) [L1259] EXPR 0 slot[j] [L1259] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1259] RET 0 list_add(new(2), slot[j]) [L1260] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, mutex={1:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, i=8, mutex={1:0}, slot={2:0}] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1260]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 95 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3009 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2162 mSDsluCounter, 1266 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1191 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8442 IncrementalHoareTripleChecker+Invalid, 8562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 75 mSDtfsCounter, 8442 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=15, InterpolantAutomatonStates: 89, 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.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 1928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-10 00:55:39,440 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)