./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-wip.fs.system-includes-da04345-m [2025-04-30 10:35:28,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:35:28,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:35:28,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:35:28,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:35:28,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:35:28,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:35:28,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:35:28,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:35:28,860 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:35:28,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:35:28,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:35:28,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:35:28,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:35:28,861 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:35:28,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:35:28,861 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:35:28,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:35:28,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:28,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:28,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:28,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:35:28,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:35:28,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:35:28,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:35:28,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:35:28,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:35:28,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:35:28,863 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/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-04-30 10:35:29,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:35:29,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:35:29,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:35:29,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:35:29,070 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:35:29,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist-deref.i [2025-04-30 10:35:30,327 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d65c40c/b652f264ae4241abb541949ef8c0783f/FLAG2952169e9 [2025-04-30 10:35:30,582 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:35:30,585 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist-deref.i [2025-04-30 10:35:30,603 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d65c40c/b652f264ae4241abb541949ef8c0783f/FLAG2952169e9 [2025-04-30 10:35:31,529 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d65c40c/b652f264ae4241abb541949ef8c0783f [2025-04-30 10:35:31,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:35:31,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:35:31,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:31,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:35:31,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:35:31,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:31" (1/1) ... [2025-04-30 10:35:31,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123200a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:31, skipping insertion in model container [2025-04-30 10:35:31,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:31" (1/1) ... [2025-04-30 10:35:31,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:35:31,973 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:31,983 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:35:32,054 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:32,111 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:35:32,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32 WrapperNode [2025-04-30 10:35:32,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:32,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:32,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:35:32,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:35:32,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,166 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 124 [2025-04-30 10:35:32,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:32,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:35:32,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:35:32,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:35:32,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,205 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-04-30 10:35:32,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,214 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:35:32,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:35:32,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:35:32,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:35:32,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (1/1) ... [2025-04-30 10:35:32,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:32,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:32,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:35:32,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:35:32,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:35:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:35:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:35:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:35:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:35:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:35:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:35:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:35:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:35:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:35:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:35:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:35:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:35:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:35:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:35:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:35:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:35:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:35:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:35:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:35:32,272 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:35:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:35:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:35:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:35:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:35:32,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:35:32,274 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:35:32,415 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:35:32,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:35:32,721 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:35:32,722 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:35:32,897 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:35:32,898 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:35:32,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:32 BoogieIcfgContainer [2025-04-30 10:35:32,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:35:32,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:35:32,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:35:32,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:35:32,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:35:31" (1/3) ... [2025-04-30 10:35:32,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2449f803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:32, skipping insertion in model container [2025-04-30 10:35:32,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:32" (2/3) ... [2025-04-30 10:35:32,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2449f803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:32, skipping insertion in model container [2025-04-30 10:35:32,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:32" (3/3) ... [2025-04-30 10:35:32,907 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist-deref.i [2025-04-30 10:35:32,917 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:35:32,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_09-arraylist-deref.i that has 2 procedures, 70 locations, 68 edges, 1 initial locations, 0 loop locations, and 37 error locations. [2025-04-30 10:35:32,919 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:35:32,975 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:35:33,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 69 transitions, 142 flow [2025-04-30 10:35:33,037 INFO L116 PetriNetUnfolderBase]: 0/68 cut-off events. [2025-04-30 10:35:33,040 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:33,041 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-04-30 10:35:33,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 69 transitions, 142 flow [2025-04-30 10:35:33,044 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 68 transitions, 139 flow [2025-04-30 10:35:33,049 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:35:33,057 INFO L340 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;@4529c631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:35:33,057 INFO L341 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-04-30 10:35:33,059 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:35:33,060 INFO L116 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-04-30 10:35:33,060 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:33,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:33,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-30 10:35:33,061 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:33,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 12649, now seen corresponding path program 1 times [2025-04-30 10:35:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:33,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10028562] [2025-04-30 10:35:33,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:33,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:33,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-30 10:35:33,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-30 10:35:33,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:33,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:33,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:33,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10028562] [2025-04-30 10:35:33,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10028562] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:33,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:33,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:35:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841920424] [2025-04-30 10:35:33,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:33,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:33,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:33,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:33,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:33,363 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 69 [2025-04-30 10:35:33,365 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-04-30 10:35:33,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:33,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 69 [2025-04-30 10:35:33,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:33,454 INFO L116 PetriNetUnfolderBase]: 63/260 cut-off events. [2025-04-30 10:35:33,455 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:33,457 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-04-30 10:35:33,460 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 22 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2025-04-30 10:35:33,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 183 flow [2025-04-30 10:35:33,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-04-30 10:35:33,471 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7101449275362319 [2025-04-30 10:35:33,473 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 139 flow. Second operand 3 states and 147 transitions. [2025-04-30 10:35:33,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 183 flow [2025-04-30 10:35:33,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:33,480 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 138 flow [2025-04-30 10:35:33,482 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-04-30 10:35:33,486 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2025-04-30 10:35:33,486 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 138 flow [2025-04-30 10:35:33,486 INFO L486 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-04-30 10:35:33,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:33,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-30 10:35:33,487 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:35:33,487 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:33,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:33,487 INFO L85 PathProgramCache]: Analyzing trace with hash 12650, now seen corresponding path program 1 times [2025-04-30 10:35:33,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:33,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368152127] [2025-04-30 10:35:33,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:33,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:33,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-30 10:35:33,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-30 10:35:33,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:33,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:33,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368152127] [2025-04-30 10:35:33,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368152127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:33,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:33,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:35:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877533314] [2025-04-30 10:35:33,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:33,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:33,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:33,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:33,687 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 69 [2025-04-30 10:35:33,688 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-04-30 10:35:33,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:33,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 69 [2025-04-30 10:35:33,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:33,785 INFO L116 PetriNetUnfolderBase]: 63/256 cut-off events. [2025-04-30 10:35:33,787 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:35:33,787 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-04-30 10:35:33,788 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 20 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-04-30 10:35:33,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 178 flow [2025-04-30 10:35:33,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-04-30 10:35:33,791 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7294685990338164 [2025-04-30 10:35:33,791 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 138 flow. Second operand 3 states and 151 transitions. [2025-04-30 10:35:33,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 178 flow [2025-04-30 10:35:33,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:33,792 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 130 flow [2025-04-30 10:35:33,792 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-04-30 10:35:33,793 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2025-04-30 10:35:33,793 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 130 flow [2025-04-30 10:35:33,793 INFO L486 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-04-30 10:35:33,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:33,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-30 10:35:33,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:35:33,793 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:33,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash 12166573, now seen corresponding path program 1 times [2025-04-30 10:35:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:33,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411710028] [2025-04-30 10:35:33,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:33,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:33,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:35:33,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:35:33,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:33,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:33,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411710028] [2025-04-30 10:35:33,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411710028] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:33,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:33,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:35:33,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409453111] [2025-04-30 10:35:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:33,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:33,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:33,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:34,064 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 69 [2025-04-30 10:35:34,064 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-04-30 10:35:34,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:34,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 69 [2025-04-30 10:35:34,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:34,151 INFO L116 PetriNetUnfolderBase]: 72/274 cut-off events. [2025-04-30 10:35:34,151 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:34,152 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-04-30 10:35:34,153 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 25 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-04-30 10:35:34,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 176 flow [2025-04-30 10:35:34,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:35:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:35:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2025-04-30 10:35:34,154 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2025-04-30 10:35:34,154 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 130 flow. Second operand 4 states and 183 transitions. [2025-04-30 10:35:34,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 176 flow [2025-04-30 10:35:34,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:34,155 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 118 flow [2025-04-30 10:35:34,156 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-04-30 10:35:34,156 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-04-30 10:35:34,156 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 118 flow [2025-04-30 10:35:34,156 INFO L486 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-04-30 10:35:34,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:34,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-30 10:35:34,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:35:34,157 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:34,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash 12166574, now seen corresponding path program 1 times [2025-04-30 10:35:34,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:34,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678655280] [2025-04-30 10:35:34,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:34,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:34,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:35:34,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:35:34,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:34,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:34,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:34,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678655280] [2025-04-30 10:35:34,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678655280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:34,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:34,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:34,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984315812] [2025-04-30 10:35:34,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:34,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:35:34,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:34,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:35:34,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:35:34,406 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2025-04-30 10:35:34,407 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-04-30 10:35:34,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:34,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2025-04-30 10:35:34,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:34,490 INFO L116 PetriNetUnfolderBase]: 69/291 cut-off events. [2025-04-30 10:35:34,491 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:35:34,491 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-04-30 10:35:34,492 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 31 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2025-04-30 10:35:34,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 204 flow [2025-04-30 10:35:34,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:35:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:35:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2025-04-30 10:35:34,494 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7463768115942029 [2025-04-30 10:35:34,494 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 118 flow. Second operand 4 states and 206 transitions. [2025-04-30 10:35:34,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 204 flow [2025-04-30 10:35:34,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:34,497 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 132 flow [2025-04-30 10:35:34,497 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-04-30 10:35:34,498 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-04-30 10:35:34,498 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 132 flow [2025-04-30 10:35:34,498 INFO L486 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-04-30 10:35:34,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:34,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:34,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:35:34,498 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:34,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash 464111316, now seen corresponding path program 1 times [2025-04-30 10:35:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:34,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722304853] [2025-04-30 10:35:34,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:34,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:35:34,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:35:34,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:34,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:34,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:34,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722304853] [2025-04-30 10:35:34,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722304853] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:34,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:34,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:35:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882297281] [2025-04-30 10:35:34,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:34,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:34,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:34,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:35,176 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2025-04-30 10:35:35,177 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-04-30 10:35:35,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:35,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2025-04-30 10:35:35,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:35,339 INFO L116 PetriNetUnfolderBase]: 63/241 cut-off events. [2025-04-30 10:35:35,339 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-30 10:35:35,340 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-04-30 10:35:35,341 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 25 selfloop transitions, 8 changer transitions 3/62 dead transitions. [2025-04-30 10:35:35,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 216 flow [2025-04-30 10:35:35,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-04-30 10:35:35,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5548654244306418 [2025-04-30 10:35:35,344 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 132 flow. Second operand 7 states and 268 transitions. [2025-04-30 10:35:35,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 216 flow [2025-04-30 10:35:35,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:35,346 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 139 flow [2025-04-30 10:35:35,346 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-04-30 10:35:35,346 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2025-04-30 10:35:35,348 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 139 flow [2025-04-30 10:35:35,348 INFO L486 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-04-30 10:35:35,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:35,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:35,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:35:35,348 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:35,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash 464111315, now seen corresponding path program 1 times [2025-04-30 10:35:35,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:35,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965793620] [2025-04-30 10:35:35,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:35,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:35,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:35:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:35:35,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:35,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:35,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:35,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965793620] [2025-04-30 10:35:35,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965793620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:35,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:35,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:35:35,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180173029] [2025-04-30 10:35:35,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:35,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:35,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:35,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:35,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:35,804 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2025-04-30 10:35:35,805 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-04-30 10:35:35,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:35,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2025-04-30 10:35:35,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:35,934 INFO L116 PetriNetUnfolderBase]: 63/239 cut-off events. [2025-04-30 10:35:35,934 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-30 10:35:35,935 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 1106 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-04-30 10:35:35,936 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 26 selfloop transitions, 8 changer transitions 3/60 dead transitions. [2025-04-30 10:35:35,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 225 flow [2025-04-30 10:35:35,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 290 transitions. [2025-04-30 10:35:35,937 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6004140786749482 [2025-04-30 10:35:35,937 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 139 flow. Second operand 7 states and 290 transitions. [2025-04-30 10:35:35,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 225 flow [2025-04-30 10:35:35,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 209 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:35:35,939 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 135 flow [2025-04-30 10:35:35,939 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-04-30 10:35:35,939 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-04-30 10:35:35,939 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 135 flow [2025-04-30 10:35:35,939 INFO L486 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-04-30 10:35:35,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:35,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:35,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:35:35,940 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:35,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash -665610695, now seen corresponding path program 1 times [2025-04-30 10:35:35,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:35,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311111471] [2025-04-30 10:35:35,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:35,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:35,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:35:35,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:35:35,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:35,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:36,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:36,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311111471] [2025-04-30 10:35:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311111471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:36,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:36,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160786988] [2025-04-30 10:35:36,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:36,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:36,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:36,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:36,155 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2025-04-30 10:35:36,156 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-04-30 10:35:36,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:36,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2025-04-30 10:35:36,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:36,230 INFO L116 PetriNetUnfolderBase]: 63/238 cut-off events. [2025-04-30 10:35:36,231 INFO L117 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-04-30 10:35:36,231 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 1103 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-04-30 10:35:36,232 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 20 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2025-04-30 10:35:36,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 185 flow [2025-04-30 10:35:36,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2025-04-30 10:35:36,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-04-30 10:35:36,233 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 135 flow. Second operand 5 states and 225 transitions. [2025-04-30 10:35:36,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 185 flow [2025-04-30 10:35:36,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 169 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:35:36,235 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 129 flow [2025-04-30 10:35:36,235 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-04-30 10:35:36,235 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2025-04-30 10:35:36,235 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 129 flow [2025-04-30 10:35:36,235 INFO L486 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-04-30 10:35:36,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:36,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:36,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:35:36,236 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:36,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash -665610696, now seen corresponding path program 1 times [2025-04-30 10:35:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:36,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757725682] [2025-04-30 10:35:36,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:36,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:35:36,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:35:36,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:36,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:35:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:36,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757725682] [2025-04-30 10:35:36,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757725682] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:36,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:36,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418241705] [2025-04-30 10:35:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:36,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:36,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:36,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:36,376 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 69 [2025-04-30 10:35:36,377 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-04-30 10:35:36,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:36,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 69 [2025-04-30 10:35:36,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:36,449 INFO L116 PetriNetUnfolderBase]: 63/237 cut-off events. [2025-04-30 10:35:36,451 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-30 10:35:36,451 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 1107 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-04-30 10:35:36,452 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 22 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2025-04-30 10:35:36,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 183 flow [2025-04-30 10:35:36,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2025-04-30 10:35:36,453 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6289855072463768 [2025-04-30 10:35:36,453 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 129 flow. Second operand 5 states and 217 transitions. [2025-04-30 10:35:36,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 183 flow [2025-04-30 10:35:36,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 171 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:36,455 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 127 flow [2025-04-30 10:35:36,456 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-04-30 10:35:36,457 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2025-04-30 10:35:36,457 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 127 flow [2025-04-30 10:35:36,457 INFO L486 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-04-30 10:35:36,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:36,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:36,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:35:36,458 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:36,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash -705953288, now seen corresponding path program 1 times [2025-04-30 10:35:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:36,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465451960] [2025-04-30 10:35:36,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:36,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:36,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:36,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:36,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:36,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:35:36,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:36,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465451960] [2025-04-30 10:35:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465451960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:36,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:36,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5514733] [2025-04-30 10:35:36,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:36,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:36,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:36,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:36,554 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2025-04-30 10:35:36,555 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-04-30 10:35:36,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:36,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2025-04-30 10:35:36,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:36,628 INFO L116 PetriNetUnfolderBase]: 70/253 cut-off events. [2025-04-30 10:35:36,629 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-30 10:35:36,629 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-04-30 10:35:36,630 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 31 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-04-30 10:35:36,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 207 flow [2025-04-30 10:35:36,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:36,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-04-30 10:35:36,631 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7729468599033816 [2025-04-30 10:35:36,631 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 127 flow. Second operand 3 states and 160 transitions. [2025-04-30 10:35:36,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 207 flow [2025-04-30 10:35:36,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:36,634 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 117 flow [2025-04-30 10:35:36,634 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-04-30 10:35:36,635 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2025-04-30 10:35:36,635 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 117 flow [2025-04-30 10:35:36,635 INFO L486 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-04-30 10:35:36,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:36,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:36,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:35:36,635 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:36,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:36,635 INFO L85 PathProgramCache]: Analyzing trace with hash -705953287, now seen corresponding path program 1 times [2025-04-30 10:35:36,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:36,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880891109] [2025-04-30 10:35:36,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:36,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:36,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:36,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:36,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:36,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:35:36,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:36,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880891109] [2025-04-30 10:35:36,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880891109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:36,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:36,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:36,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745720548] [2025-04-30 10:35:36,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:36,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:36,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:36,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:36,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:36,734 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 69 [2025-04-30 10:35:36,735 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-04-30 10:35:36,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:36,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 69 [2025-04-30 10:35:36,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:36,791 INFO L116 PetriNetUnfolderBase]: 63/231 cut-off events. [2025-04-30 10:35:36,792 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-30 10:35:36,792 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 1032 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-04-30 10:35:36,793 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 30 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-04-30 10:35:36,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 195 flow [2025-04-30 10:35:36,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-04-30 10:35:36,794 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2025-04-30 10:35:36,794 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 117 flow. Second operand 3 states and 162 transitions. [2025-04-30 10:35:36,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 195 flow [2025-04-30 10:35:36,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:36,795 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 113 flow [2025-04-30 10:35:36,795 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-04-30 10:35:36,795 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2025-04-30 10:35:36,795 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 113 flow [2025-04-30 10:35:36,796 INFO L486 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-04-30 10:35:36,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:36,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:36,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:35:36,796 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:36,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash -464357448, now seen corresponding path program 1 times [2025-04-30 10:35:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:36,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788292144] [2025-04-30 10:35:36,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:36,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:36,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:35:36,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:35:36,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:36,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:37,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788292144] [2025-04-30 10:35:37,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788292144] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:37,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:37,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:35:37,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867715854] [2025-04-30 10:35:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:37,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:35:37,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:37,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:35:37,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:35:37,271 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2025-04-30 10:35:37,273 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-04-30 10:35:37,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:37,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2025-04-30 10:35:37,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:37,423 INFO L116 PetriNetUnfolderBase]: 72/241 cut-off events. [2025-04-30 10:35:37,423 INFO L117 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-04-30 10:35:37,423 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 1041 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-04-30 10:35:37,424 INFO L140 encePairwiseOnDemand]: 58/69 looper letters, 31 selfloop transitions, 11 changer transitions 3/62 dead transitions. [2025-04-30 10:35:37,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 243 flow [2025-04-30 10:35:37,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:35:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:35:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 405 transitions. [2025-04-30 10:35:37,426 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2025-04-30 10:35:37,426 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 113 flow. Second operand 9 states and 405 transitions. [2025-04-30 10:35:37,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 243 flow [2025-04-30 10:35:37,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:37,427 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 127 flow [2025-04-30 10:35:37,427 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-04-30 10:35:37,428 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2025-04-30 10:35:37,428 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 127 flow [2025-04-30 10:35:37,428 INFO L486 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-04-30 10:35:37,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:37,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:37,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:35:37,428 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:37,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash -464357449, now seen corresponding path program 1 times [2025-04-30 10:35:37,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:37,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808124773] [2025-04-30 10:35:37,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:37,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:35:37,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:35:37,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:37,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:35:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:37,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808124773] [2025-04-30 10:35:37,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808124773] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:37,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:37,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:35:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025290485] [2025-04-30 10:35:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:37,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:35:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:37,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:35:37,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:35:37,619 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2025-04-30 10:35:37,620 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-04-30 10:35:37,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:37,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2025-04-30 10:35:37,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:37,714 INFO L116 PetriNetUnfolderBase]: 72/231 cut-off events. [2025-04-30 10:35:37,714 INFO L117 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-04-30 10:35:37,715 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-04-30 10:35:37,715 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 35 selfloop transitions, 7 changer transitions 3/61 dead transitions. [2025-04-30 10:35:37,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 251 flow [2025-04-30 10:35:37,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:35:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:35:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2025-04-30 10:35:37,717 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6884057971014492 [2025-04-30 10:35:37,717 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 127 flow. Second operand 6 states and 285 transitions. [2025-04-30 10:35:37,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 251 flow [2025-04-30 10:35:37,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 229 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-30 10:35:37,718 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 117 flow [2025-04-30 10:35:37,718 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-04-30 10:35:37,719 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2025-04-30 10:35:37,719 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 117 flow [2025-04-30 10:35:37,719 INFO L486 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-04-30 10:35:37,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:37,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:37,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:35:37,719 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:37,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash 183735321, now seen corresponding path program 1 times [2025-04-30 10:35:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:37,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715815816] [2025-04-30 10:35:37,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:37,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:35:37,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:35:37,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:37,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:37,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:37,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715815816] [2025-04-30 10:35:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715815816] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:37,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:37,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:35:37,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775244212] [2025-04-30 10:35:37,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:37,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:37,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:37,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:38,151 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 69 [2025-04-30 10:35:38,152 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-04-30 10:35:38,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:38,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 69 [2025-04-30 10:35:38,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:38,251 INFO L116 PetriNetUnfolderBase]: 72/244 cut-off events. [2025-04-30 10:35:38,252 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-30 10:35:38,252 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 1069 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-04-30 10:35:38,253 INFO L140 encePairwiseOnDemand]: 64/69 looper letters, 38 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2025-04-30 10:35:38,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 249 flow [2025-04-30 10:35:38,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-04-30 10:35:38,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6579710144927536 [2025-04-30 10:35:38,254 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 117 flow. Second operand 5 states and 227 transitions. [2025-04-30 10:35:38,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 249 flow [2025-04-30 10:35:38,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 223 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:35:38,255 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 111 flow [2025-04-30 10:35:38,255 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-04-30 10:35:38,256 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -21 predicate places. [2025-04-30 10:35:38,256 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 111 flow [2025-04-30 10:35:38,256 INFO L486 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-04-30 10:35:38,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:38,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:38,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:35:38,256 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:38,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:38,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1510178621, now seen corresponding path program 1 times [2025-04-30 10:35:38,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:38,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110388794] [2025-04-30 10:35:38,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:38,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:38,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:35:38,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:35:38,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:38,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:38,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110388794] [2025-04-30 10:35:38,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110388794] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:38,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:38,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:35:38,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821812321] [2025-04-30 10:35:38,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:38,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:35:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:38,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:35:38,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:35:39,486 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 69 [2025-04-30 10:35:39,487 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-04-30 10:35:39,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:39,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 69 [2025-04-30 10:35:39,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:39,811 INFO L116 PetriNetUnfolderBase]: 123/352 cut-off events. [2025-04-30 10:35:39,811 INFO L117 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-04-30 10:35:39,812 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-04-30 10:35:39,813 INFO L140 encePairwiseOnDemand]: 57/69 looper letters, 48 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2025-04-30 10:35:39,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 317 flow [2025-04-30 10:35:39,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:35:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:35:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 383 transitions. [2025-04-30 10:35:39,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5046113306982872 [2025-04-30 10:35:39,815 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 111 flow. Second operand 11 states and 383 transitions. [2025-04-30 10:35:39,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 317 flow [2025-04-30 10:35:39,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 295 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:39,816 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 173 flow [2025-04-30 10:35:39,816 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-04-30 10:35:39,816 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2025-04-30 10:35:39,817 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 173 flow [2025-04-30 10:35:39,817 INFO L486 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-04-30 10:35:39,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:39,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:39,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:35:39,817 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:39,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:39,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1510178622, now seen corresponding path program 1 times [2025-04-30 10:35:39,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:39,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272030819] [2025-04-30 10:35:39,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:39,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:39,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:35:39,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:35:39,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:39,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:40,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:40,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272030819] [2025-04-30 10:35:40,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272030819] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:40,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:40,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:35:40,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225599020] [2025-04-30 10:35:40,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:40,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:35:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:40,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:35:40,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:35:40,878 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2025-04-30 10:35:40,878 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-04-30 10:35:40,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:40,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2025-04-30 10:35:40,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:41,208 INFO L116 PetriNetUnfolderBase]: 123/348 cut-off events. [2025-04-30 10:35:41,208 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-30 10:35:41,209 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 1567 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-04-30 10:35:41,210 INFO L140 encePairwiseOnDemand]: 56/69 looper letters, 44 selfloop transitions, 17 changer transitions 0/71 dead transitions. [2025-04-30 10:35:41,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 71 transitions, 341 flow [2025-04-30 10:35:41,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:35:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:35:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 424 transitions. [2025-04-30 10:35:41,212 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5586297760210803 [2025-04-30 10:35:41,212 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 173 flow. Second operand 11 states and 424 transitions. [2025-04-30 10:35:41,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 71 transitions, 341 flow [2025-04-30 10:35:41,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 327 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-04-30 10:35:41,214 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 217 flow [2025-04-30 10:35:41,214 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-04-30 10:35:41,214 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2025-04-30 10:35:41,214 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 217 flow [2025-04-30 10:35:41,216 INFO L486 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-04-30 10:35:41,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:41,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:41,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:35:41,216 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:41,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:41,216 INFO L85 PathProgramCache]: Analyzing trace with hash -262651708, now seen corresponding path program 1 times [2025-04-30 10:35:41,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:41,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480219782] [2025-04-30 10:35:41,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:41,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:35:41,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:35:41,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:41,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:35:41,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:41,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480219782] [2025-04-30 10:35:41,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480219782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:41,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:41,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:35:41,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160043947] [2025-04-30 10:35:41,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:41,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:41,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:41,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:41,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:41,276 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 69 [2025-04-30 10:35:41,277 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-04-30 10:35:41,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:41,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 69 [2025-04-30 10:35:41,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:41,321 INFO L116 PetriNetUnfolderBase]: 39/166 cut-off events. [2025-04-30 10:35:41,321 INFO L117 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-04-30 10:35:41,321 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 588 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-04-30 10:35:41,322 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 30 selfloop transitions, 4 changer transitions 2/56 dead transitions. [2025-04-30 10:35:41,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 309 flow [2025-04-30 10:35:41,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-04-30 10:35:41,323 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8019323671497585 [2025-04-30 10:35:41,323 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 217 flow. Second operand 3 states and 166 transitions. [2025-04-30 10:35:41,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 309 flow [2025-04-30 10:35:41,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 273 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-04-30 10:35:41,325 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 177 flow [2025-04-30 10:35:41,326 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-04-30 10:35:41,326 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2025-04-30 10:35:41,326 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 177 flow [2025-04-30 10:35:41,326 INFO L486 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-04-30 10:35:41,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:41,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:41,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:35:41,327 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-30 10:35:41,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1400828105, now seen corresponding path program 1 times [2025-04-30 10:35:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:41,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999974970] [2025-04-30 10:35:41,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:41,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:41,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:35:41,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:35:41,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:41,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:35:41,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:35:41,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:35:41,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:35:41,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:41,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:35:41,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:35:41,406 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:35:41,406 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2025-04-30 10:35:41,407 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-04-30 10:35:41,408 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2025-04-30 10:35:41,409 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-04-30 10:35:41,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-04-30 10:35:41,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-04-30 10:35:41,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-04-30 10:35:41,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-04-30 10:35:41,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-04-30 10:35:41,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-04-30 10:35:41,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-04-30 10:35:41,411 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2025-04-30 10:35:41,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:35:41,411 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:41,451 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:35:41,451 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:35:41,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:35:41 BasicIcfg [2025-04-30 10:35:41,457 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:35:41,457 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:35:41,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:35:41,457 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:35:41,458 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:32" (3/4) ... [2025-04-30 10:35:41,458 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:35:41,505 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-04-30 10:35:41,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:35:41,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:35:41,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:35:41,550 INFO L158 Benchmark]: Toolchain (without parser) took 10017.76ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 107.1MB in the beginning and 197.6MB in the end (delta: -90.6MB). Peak memory consumption was 118.3MB. Max. memory is 16.1GB. [2025-04-30 10:35:41,550 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:41,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.78ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 66.0MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-30 10:35:41,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.86ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 63.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:35:41,550 INFO L158 Benchmark]: Boogie Preprocessor took 51.12ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 59.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:41,550 INFO L158 Benchmark]: RCFGBuilder took 676.86ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 64.9MB in the end (delta: -5.7MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2025-04-30 10:35:41,551 INFO L158 Benchmark]: TraceAbstraction took 8556.89ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 64.9MB in the beginning and 206.0MB in the end (delta: -141.1MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2025-04-30 10:35:41,551 INFO L158 Benchmark]: Witness Printer took 92.00ms. Allocated memory is still 352.3MB. Free memory was 206.0MB in the beginning and 197.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:35:41,552 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.78ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 66.0MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.86ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 63.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.12ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 59.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 676.86ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 64.9MB in the end (delta: -5.7MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8556.89ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 64.9MB in the beginning and 206.0MB in the end (delta: -141.1MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * Witness Printer took 92.00ms. Allocated memory is still 352.3MB. Free memory was 206.0MB in the beginning and 197.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 [\at(arg, Pre)={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, 93 edges, 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: 8.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3009 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2162 mSDsluCounter, 1266 SdHoareTripleChecker+Invalid, 3.5s 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.6s 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, 2.6s 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-04-30 10:35:41,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)