./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr-deref.c --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_11-arraylist_nr-deref.c -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 7dc3221962eccb362154fe0de4d4a951fef54d9676991fa26644adbb48c29019 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:15:54,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:15:54,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:15:54,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:15:54,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:15:54,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:15:54,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:15:54,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:15:54,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:15:54,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:15:54,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:15:54,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:15:54,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:15:54,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:15:54,194 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:15:54,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:15:54,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:15:54,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:15:54,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:15:54,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:15:54,195 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:15:54,195 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:15:54,195 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:15:54,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:15:54,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:15:54,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:15:54,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:15:54,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:15:54,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:15:54,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:54,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:54,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:15:54,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:15:54,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:15:54,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:15:54,197 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 -> 7dc3221962eccb362154fe0de4d4a951fef54d9676991fa26644adbb48c29019 [2025-04-29 11:15:54,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:15:54,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:15:54,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:15:54,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:15:54,449 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:15:54,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr-deref.c [2025-04-29 11:15:55,774 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884ae8a8d/eb514403dec84edc8e28853120314d56/FLAGf1c99a5fa [2025-04-29 11:15:56,006 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:15:56,006 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr-deref.c [2025-04-29 11:15:56,008 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:56,008 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:56,008 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:56,013 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884ae8a8d/eb514403dec84edc8e28853120314d56/FLAGf1c99a5fa [2025-04-29 11:15:56,975 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884ae8a8d/eb514403dec84edc8e28853120314d56 [2025-04-29 11:15:56,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:15:56,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:15:56,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:56,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:15:56,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:15:56,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e27ba5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56, skipping insertion in model container [2025-04-29 11:15:56,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:15:57,204 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:57,221 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:15:57,251 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:57,266 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:15:57,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57 WrapperNode [2025-04-29 11:15:57,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:57,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:57,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:15:57,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:15:57,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,305 INFO L138 Inliner]: procedures = 20, calls = 48, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 136 [2025-04-29 11:15:57,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:57,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:15:57,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:15:57,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:15:57,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,342 INFO L175 MemorySlicer]: Split 38 memory accesses to 3 slices as follows [10, 14, 14]. 37 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [10, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-04-29 11:15:57,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:15:57,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:15:57,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:15:57,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:15:57,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (1/1) ... [2025-04-29 11:15:57,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:57,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:57,401 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-29 11:15:57,405 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-29 11:15:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:15:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:15:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:15:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:15:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:15:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:15:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:15:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:15:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:15:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:15:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:15:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:15:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:15:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:15:57,424 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:15:57,425 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:15:57,533 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:15:57,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:15:57,837 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:15:57,837 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:15:58,012 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:15:58,012 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:15:58,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:58 BoogieIcfgContainer [2025-04-29 11:15:58,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:15:58,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:15:58,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:15:58,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:15:58,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:15:56" (1/3) ... [2025-04-29 11:15:58,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cd24b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:58, skipping insertion in model container [2025-04-29 11:15:58,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:57" (2/3) ... [2025-04-29 11:15:58,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cd24b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:58, skipping insertion in model container [2025-04-29 11:15:58,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:58" (3/3) ... [2025-04-29 11:15:58,023 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr-deref.c [2025-04-29 11:15:58,036 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:15:58,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr-deref.c that has 2 procedures, 71 locations, 70 edges, 1 initial locations, 1 loop locations, and 37 error locations. [2025-04-29 11:15:58,038 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:15:58,121 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:15:58,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 146 flow [2025-04-29 11:15:58,170 INFO L116 PetriNetUnfolderBase]: 1/70 cut-off events. [2025-04-29 11:15:58,171 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:58,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 159 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-04-29 11:15:58,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 146 flow [2025-04-29 11:15:58,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 70 transitions, 143 flow [2025-04-29 11:15:58,190 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:15:58,200 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;@2ed60e91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:15:58,201 INFO L341 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-04-29 11:15:58,204 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:15:58,204 INFO L116 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-04-29 11:15:58,204 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:58,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:15:58,205 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-29 11:15:58,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:58,209 INFO L85 PathProgramCache]: Analyzing trace with hash 420442, now seen corresponding path program 1 times [2025-04-29 11:15:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:58,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840521927] [2025-04-29 11:15:58,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:58,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:15:58,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:15:58,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,373 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-29 11:15:58,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:58,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840521927] [2025-04-29 11:15:58,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840521927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:58,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:58,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:58,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799903114] [2025-04-29 11:15:58,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:58,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:58,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:58,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:58,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:58,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-04-29 11:15:58,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-29 11:15:58,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:58,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-04-29 11:15:58,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:58,532 INFO L116 PetriNetUnfolderBase]: 64/267 cut-off events. [2025-04-29 11:15:58,533 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:58,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 267 events. 64/267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1232 event pairs, 63 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 377. Up to 153 conditions per place. [2025-04-29 11:15:58,537 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-04-29 11:15:58,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 199 flow [2025-04-29 11:15:58,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-04-29 11:15:58,549 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7652582159624414 [2025-04-29 11:15:58,550 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 143 flow. Second operand 3 states and 163 transitions. [2025-04-29 11:15:58,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 199 flow [2025-04-29 11:15:58,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:58,556 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 154 flow [2025-04-29 11:15:58,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-04-29 11:15:58,561 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2025-04-29 11:15:58,561 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 154 flow [2025-04-29 11:15:58,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-29 11:15:58,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-29 11:15:58,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:15:58,562 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:58,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash 13032606, now seen corresponding path program 1 times [2025-04-29 11:15:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:58,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205030240] [2025-04-29 11:15:58,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:58,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:15:58,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:15:58,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:58,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205030240] [2025-04-29 11:15:58,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205030240] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:58,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881498400] [2025-04-29 11:15:58,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:58,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:58,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:15:58,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:15:58,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:15:58,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:15:58,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:15:58,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:58,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881498400] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:58,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:58,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-29 11:15:58,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435905442] [2025-04-29 11:15:58,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:58,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:15:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:58,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:15:58,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:15:58,759 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-04-29 11:15:58,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 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-29 11:15:58,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:58,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-04-29 11:15:58,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:58,888 INFO L116 PetriNetUnfolderBase]: 64/270 cut-off events. [2025-04-29 11:15:58,889 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:58,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 270 events. 64/270 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1232 event pairs, 63 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 429. Up to 153 conditions per place. [2025-04-29 11:15:58,890 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2025-04-29 11:15:58,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 226 flow [2025-04-29 11:15:58,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:15:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:15:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-04-29 11:15:58,893 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7112676056338029 [2025-04-29 11:15:58,894 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 154 flow. Second operand 6 states and 303 transitions. [2025-04-29 11:15:58,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 226 flow [2025-04-29 11:15:58,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:58,896 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 186 flow [2025-04-29 11:15:58,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2025-04-29 11:15:58,898 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2025-04-29 11:15:58,898 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 186 flow [2025-04-29 11:15:58,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 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-29 11:15:58,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,898 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-04-29 11:15:58,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:15:59,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:59,100 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:59,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1706220378, now seen corresponding path program 2 times [2025-04-29 11:15:59,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051507738] [2025-04-29 11:15:59,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:59,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:59,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-04-29 11:15:59,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 7 statements. [2025-04-29 11:15:59,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:15:59,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:15:59,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:59,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051507738] [2025-04-29 11:15:59,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051507738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:59,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:59,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:59,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207529731] [2025-04-29 11:15:59,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:59,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:59,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:59,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:59,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:59,237 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2025-04-29 11:15:59,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:59,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:59,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2025-04-29 11:15:59,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:59,336 INFO L116 PetriNetUnfolderBase]: 64/266 cut-off events. [2025-04-29 11:15:59,336 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:15:59,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 266 events. 64/266 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1203 event pairs, 63 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 418. Up to 155 conditions per place. [2025-04-29 11:15:59,340 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 28 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2025-04-29 11:15:59,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 242 flow [2025-04-29 11:15:59,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-04-29 11:15:59,343 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2025-04-29 11:15:59,344 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 186 flow. Second operand 3 states and 149 transitions. [2025-04-29 11:15:59,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 242 flow [2025-04-29 11:15:59,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 70 transitions, 228 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:59,347 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 172 flow [2025-04-29 11:15:59,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2025-04-29 11:15:59,348 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2025-04-29 11:15:59,349 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 172 flow [2025-04-29 11:15:59,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:59,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:59,349 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-04-29 11:15:59,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:15:59,350 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:59,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1706220379, now seen corresponding path program 1 times [2025-04-29 11:15:59,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162518455] [2025-04-29 11:15:59,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:59,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:59,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:15:59,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:15:59,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:59,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:59,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162518455] [2025-04-29 11:15:59,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162518455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:15:59,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139348719] [2025-04-29 11:15:59,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:59,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:15:59,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:59,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:15:59,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:15:59,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:15:59,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:15:59,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:59,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:59,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:15:59,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:15:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:59,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:15:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:59,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139348719] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:15:59,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:15:59,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-29 11:15:59,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652596791] [2025-04-29 11:15:59,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:15:59,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:15:59,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:59,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:15:59,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:15:59,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-04-29 11:15:59,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 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-29 11:15:59,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:59,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-04-29 11:15:59,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:59,757 INFO L116 PetriNetUnfolderBase]: 64/272 cut-off events. [2025-04-29 11:15:59,757 INFO L117 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-04-29 11:15:59,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 272 events. 64/272 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1203 event pairs, 63 based on Foata normal form. 6/221 useless extension candidates. Maximal degree in co-relation 420. Up to 153 conditions per place. [2025-04-29 11:15:59,759 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2025-04-29 11:15:59,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 280 flow [2025-04-29 11:15:59,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:15:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:15:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 582 transitions. [2025-04-29 11:15:59,765 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6830985915492958 [2025-04-29 11:15:59,765 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 172 flow. Second operand 12 states and 582 transitions. [2025-04-29 11:15:59,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 280 flow [2025-04-29 11:15:59,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 76 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:59,768 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 248 flow [2025-04-29 11:15:59,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=248, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2025-04-29 11:15:59,768 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2025-04-29 11:15:59,768 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 248 flow [2025-04-29 11:15:59,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 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-29 11:15:59,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:59,769 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2025-04-29 11:15:59,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:15:59,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:15:59,973 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:59,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash -650341157, now seen corresponding path program 2 times [2025-04-29 11:15:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070837697] [2025-04-29 11:15:59,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:15:59,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:59,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-29 11:15:59,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 13 statements. [2025-04-29 11:15:59,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:15:59,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:00,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070837697] [2025-04-29 11:16:00,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070837697] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:00,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:00,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:00,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403883712] [2025-04-29 11:16:00,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:00,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:00,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:00,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:00,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:00,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 71 [2025-04-29 11:16:00,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:00,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:00,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 71 [2025-04-29 11:16:00,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:00,168 INFO L116 PetriNetUnfolderBase]: 64/268 cut-off events. [2025-04-29 11:16:00,169 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-29 11:16:00,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 268 events. 64/268 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1203 event pairs, 63 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 418. Up to 161 conditions per place. [2025-04-29 11:16:00,171 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 32 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-04-29 11:16:00,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 72 transitions, 312 flow [2025-04-29 11:16:00,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-04-29 11:16:00,173 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2025-04-29 11:16:00,173 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 248 flow. Second operand 3 states and 153 transitions. [2025-04-29 11:16:00,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 72 transitions, 312 flow [2025-04-29 11:16:00,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 72 transitions, 264 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-29 11:16:00,180 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 200 flow [2025-04-29 11:16:00,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2025-04-29 11:16:00,180 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2025-04-29 11:16:00,180 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 200 flow [2025-04-29 11:16:00,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:00,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:00,180 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-29 11:16:00,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:16:00,181 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:00,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2087383851, now seen corresponding path program 1 times [2025-04-29 11:16:00,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:00,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301725620] [2025-04-29 11:16:00,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:00,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:00,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:00,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:00,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:00,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:00,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301725620] [2025-04-29 11:16:00,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301725620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:00,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:00,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:00,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295031763] [2025-04-29 11:16:00,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:00,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:00,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:00,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:00,535 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-04-29 11:16:00,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 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-29 11:16:00,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:00,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-04-29 11:16:00,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:00,616 INFO L116 PetriNetUnfolderBase]: 73/286 cut-off events. [2025-04-29 11:16:00,617 INFO L117 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-04-29 11:16:00,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 286 events. 73/286 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1290 event pairs, 72 based on Foata normal form. 1/238 useless extension candidates. Maximal degree in co-relation 461. Up to 183 conditions per place. [2025-04-29 11:16:00,620 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 38 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2025-04-29 11:16:00,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 68 transitions, 270 flow [2025-04-29 11:16:00,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-04-29 11:16:00,621 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2025-04-29 11:16:00,621 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 200 flow. Second operand 3 states and 147 transitions. [2025-04-29 11:16:00,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 68 transitions, 270 flow [2025-04-29 11:16:00,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:00,624 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 186 flow [2025-04-29 11:16:00,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2025-04-29 11:16:00,624 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2025-04-29 11:16:00,626 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 186 flow [2025-04-29 11:16:00,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 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-29 11:16:00,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:00,627 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-29 11:16:00,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:16:00,627 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:00,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2087383852, now seen corresponding path program 1 times [2025-04-29 11:16:00,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:00,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327880574] [2025-04-29 11:16:00,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:00,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:00,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:00,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:00,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:00,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:00,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327880574] [2025-04-29 11:16:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327880574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100233881] [2025-04-29 11:16:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:00,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:00,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:00,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:00,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:01,040 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 71 [2025-04-29 11:16:01,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 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-29 11:16:01,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:01,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 71 [2025-04-29 11:16:01,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:01,202 INFO L116 PetriNetUnfolderBase]: 73/281 cut-off events. [2025-04-29 11:16:01,202 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-29 11:16:01,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 281 events. 73/281 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1264 event pairs, 63 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 484. Up to 148 conditions per place. [2025-04-29 11:16:01,204 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 37 selfloop transitions, 6 changer transitions 3/74 dead transitions. [2025-04-29 11:16:01,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 74 transitions, 290 flow [2025-04-29 11:16:01,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2025-04-29 11:16:01,205 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6309859154929578 [2025-04-29 11:16:01,205 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 186 flow. Second operand 5 states and 224 transitions. [2025-04-29 11:16:01,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 74 transitions, 290 flow [2025-04-29 11:16:01,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:01,206 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 191 flow [2025-04-29 11:16:01,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2025-04-29 11:16:01,207 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2025-04-29 11:16:01,207 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 191 flow [2025-04-29 11:16:01,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 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-29 11:16:01,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:01,207 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:01,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:16:01,207 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:01,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1696210868, now seen corresponding path program 1 times [2025-04-29 11:16:01,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:01,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53635577] [2025-04-29 11:16:01,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:01,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:01,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:16:01,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:16:01,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:01,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:01,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:01,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53635577] [2025-04-29 11:16:01,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53635577] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:01,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:01,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:16:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592689822] [2025-04-29 11:16:01,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:01,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:16:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:01,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:16:01,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:16:01,649 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2025-04-29 11:16:01,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 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-29 11:16:01,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:01,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2025-04-29 11:16:01,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:01,769 INFO L116 PetriNetUnfolderBase]: 64/252 cut-off events. [2025-04-29 11:16:01,769 INFO L117 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-04-29 11:16:01,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 252 events. 64/252 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1090 event pairs, 54 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 453. Up to 126 conditions per place. [2025-04-29 11:16:01,770 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 38 selfloop transitions, 7 changer transitions 3/72 dead transitions. [2025-04-29 11:16:01,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 72 transitions, 301 flow [2025-04-29 11:16:01,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 292 transitions. [2025-04-29 11:16:01,772 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5875251509054326 [2025-04-29 11:16:01,772 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 191 flow. Second operand 7 states and 292 transitions. [2025-04-29 11:16:01,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 72 transitions, 301 flow [2025-04-29 11:16:01,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 72 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:01,774 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 189 flow [2025-04-29 11:16:01,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2025-04-29 11:16:01,774 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2025-04-29 11:16:01,774 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 189 flow [2025-04-29 11:16:01,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 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-29 11:16:01,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:01,775 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:01,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:16:01,775 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:01,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1696210867, now seen corresponding path program 1 times [2025-04-29 11:16:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:01,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174508804] [2025-04-29 11:16:01,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:01,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:16:01,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:16:01,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:01,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:02,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:02,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174508804] [2025-04-29 11:16:02,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174508804] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:02,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:02,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:16:02,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30254463] [2025-04-29 11:16:02,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:02,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:02,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:02,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:02,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:02,242 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2025-04-29 11:16:02,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 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-29 11:16:02,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:02,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2025-04-29 11:16:02,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:02,378 INFO L116 PetriNetUnfolderBase]: 64/250 cut-off events. [2025-04-29 11:16:02,378 INFO L117 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-04-29 11:16:02,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 250 events. 64/250 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1086 event pairs, 54 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 450. Up to 126 conditions per place. [2025-04-29 11:16:02,379 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 35 selfloop transitions, 7 changer transitions 3/70 dead transitions. [2025-04-29 11:16:02,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 70 transitions, 293 flow [2025-04-29 11:16:02,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:16:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:16:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 310 transitions. [2025-04-29 11:16:02,381 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6237424547283702 [2025-04-29 11:16:02,381 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 189 flow. Second operand 7 states and 310 transitions. [2025-04-29 11:16:02,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 70 transitions, 293 flow [2025-04-29 11:16:02,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 70 transitions, 279 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-29 11:16:02,383 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 185 flow [2025-04-29 11:16:02,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2025-04-29 11:16:02,383 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2025-04-29 11:16:02,383 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 185 flow [2025-04-29 11:16:02,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 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-29 11:16:02,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:02,384 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:02,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:16:02,384 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:02,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2028942714, now seen corresponding path program 1 times [2025-04-29 11:16:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:02,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089443988] [2025-04-29 11:16:02,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:02,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:02,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:16:02,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:16:02,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:02,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:02,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089443988] [2025-04-29 11:16:02,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089443988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:02,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:02,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:02,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533925314] [2025-04-29 11:16:02,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:02,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:02,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:02,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:02,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:02,620 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2025-04-29 11:16:02,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 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-29 11:16:02,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:02,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2025-04-29 11:16:02,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:02,705 INFO L116 PetriNetUnfolderBase]: 64/249 cut-off events. [2025-04-29 11:16:02,706 INFO L117 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-04-29 11:16:02,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 249 events. 64/249 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1088 event pairs, 63 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 449. Up to 158 conditions per place. [2025-04-29 11:16:02,707 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 30 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-04-29 11:16:02,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 60 transitions, 255 flow [2025-04-29 11:16:02,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-04-29 11:16:02,708 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6394366197183099 [2025-04-29 11:16:02,708 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 185 flow. Second operand 5 states and 227 transitions. [2025-04-29 11:16:02,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 60 transitions, 255 flow [2025-04-29 11:16:02,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 60 transitions, 241 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-29 11:16:02,710 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 181 flow [2025-04-29 11:16:02,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2025-04-29 11:16:02,710 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-04-29 11:16:02,710 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 181 flow [2025-04-29 11:16:02,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 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-29 11:16:02,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:02,711 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:02,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:16:02,711 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:02,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2028942713, now seen corresponding path program 1 times [2025-04-29 11:16:02,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:02,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609187203] [2025-04-29 11:16:02,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:02,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:16:02,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:16:02,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:02,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-29 11:16:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:02,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609187203] [2025-04-29 11:16:02,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609187203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:02,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:02,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:02,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907864536] [2025-04-29 11:16:02,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:02,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:02,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:02,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:02,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:02,890 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-04-29 11:16:02,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-29 11:16:02,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:02,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-04-29 11:16:02,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:02,976 INFO L116 PetriNetUnfolderBase]: 64/248 cut-off events. [2025-04-29 11:16:02,976 INFO L117 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-04-29 11:16:02,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 248 events. 64/248 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1086 event pairs, 63 based on Foata normal form. 1/210 useless extension candidates. Maximal degree in co-relation 440. Up to 158 conditions per place. [2025-04-29 11:16:02,977 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 32 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-04-29 11:16:02,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 59 transitions, 255 flow [2025-04-29 11:16:02,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-04-29 11:16:02,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6169014084507042 [2025-04-29 11:16:02,979 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 181 flow. Second operand 5 states and 219 transitions. [2025-04-29 11:16:02,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 59 transitions, 255 flow [2025-04-29 11:16:02,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 59 transitions, 243 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:02,980 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 179 flow [2025-04-29 11:16:02,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2025-04-29 11:16:02,981 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2025-04-29 11:16:02,981 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 179 flow [2025-04-29 11:16:02,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-29 11:16:02,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:02,981 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:02,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:16:02,981 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:02,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 559651829, now seen corresponding path program 1 times [2025-04-29 11:16:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:02,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111089258] [2025-04-29 11:16:02,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:02,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:16:03,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:16:03,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-29 11:16:03,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111089258] [2025-04-29 11:16:03,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111089258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:03,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:03,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068309135] [2025-04-29 11:16:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:03,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:03,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:03,071 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 71 [2025-04-29 11:16:03,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 71 [2025-04-29 11:16:03,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,133 INFO L116 PetriNetUnfolderBase]: 71/258 cut-off events. [2025-04-29 11:16:03,133 INFO L117 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-04-29 11:16:03,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 258 events. 71/258 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1118 event pairs, 56 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 463. Up to 148 conditions per place. [2025-04-29 11:16:03,134 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-04-29 11:16:03,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 64 transitions, 277 flow [2025-04-29 11:16:03,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-04-29 11:16:03,135 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7605633802816901 [2025-04-29 11:16:03,136 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 179 flow. Second operand 3 states and 162 transitions. [2025-04-29 11:16:03,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 64 transitions, 277 flow [2025-04-29 11:16:03,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 265 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:03,137 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 167 flow [2025-04-29 11:16:03,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2025-04-29 11:16:03,137 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2025-04-29 11:16:03,138 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 167 flow [2025-04-29 11:16:03,138 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:16:03,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,138 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:03,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:16:03,138 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:03,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 559651830, now seen corresponding path program 1 times [2025-04-29 11:16:03,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433709665] [2025-04-29 11:16:03,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:16:03,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:16:03,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-04-29 11:16:03,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433709665] [2025-04-29 11:16:03,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433709665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:03,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:03,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374852583] [2025-04-29 11:16:03,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,249 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:03,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:03,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 71 [2025-04-29 11:16:03,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-29 11:16:03,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 71 [2025-04-29 11:16:03,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,348 INFO L116 PetriNetUnfolderBase]: 64/235 cut-off events. [2025-04-29 11:16:03,349 INFO L117 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-04-29 11:16:03,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 235 events. 64/235 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 964 event pairs, 56 based on Foata normal form. 16/225 useless extension candidates. Maximal degree in co-relation 435. Up to 148 conditions per place. [2025-04-29 11:16:03,350 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-04-29 11:16:03,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 263 flow [2025-04-29 11:16:03,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2025-04-29 11:16:03,351 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7699530516431925 [2025-04-29 11:16:03,351 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 167 flow. Second operand 3 states and 164 transitions. [2025-04-29 11:16:03,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 263 flow [2025-04-29 11:16:03,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:03,353 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 163 flow [2025-04-29 11:16:03,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2025-04-29 11:16:03,354 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2025-04-29 11:16:03,354 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 163 flow [2025-04-29 11:16:03,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-29 11:16:03,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,354 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:03,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:16:03,355 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:03,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,355 INFO L85 PathProgramCache]: Analyzing trace with hash 143302145, now seen corresponding path program 1 times [2025-04-29 11:16:03,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070489768] [2025-04-29 11:16:03,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:16:03,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:16:03,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:03,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070489768] [2025-04-29 11:16:03,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070489768] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:03,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330241499] [2025-04-29 11:16:03,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:03,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:03,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:03,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:16:03,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:16:03,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:16:03,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:16:03,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:03,742 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-29 11:16:03,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-04-29 11:16:03,817 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2025-04-29 11:16:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-04-29 11:16:03,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:03,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330241499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:16:03,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-04-29 11:16:03,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779775680] [2025-04-29 11:16:03,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,834 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:03,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:03,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:16:03,954 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 71 [2025-04-29 11:16:03,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-29 11:16:03,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 71 [2025-04-29 11:16:03,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:04,100 INFO L116 PetriNetUnfolderBase]: 79/284 cut-off events. [2025-04-29 11:16:04,100 INFO L117 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-04-29 11:16:04,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 284 events. 79/284 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1293 event pairs, 30 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 520. Up to 154 conditions per place. [2025-04-29 11:16:04,102 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 45 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2025-04-29 11:16:04,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 69 transitions, 301 flow [2025-04-29 11:16:04,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:16:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 296 transitions. [2025-04-29 11:16:04,103 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6948356807511737 [2025-04-29 11:16:04,103 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 163 flow. Second operand 6 states and 296 transitions. [2025-04-29 11:16:04,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 69 transitions, 301 flow [2025-04-29 11:16:04,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 69 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:04,105 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 203 flow [2025-04-29 11:16:04,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2025-04-29 11:16:04,105 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2025-04-29 11:16:04,105 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 203 flow [2025-04-29 11:16:04,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 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-29 11:16:04,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:04,105 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:04,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:16:04,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:04,306 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:04,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash 143302144, now seen corresponding path program 1 times [2025-04-29 11:16:04,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:04,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16962576] [2025-04-29 11:16:04,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:04,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:04,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:16:04,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:16:04,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:04,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-04-29 11:16:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:04,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16962576] [2025-04-29 11:16:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16962576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:16:04,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304523066] [2025-04-29 11:16:04,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:04,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:16:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:04,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:16:04,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:16:04,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2025-04-29 11:16:04,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 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-29 11:16:04,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:04,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2025-04-29 11:16:04,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:04,656 INFO L116 PetriNetUnfolderBase]: 73/249 cut-off events. [2025-04-29 11:16:04,656 INFO L117 PetriNetUnfolderBase]: For 69/71 co-relation queries the response was YES. [2025-04-29 11:16:04,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 249 events. 73/249 cut-off events. For 69/71 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1006 event pairs, 47 based on Foata normal form. 10/236 useless extension candidates. Maximal degree in co-relation 519. Up to 125 conditions per place. [2025-04-29 11:16:04,657 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 47 selfloop transitions, 9 changer transitions 3/75 dead transitions. [2025-04-29 11:16:04,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 351 flow [2025-04-29 11:16:04,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:16:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2025-04-29 11:16:04,659 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6737089201877934 [2025-04-29 11:16:04,659 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 203 flow. Second operand 6 states and 287 transitions. [2025-04-29 11:16:04,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 351 flow [2025-04-29 11:16:04,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:04,661 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 215 flow [2025-04-29 11:16:04,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2025-04-29 11:16:04,661 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-04-29 11:16:04,661 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 215 flow [2025-04-29 11:16:04,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 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-29 11:16:04,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:04,662 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:04,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:16:04,662 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:04,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash 954508950, now seen corresponding path program 1 times [2025-04-29 11:16:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:04,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088066575] [2025-04-29 11:16:04,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:04,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:16:04,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:16:04,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:04,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:04,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088066575] [2025-04-29 11:16:04,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088066575] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:04,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017539241] [2025-04-29 11:16:04,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:04,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:04,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:04,946 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:04,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:16:05,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:16:05,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:16:05,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:05,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:05,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-29 11:16:05,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:05,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:05,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:05,201 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:16:05,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:16:05,214 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:16:05,215 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:16:05,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:05,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-29 11:16:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:05,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:16:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017539241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:05,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:16:05,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2025-04-29 11:16:05,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371206410] [2025-04-29 11:16:05,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:05,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:16:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:05,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:16:05,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:16:05,705 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 71 [2025-04-29 11:16:05,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 215 flow. Second operand has 8 states, 8 states have (on average 36.875) internal successors, (295), 8 states have internal predecessors, (295), 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-29 11:16:05,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:05,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 71 [2025-04-29 11:16:05,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:05,846 INFO L116 PetriNetUnfolderBase]: 73/245 cut-off events. [2025-04-29 11:16:05,846 INFO L117 PetriNetUnfolderBase]: For 119/123 co-relation queries the response was YES. [2025-04-29 11:16:05,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 245 events. 73/245 cut-off events. For 119/123 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 999 event pairs, 39 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 540. Up to 153 conditions per place. [2025-04-29 11:16:05,848 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 43 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2025-04-29 11:16:05,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 66 transitions, 346 flow [2025-04-29 11:16:05,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:16:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:16:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 246 transitions. [2025-04-29 11:16:05,849 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5774647887323944 [2025-04-29 11:16:05,850 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 215 flow. Second operand 6 states and 246 transitions. [2025-04-29 11:16:05,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 66 transitions, 346 flow [2025-04-29 11:16:05,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 66 transitions, 322 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:16:05,852 INFO L231 Difference]: Finished difference. Result has 77 places, 58 transitions, 209 flow [2025-04-29 11:16:05,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=77, PETRI_TRANSITIONS=58} [2025-04-29 11:16:05,853 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2025-04-29 11:16:05,854 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 58 transitions, 209 flow [2025-04-29 11:16:05,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.875) internal successors, (295), 8 states have internal predecessors, (295), 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-29 11:16:05,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:05,854 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:05,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:06,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:16:06,055 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:06,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:06,055 INFO L85 PathProgramCache]: Analyzing trace with hash 147399658, now seen corresponding path program 1 times [2025-04-29 11:16:06,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:06,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069126086] [2025-04-29 11:16:06,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:06,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:06,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:16:06,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:16:06,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:06,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:06,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:06,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069126086] [2025-04-29 11:16:06,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069126086] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:06,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334820372] [2025-04-29 11:16:06,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:06,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:06,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:06,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:06,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:16:06,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:16:06,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:16:06,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:06,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:06,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-29 11:16:06,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:06,665 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:06,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-29 11:16:06,695 INFO L325 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-04-29 11:16:06,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-04-29 11:16:06,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-04-29 11:16:06,780 INFO L325 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-04-29 11:16:06,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 89 [2025-04-29 11:16:06,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 41 [2025-04-29 11:16:06,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2025-04-29 11:16:06,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:16:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:06,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:06,901 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-29 11:16:06,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2025-04-29 11:16:06,951 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:06,951 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-04-29 11:16:06,961 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:06,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 75 [2025-04-29 11:16:06,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2025-04-29 11:16:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:07,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334820372] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:07,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:07,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2025-04-29 11:16:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998997834] [2025-04-29 11:16:07,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:07,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:16:07,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:07,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:16:07,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=615, Unknown=6, NotChecked=0, Total=702 [2025-04-29 11:16:08,612 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 71 [2025-04-29 11:16:08,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 58 transitions, 209 flow. Second operand has 27 states, 27 states have (on average 8.703703703703704) internal successors, (235), 27 states have internal predecessors, (235), 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-29 11:16:08,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:08,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 71 [2025-04-29 11:16:08,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:09,169 INFO L116 PetriNetUnfolderBase]: 182/432 cut-off events. [2025-04-29 11:16:09,171 INFO L117 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-04-29 11:16:09,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 432 events. 182/432 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1798 event pairs, 66 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 971. Up to 203 conditions per place. [2025-04-29 11:16:09,173 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 68 selfloop transitions, 19 changer transitions 0/91 dead transitions. [2025-04-29 11:16:09,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 91 transitions, 466 flow [2025-04-29 11:16:09,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:16:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:16:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2025-04-29 11:16:09,174 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.180931744312026 [2025-04-29 11:16:09,174 INFO L175 Difference]: Start difference. First operand has 77 places, 58 transitions, 209 flow. Second operand 13 states and 167 transitions. [2025-04-29 11:16:09,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 91 transitions, 466 flow [2025-04-29 11:16:09,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 91 transitions, 450 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:09,176 INFO L231 Difference]: Finished difference. Result has 90 places, 65 transitions, 291 flow [2025-04-29 11:16:09,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=291, PETRI_PLACES=90, PETRI_TRANSITIONS=65} [2025-04-29 11:16:09,177 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 17 predicate places. [2025-04-29 11:16:09,177 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 65 transitions, 291 flow [2025-04-29 11:16:09,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.703703703703704) internal successors, (235), 27 states have internal predecessors, (235), 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-29 11:16:09,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:09,177 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:09,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:16:09,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:16:09,378 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:09,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:09,378 INFO L85 PathProgramCache]: Analyzing trace with hash 147399659, now seen corresponding path program 1 times [2025-04-29 11:16:09,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:09,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018574737] [2025-04-29 11:16:09,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:09,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:09,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:16:09,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:16:09,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:09,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:10,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:10,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018574737] [2025-04-29 11:16:10,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018574737] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:10,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470266122] [2025-04-29 11:16:10,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:10,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:10,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:10,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:16:10,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:16:10,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:16:10,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:16:10,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:10,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:10,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-29 11:16:10,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:10,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:16:10,188 INFO L325 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-04-29 11:16:10,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-04-29 11:16:10,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:16:10,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-29 11:16:10,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-04-29 11:16:10,284 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-04-29 11:16:10,323 INFO L325 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-04-29 11:16:10,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 121 [2025-04-29 11:16:10,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 29 [2025-04-29 11:16:10,379 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 58 [2025-04-29 11:16:10,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 34 [2025-04-29 11:16:10,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-04-29 11:16:10,413 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-29 11:16:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:10,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:10,515 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#slot~0.base|) .cse2) 4))) (and (forall ((v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1155 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1155) .cse0) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1156) .cse0) .cse1)))) (forall ((v_ArrVal_1155 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1155) .cse0) .cse1)))))) is different from false [2025-04-29 11:16:10,523 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,523 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 78 [2025-04-29 11:16:10,529 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 68 [2025-04-29 11:16:10,537 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,537 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 133 [2025-04-29 11:16:10,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 185 [2025-04-29 11:16:10,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-04-29 11:16:10,575 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-29 11:16:10,580 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:10,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-04-29 11:16:10,582 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:16:10,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:10,584 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 10 [2025-04-29 11:16:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-29 11:16:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470266122] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:10,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2025-04-29 11:16:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937843244] [2025-04-29 11:16:10,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:10,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:16:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:10,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:16:10,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=778, Unknown=1, NotChecked=56, Total=930 [2025-04-29 11:16:10,894 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 71 [2025-04-29 11:16:10,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 65 transitions, 291 flow. Second operand has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 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-29 11:16:10,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:10,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 71 [2025-04-29 11:16:10,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:11,701 INFO L116 PetriNetUnfolderBase]: 259/576 cut-off events. [2025-04-29 11:16:11,702 INFO L117 PetriNetUnfolderBase]: For 403/405 co-relation queries the response was YES. [2025-04-29 11:16:11,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 576 events. 259/576 cut-off events. For 403/405 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2583 event pairs, 84 based on Foata normal form. 18/486 useless extension candidates. Maximal degree in co-relation 1504. Up to 268 conditions per place. [2025-04-29 11:16:11,705 INFO L140 encePairwiseOnDemand]: 57/71 looper letters, 88 selfloop transitions, 20 changer transitions 0/109 dead transitions. [2025-04-29 11:16:11,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 611 flow [2025-04-29 11:16:11,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:16:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:16:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 125 transitions. [2025-04-29 11:16:11,707 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.12575452716297786 [2025-04-29 11:16:11,708 INFO L175 Difference]: Start difference. First operand has 90 places, 65 transitions, 291 flow. Second operand 14 states and 125 transitions. [2025-04-29 11:16:11,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 611 flow [2025-04-29 11:16:11,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 594 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-04-29 11:16:11,712 INFO L231 Difference]: Finished difference. Result has 98 places, 66 transitions, 333 flow [2025-04-29 11:16:11,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=333, PETRI_PLACES=98, PETRI_TRANSITIONS=66} [2025-04-29 11:16:11,713 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 25 predicate places. [2025-04-29 11:16:11,713 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 66 transitions, 333 flow [2025-04-29 11:16:11,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 31 states have internal predecessors, (114), 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-29 11:16:11,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:11,713 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:11,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:11,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 11:16:11,914 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:11,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:11,915 INFO L85 PathProgramCache]: Analyzing trace with hash -474993141, now seen corresponding path program 1 times [2025-04-29 11:16:11,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:11,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702923251] [2025-04-29 11:16:11,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:11,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:11,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:16:12,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:16:12,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:12,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:16:12,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:16:12,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:16:12,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:16:12,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:12,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:16:12,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:16:12,150 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:16:12,151 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-04-29 11:16:12,152 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2025-04-29 11:16:12,153 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2025-04-29 11:16:12,154 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-04-29 11:16:12,156 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-04-29 11:16:12,156 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-04-29 11:16:12,156 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-04-29 11:16:12,156 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-04-29 11:16:12,156 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-04-29 11:16:12,156 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-04-29 11:16:12,156 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-04-29 11:16:12,156 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-04-29 11:16:12,156 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-04-29 11:16:12,156 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2025-04-29 11:16:12,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:16:12,157 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:12,216 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:16:12,216 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:16:12,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:16:12 BasicIcfg [2025-04-29 11:16:12,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:16:12,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:16:12,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:16:12,222 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:16:12,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:58" (3/4) ... [2025-04-29 11:16:12,223 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:16:12,268 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 27. [2025-04-29 11:16:12,328 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:16:12,328 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:16:12,328 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:16:12,329 INFO L158 Benchmark]: Toolchain (without parser) took 15350.53ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 134.4MB in the beginning and 366.2MB in the end (delta: -231.8MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. [2025-04-29 11:16:12,329 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:12,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.24ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 119.4MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:16:12,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.52ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 117.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:12,329 INFO L158 Benchmark]: Boogie Preprocessor took 64.85ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 113.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:16:12,329 INFO L158 Benchmark]: RCFGBuilder took 639.26ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 52.0MB in the end (delta: 61.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-04-29 11:16:12,332 INFO L158 Benchmark]: TraceAbstraction took 14206.54ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 51.2MB in the beginning and 374.6MB in the end (delta: -323.4MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2025-04-29 11:16:12,332 INFO L158 Benchmark]: Witness Printer took 106.84ms. Allocated memory is still 545.3MB. Free memory was 374.6MB in the beginning and 366.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:16:12,333 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.24ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 119.4MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.52ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 117.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.85ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 113.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 639.26ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 52.0MB in the end (delta: 61.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14206.54ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 51.2MB in the beginning and 374.6MB in the end (delta: -323.4MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * Witness Printer took 106.84ms. Allocated memory is still 545.3MB. Free memory was 374.6MB in the beginning and 366.2MB 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: [L36] 0 pthread_mutex_t mutex[10]; [L36] 0 pthread_mutex_t mutex[10]; [L36] 0 pthread_mutex_t mutex[10]; [L36] 0 pthread_mutex_t mutex[10]; [L36] 0 pthread_mutex_t mutex[10]; [L36] 0 pthread_mutex_t mutex[10]; [L36] 0 pthread_mutex_t mutex[10]; [L36] 0 pthread_mutex_t mutex[10]; [L36] 0 pthread_mutex_t mutex[10]; [L36] 0 pthread_mutex_t mutex[10]; [L36] 0 pthread_mutex_t mutex[10]; [L37] 0 struct s *slot[10]; [L37] 0 struct s *slot[10]; [L37] 0 struct s *slot[10]; [L37] 0 struct s *slot[10]; [L37] 0 struct s *slot[10]; [L37] 0 struct s *slot[10]; [L37] 0 struct s *slot[10]; [L37] 0 struct s *slot[10]; [L37] 0 struct s *slot[10]; [L37] 0 struct s *slot[10]; [L37] 0 struct s *slot[10]; [L49] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L49] COND TRUE 0 i < 10 [L49] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L49] COND TRUE 0 i < 10 [L49] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L49] COND TRUE 0 i < 10 [L49] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L49] COND TRUE 0 i < 10 [L49] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L49] COND TRUE 0 i < 10 [L49] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L49] COND TRUE 0 i < 10 [L49] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L49] COND TRUE 0 i < 10 [L49] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L49] COND TRUE 0 i < 10 [L49] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L49] COND TRUE 0 i < 10 [L49] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L49] COND TRUE 0 i < 10 [L49] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L49] COND FALSE 0 !(i < 10) [L52] 0 int j = __VERIFIER_nondet_int(); [L53] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L53] RET 0 assume_abort_if_not(0 <= j && j < 10) [L54] 0 struct s *p; [L55] 0 pthread_t t1; [L57] CALL, EXPR 0 new(1) [L24] 0 struct s *p = malloc(sizeof(struct s)); [L25] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L26] 0 p->next = NULL [L27] 0 return p; [L57] RET, EXPR 0 new(1) [L57] 0 slot[j] = new(1) [L58] CALL, EXPR 0 new(2) [L24] 0 struct s *p = malloc(sizeof(struct s)); [L25] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L26] 0 p->next = NULL [L27] 0 return p; [L58] RET, EXPR 0 new(2) [L58] EXPR 0 slot[j] [L58] CALL 0 list_add(new(2), slot[j]) [L31] EXPR 0 list->next [L31] 0 struct s *temp = list->next; [L32] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L33] 0 node->next = temp [L58] RET 0 list_add(new(2), slot[j]) [L60] FCALL, FORK 0 pthread_create(&t1, NULL, t_fun, NULL) VAL [j=0, mutex={1:0}, slot={2:0}, t1=-1] [L40] 1 int i = __VERIFIER_nondet_int(); [L41] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L41] RET 1 assume_abort_if_not(0 <= i && i < 10) [L43] CALL, EXPR 1 new(3) [L24] 1 struct s *p = malloc(sizeof(struct s)); [L25] 1 p->datum = x VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=9, mutex={1:0}, slot={2:0}] [L26] 1 p->next = NULL [L27] 1 return p; [L43] RET, EXPR 1 new(3) [L43] EXPR 1 slot[i] [L43] CALL 1 list_add(new(3), slot[i]) [L31] 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: 48]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 60]: 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, 96 locations, 95 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: 14.0s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 25 mSolverCounterUnknown, 2967 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2199 mSDsluCounter, 2099 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 133 IncrementalHoareTripleChecker+Unchecked, 1939 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10168 IncrementalHoareTripleChecker+Invalid, 10452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 160 mSDtfsCounter, 10168 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=18, InterpolantAutomatonStates: 110, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 485 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 495 ConstructedInterpolants, 2 QuantifiedInterpolants, 5741 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1846 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 1140/1181 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-29 11:16:12,351 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)