./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:35:33,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:35:33,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:35:33,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:35:33,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:35:33,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:35:33,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:35:33,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:35:33,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:35:33,612 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:35:33,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:35:33,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:35:33,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:35:33,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:35:33,614 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:35:33,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:35:33,614 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:35:33,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:35:33,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:35:33,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:35:33,614 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:35:33,615 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:35:33,615 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:35:33,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:35:33,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:35:33,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:35:33,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:35:33,615 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:35:33,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:35:33,615 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:35:33,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:33,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:33,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:33,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:33,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:35:33,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:33,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:33,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:33,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:33,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:35:33,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:35:33,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:35:33,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:35:33,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:35:33,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:35:33,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:35:33,617 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 -> e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 [2025-04-30 10:35:33,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:35:33,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:35:33,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:35:33,850 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:35:33,851 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:35:33,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2025-04-30 10:35:35,174 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6978fb57e/905f519eddde463d8e5e4f6ec9c164fd/FLAGda0979f76 [2025-04-30 10:35:35,471 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:35:35,473 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2025-04-30 10:35:35,498 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6978fb57e/905f519eddde463d8e5e4f6ec9c164fd/FLAGda0979f76 [2025-04-30 10:35:36,224 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6978fb57e/905f519eddde463d8e5e4f6ec9c164fd [2025-04-30 10:35:36,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:35:36,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:35:36,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:36,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:35:36,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:35:36,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:36,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0f8850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36, skipping insertion in model container [2025-04-30 10:35:36,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:36,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:35:36,697 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:36,722 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:35:36,796 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:36,859 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:35:36,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36 WrapperNode [2025-04-30 10:35:36,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:36,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:36,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:35:36,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:35:36,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:36,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:36,932 INFO L138 Inliner]: procedures = 372, calls = 100, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 257 [2025-04-30 10:35:36,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:36,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:35:36,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:35:36,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:35:36,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:36,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:36,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:36,986 INFO L175 MemorySlicer]: Split 99 memory accesses to 3 slices as follows [50, 18, 31]. 51 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 26 writes are split as follows [0, 2, 24]. [2025-04-30 10:35:36,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:36,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:37,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:37,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:37,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:37,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:37,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:37,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:35:37,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:35:37,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:35:37,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:35:37,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (1/1) ... [2025-04-30 10:35:37,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:37,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:37,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:35:37,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:35:37,077 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:35:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:35:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:35:37,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:35:37,078 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:35:37,199 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:35:37,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:35:37,668 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:35:37,668 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:35:37,966 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:35:37,966 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:35:37,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:37 BoogieIcfgContainer [2025-04-30 10:35:37,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:35:37,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:35:37,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:35:37,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:35:37,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:35:36" (1/3) ... [2025-04-30 10:35:37,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586d0c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:37, skipping insertion in model container [2025-04-30 10:35:37,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:36" (2/3) ... [2025-04-30 10:35:37,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586d0c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:37, skipping insertion in model container [2025-04-30 10:35:37,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:37" (3/3) ... [2025-04-30 10:35:37,976 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr-deref.i [2025-04-30 10:35:37,987 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:35:37,989 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr-deref.i that has 2 procedures, 134 locations, 133 edges, 1 initial locations, 1 loop locations, and 79 error locations. [2025-04-30 10:35:37,990 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:35:38,051 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:35:38,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 272 flow [2025-04-30 10:35:38,119 INFO L116 PetriNetUnfolderBase]: 1/133 cut-off events. [2025-04-30 10:35:38,122 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:38,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 1/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 269 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2025-04-30 10:35:38,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 134 transitions, 272 flow [2025-04-30 10:35:38,127 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 269 flow [2025-04-30 10:35:38,132 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:35:38,139 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;@7a20e233, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:35:38,140 INFO L341 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-04-30 10:35:38,142 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:35:38,143 INFO L116 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-04-30 10:35:38,143 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:38,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:38,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-30 10:35:38,143 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:38,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash 751061, now seen corresponding path program 1 times [2025-04-30 10:35:38,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:38,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915682762] [2025-04-30 10:35:38,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:38,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:38,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:35:38,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:35:38,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:38,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:38,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:38,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915682762] [2025-04-30 10:35:38,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915682762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:38,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:38,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:38,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621946778] [2025-04-30 10:35:38,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:38,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:38,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:38,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:38,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:38,419 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-04-30 10:35:38,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:38,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:38,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-04-30 10:35:38,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:38,604 INFO L116 PetriNetUnfolderBase]: 64/329 cut-off events. [2025-04-30 10:35:38,604 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:38,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 329 events. 64/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1306 event pairs, 63 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2025-04-30 10:35:38,606 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-04-30 10:35:38,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 353 flow [2025-04-30 10:35:38,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-04-30 10:35:38,616 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8059701492537313 [2025-04-30 10:35:38,617 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 269 flow. Second operand 3 states and 324 transitions. [2025-04-30 10:35:38,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 353 flow [2025-04-30 10:35:38,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:38,623 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 280 flow [2025-04-30 10:35:38,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2025-04-30 10:35:38,628 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2025-04-30 10:35:38,629 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 280 flow [2025-04-30 10:35:38,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:38,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:38,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-30 10:35:38,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:35:38,629 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:38,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash 23279784, now seen corresponding path program 1 times [2025-04-30 10:35:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:38,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998519590] [2025-04-30 10:35:38,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:38,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:38,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:35:38,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:35:38,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:38,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:38,746 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-30 10:35:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:38,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998519590] [2025-04-30 10:35:38,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998519590] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:38,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135409808] [2025-04-30 10:35:38,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:38,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:38,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:38,750 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-30 10:35:38,751 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-30 10:35:38,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:35:38,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:35:38,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:38,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:38,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-30 10:35:38,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:38,860 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-30 10:35:38,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:38,873 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-30 10:35:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135409808] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:38,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:38,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-30 10:35:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599381944] [2025-04-30 10:35:38,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:38,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:38,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:38,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:38,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:38,876 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-04-30 10:35:38,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:38,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:38,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-04-30 10:35:38,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:39,084 INFO L116 PetriNetUnfolderBase]: 64/332 cut-off events. [2025-04-30 10:35:39,084 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:39,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 332 events. 64/332 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1303 event pairs, 63 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 505. Up to 167 conditions per place. [2025-04-30 10:35:39,088 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-04-30 10:35:39,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 380 flow [2025-04-30 10:35:39,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:35:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:35:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2025-04-30 10:35:39,092 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7599502487562189 [2025-04-30 10:35:39,092 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 280 flow. Second operand 6 states and 611 transitions. [2025-04-30 10:35:39,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 380 flow [2025-04-30 10:35:39,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 137 transitions, 376 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:39,094 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 312 flow [2025-04-30 10:35:39,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2025-04-30 10:35:39,095 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 9 predicate places. [2025-04-30 10:35:39,095 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 312 flow [2025-04-30 10:35:39,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:39,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:39,096 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-04-30 10:35:39,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:35:39,296 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-30 10:35:39,297 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:39,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:39,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2035225237, now seen corresponding path program 2 times [2025-04-30 10:35:39,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:39,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573708974] [2025-04-30 10:35:39,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:39,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:39,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-04-30 10:35:39,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 7 statements. [2025-04-30 10:35:39,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:35:39,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:39,393 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-30 10:35:39,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:39,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573708974] [2025-04-30 10:35:39,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573708974] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:39,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:39,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:39,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915945028] [2025-04-30 10:35:39,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:39,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:39,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:39,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:39,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2025-04-30 10:35:39,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:39,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:39,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2025-04-30 10:35:39,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:39,620 INFO L116 PetriNetUnfolderBase]: 64/320 cut-off events. [2025-04-30 10:35:39,621 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:35:39,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 320 events. 64/320 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1245 event pairs, 63 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 490. Up to 165 conditions per place. [2025-04-30 10:35:39,626 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2025-04-30 10:35:39,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 388 flow [2025-04-30 10:35:39,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-04-30 10:35:39,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2025-04-30 10:35:39,633 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 312 flow. Second operand 3 states and 286 transitions. [2025-04-30 10:35:39,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 388 flow [2025-04-30 10:35:39,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 374 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:39,637 INFO L231 Difference]: Finished difference. Result has 134 places, 125 transitions, 298 flow [2025-04-30 10:35:39,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=134, PETRI_TRANSITIONS=125} [2025-04-30 10:35:39,638 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-04-30 10:35:39,639 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 298 flow [2025-04-30 10:35:39,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:39,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:39,639 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-04-30 10:35:39,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:35:39,640 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:39,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:39,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2035225238, now seen corresponding path program 1 times [2025-04-30 10:35:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:39,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555855533] [2025-04-30 10:35:39,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:39,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:39,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:35:39,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:35:39,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:39,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:39,782 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-30 10:35:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:39,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555855533] [2025-04-30 10:35:39,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555855533] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:39,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948036214] [2025-04-30 10:35:39,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:39,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:39,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:39,784 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-30 10:35:39,786 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-30 10:35:39,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:35:39,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:35:39,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:39,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:39,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:35:39,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:39,883 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-30 10:35:39,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:39,929 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-30 10:35:39,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948036214] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:39,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:39,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-30 10:35:39,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477481309] [2025-04-30 10:35:39,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:39,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:35:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:39,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:35:39,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:35:39,932 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-04-30 10:35:39,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 125 transitions, 298 flow. Second operand has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:39,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:39,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-04-30 10:35:39,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:40,073 INFO L116 PetriNetUnfolderBase]: 64/326 cut-off events. [2025-04-30 10:35:40,073 INFO L117 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-04-30 10:35:40,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 326 events. 64/326 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1246 event pairs, 63 based on Foata normal form. 6/254 useless extension candidates. Maximal degree in co-relation 496. Up to 167 conditions per place. [2025-04-30 10:35:40,075 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 11 changer transitions 0/131 dead transitions. [2025-04-30 10:35:40,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 131 transitions, 434 flow [2025-04-30 10:35:40,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:35:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:35:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1184 transitions. [2025-04-30 10:35:40,077 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2025-04-30 10:35:40,077 INFO L175 Difference]: Start difference. First operand has 134 places, 125 transitions, 298 flow. Second operand 12 states and 1184 transitions. [2025-04-30 10:35:40,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 131 transitions, 434 flow [2025-04-30 10:35:40,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 131 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:40,085 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 358 flow [2025-04-30 10:35:40,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=358, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2025-04-30 10:35:40,086 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 13 predicate places. [2025-04-30 10:35:40,087 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 358 flow [2025-04-30 10:35:40,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:40,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:40,088 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2025-04-30 10:35:40,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:35:40,289 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-30 10:35:40,289 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:40,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:40,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1784788554, now seen corresponding path program 2 times [2025-04-30 10:35:40,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:40,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169940852] [2025-04-30 10:35:40,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:40,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-30 10:35:40,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 13 statements. [2025-04-30 10:35:40,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:35:40,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:40,374 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-30 10:35:40,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:40,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169940852] [2025-04-30 10:35:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169940852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:40,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:40,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:40,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775396041] [2025-04-30 10:35:40,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:40,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:40,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:40,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:40,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2025-04-30 10:35:40,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 131 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:40,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:40,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2025-04-30 10:35:40,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:40,588 INFO L116 PetriNetUnfolderBase]: 64/314 cut-off events. [2025-04-30 10:35:40,589 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-30 10:35:40,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 314 events. 64/314 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1211 event pairs, 63 based on Foata normal form. 6/248 useless extension candidates. Maximal degree in co-relation 478. Up to 171 conditions per place. [2025-04-30 10:35:40,590 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2025-04-30 10:35:40,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 119 transitions, 434 flow [2025-04-30 10:35:40,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:40,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-04-30 10:35:40,592 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2025-04-30 10:35:40,592 INFO L175 Difference]: Start difference. First operand has 149 places, 131 transitions, 358 flow. Second operand 3 states and 298 transitions. [2025-04-30 10:35:40,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 119 transitions, 434 flow [2025-04-30 10:35:40,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 386 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-30 10:35:40,596 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 310 flow [2025-04-30 10:35:40,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2025-04-30 10:35:40,597 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-04-30 10:35:40,597 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 310 flow [2025-04-30 10:35:40,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:40,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:40,597 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-30 10:35:40,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:35:40,597 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:40,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:40,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1489825840, now seen corresponding path program 1 times [2025-04-30 10:35:40,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:40,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064887865] [2025-04-30 10:35:40,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:40,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:40,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:40,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:40,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:40,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:40,776 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-30 10:35:40,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:40,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064887865] [2025-04-30 10:35:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064887865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:40,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:40,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:40,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679931079] [2025-04-30 10:35:40,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:40,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:35:40,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:40,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:35:40,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:35:41,047 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 134 [2025-04-30 10:35:41,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:41,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:41,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 134 [2025-04-30 10:35:41,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:41,144 INFO L116 PetriNetUnfolderBase]: 73/332 cut-off events. [2025-04-30 10:35:41,144 INFO L117 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-04-30 10:35:41,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 332 events. 73/332 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1334 event pairs, 72 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 533. Up to 201 conditions per place. [2025-04-30 10:35:41,149 INFO L140 encePairwiseOnDemand]: 125/134 looper letters, 56 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2025-04-30 10:35:41,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 111 transitions, 408 flow [2025-04-30 10:35:41,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-04-30 10:35:41,153 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2025-04-30 10:35:41,153 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 310 flow. Second operand 3 states and 292 transitions. [2025-04-30 10:35:41,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 111 transitions, 408 flow [2025-04-30 10:35:41,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 111 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:41,155 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 272 flow [2025-04-30 10:35:41,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2025-04-30 10:35:41,157 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -10 predicate places. [2025-04-30 10:35:41,158 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 272 flow [2025-04-30 10:35:41,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:41,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:41,158 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-30 10:35:41,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:35:41,158 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:41,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1489825839, now seen corresponding path program 1 times [2025-04-30 10:35:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:41,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113773573] [2025-04-30 10:35:41,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:41,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:35:41,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:35:41,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:41,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:41,380 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-30 10:35:41,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:41,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113773573] [2025-04-30 10:35:41,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113773573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:41,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:41,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:35:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562130185] [2025-04-30 10:35:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:41,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:41,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:41,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:41,679 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 134 [2025-04-30 10:35:41,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:41,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:41,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 134 [2025-04-30 10:35:41,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:41,816 INFO L116 PetriNetUnfolderBase]: 73/327 cut-off events. [2025-04-30 10:35:41,816 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-30 10:35:41,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 327 events. 73/327 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1319 event pairs, 63 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 544. Up to 158 conditions per place. [2025-04-30 10:35:41,818 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 43 selfloop transitions, 14 changer transitions 3/116 dead transitions. [2025-04-30 10:35:41,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 402 flow [2025-04-30 10:35:41,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2025-04-30 10:35:41,819 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6850746268656717 [2025-04-30 10:35:41,819 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 272 flow. Second operand 5 states and 459 transitions. [2025-04-30 10:35:41,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 402 flow [2025-04-30 10:35:41,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 116 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:41,821 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 291 flow [2025-04-30 10:35:41,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2025-04-30 10:35:41,822 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -11 predicate places. [2025-04-30 10:35:41,822 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 291 flow [2025-04-30 10:35:41,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:41,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:41,822 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:41,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:35:41,822 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:41,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1242142843, now seen corresponding path program 1 times [2025-04-30 10:35:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:41,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063037087] [2025-04-30 10:35:41,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:41,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:35:41,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:35:41,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:41,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:42,108 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-30 10:35:42,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:42,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063037087] [2025-04-30 10:35:42,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063037087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:42,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:42,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:35:42,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592692527] [2025-04-30 10:35:42,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:42,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:42,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:42,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:42,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:42,544 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2025-04-30 10:35:42,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:42,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:42,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2025-04-30 10:35:42,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:42,727 INFO L116 PetriNetUnfolderBase]: 64/292 cut-off events. [2025-04-30 10:35:42,727 INFO L117 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-04-30 10:35:42,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 292 events. 64/292 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1115 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 525. Up to 166 conditions per place. [2025-04-30 10:35:42,729 INFO L140 encePairwiseOnDemand]: 112/134 looper letters, 46 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-04-30 10:35:42,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 102 transitions, 407 flow [2025-04-30 10:35:42,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:35:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:35:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 570 transitions. [2025-04-30 10:35:42,730 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5317164179104478 [2025-04-30 10:35:42,731 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 291 flow. Second operand 8 states and 570 transitions. [2025-04-30 10:35:42,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 102 transitions, 407 flow [2025-04-30 10:35:42,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 102 transitions, 379 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:42,732 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 287 flow [2025-04-30 10:35:42,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2025-04-30 10:35:42,733 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -13 predicate places. [2025-04-30 10:35:42,733 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 287 flow [2025-04-30 10:35:42,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:42,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:42,734 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:42,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:35:42,734 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:42,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1242142842, now seen corresponding path program 1 times [2025-04-30 10:35:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:42,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636852630] [2025-04-30 10:35:42,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:42,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:42,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:35:42,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:35:42,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:42,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:43,079 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-30 10:35:43,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:43,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636852630] [2025-04-30 10:35:43,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636852630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:43,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:43,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:35:43,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405868513] [2025-04-30 10:35:43,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:43,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:43,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:43,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:43,623 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2025-04-30 10:35:43,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 287 flow. Second operand has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:43,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:43,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2025-04-30 10:35:43,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:43,829 INFO L116 PetriNetUnfolderBase]: 64/290 cut-off events. [2025-04-30 10:35:43,830 INFO L117 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-04-30 10:35:43,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 290 events. 64/290 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1130 event pairs, 63 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 517. Up to 172 conditions per place. [2025-04-30 10:35:43,831 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 49 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2025-04-30 10:35:43,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 100 transitions, 407 flow [2025-04-30 10:35:43,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 446 transitions. [2025-04-30 10:35:43,833 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47547974413646055 [2025-04-30 10:35:43,833 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 287 flow. Second operand 7 states and 446 transitions. [2025-04-30 10:35:43,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 100 transitions, 407 flow [2025-04-30 10:35:43,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 373 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-30 10:35:43,834 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 275 flow [2025-04-30 10:35:43,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2025-04-30 10:35:43,835 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -16 predicate places. [2025-04-30 10:35:43,835 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 275 flow [2025-04-30 10:35:43,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:43,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:43,837 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:43,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:35:43,837 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:43,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:43,837 INFO L85 PathProgramCache]: Analyzing trace with hash 301661875, now seen corresponding path program 1 times [2025-04-30 10:35:43,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:43,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203210050] [2025-04-30 10:35:43,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:43,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:43,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:35:43,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:35:43,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:43,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:44,025 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-30 10:35:44,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:44,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203210050] [2025-04-30 10:35:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203210050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:44,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:44,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:44,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179671109] [2025-04-30 10:35:44,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:44,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:44,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:44,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:44,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:44,244 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2025-04-30 10:35:44,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:44,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:44,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2025-04-30 10:35:44,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:44,367 INFO L116 PetriNetUnfolderBase]: 64/289 cut-off events. [2025-04-30 10:35:44,367 INFO L117 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-04-30 10:35:44,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 289 events. 64/289 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1117 event pairs, 63 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 503. Up to 171 conditions per place. [2025-04-30 10:35:44,368 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 40 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2025-04-30 10:35:44,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 99 transitions, 379 flow [2025-04-30 10:35:44,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2025-04-30 10:35:44,370 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6477611940298508 [2025-04-30 10:35:44,370 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 275 flow. Second operand 5 states and 434 transitions. [2025-04-30 10:35:44,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 99 transitions, 379 flow [2025-04-30 10:35:44,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 99 transitions, 353 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:35:44,372 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 273 flow [2025-04-30 10:35:44,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2025-04-30 10:35:44,373 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -19 predicate places. [2025-04-30 10:35:44,373 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 273 flow [2025-04-30 10:35:44,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:44,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:44,373 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:44,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:35:44,373 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:44,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash 301661874, now seen corresponding path program 1 times [2025-04-30 10:35:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:44,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830700174] [2025-04-30 10:35:44,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:44,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:44,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:35:44,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:35:44,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:44,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:44,452 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-30 10:35:44,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:44,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830700174] [2025-04-30 10:35:44,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830700174] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:44,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425134660] [2025-04-30 10:35:44,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:44,453 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:44,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:44,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:44,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:44,643 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-04-30 10:35:44,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 99 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:44,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:44,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-04-30 10:35:44,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:44,765 INFO L116 PetriNetUnfolderBase]: 64/288 cut-off events. [2025-04-30 10:35:44,766 INFO L117 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-04-30 10:35:44,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 288 events. 64/288 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1119 event pairs, 63 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 508. Up to 171 conditions per place. [2025-04-30 10:35:44,767 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 46 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2025-04-30 10:35:44,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 389 flow [2025-04-30 10:35:44,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2025-04-30 10:35:44,769 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2025-04-30 10:35:44,769 INFO L175 Difference]: Start difference. First operand has 117 places, 99 transitions, 273 flow. Second operand 5 states and 410 transitions. [2025-04-30 10:35:44,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 98 transitions, 389 flow [2025-04-30 10:35:44,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 98 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:44,772 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 271 flow [2025-04-30 10:35:44,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2025-04-30 10:35:44,773 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2025-04-30 10:35:44,773 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 271 flow [2025-04-30 10:35:44,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:44,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:44,773 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:44,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:35:44,773 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:44,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:44,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1738127333, now seen corresponding path program 1 times [2025-04-30 10:35:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:44,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738332766] [2025-04-30 10:35:44,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:44,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:44,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:35:44,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:35:44,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:44,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:45,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:45,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738332766] [2025-04-30 10:35:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738332766] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:45,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:45,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:45,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231793232] [2025-04-30 10:35:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:45,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:35:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:45,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:35:45,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:35:45,377 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2025-04-30 10:35:45,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:45,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:45,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2025-04-30 10:35:45,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:45,490 INFO L116 PetriNetUnfolderBase]: 73/315 cut-off events. [2025-04-30 10:35:45,490 INFO L117 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-04-30 10:35:45,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 315 events. 73/315 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1307 event pairs, 63 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 545. Up to 164 conditions per place. [2025-04-30 10:35:45,492 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 54 selfloop transitions, 3 changer transitions 3/104 dead transitions. [2025-04-30 10:35:45,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 403 flow [2025-04-30 10:35:45,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:35:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:35:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2025-04-30 10:35:45,494 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.710820895522388 [2025-04-30 10:35:45,494 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 271 flow. Second operand 4 states and 381 transitions. [2025-04-30 10:35:45,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 403 flow [2025-04-30 10:35:45,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:45,495 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 245 flow [2025-04-30 10:35:45,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2025-04-30 10:35:45,496 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -24 predicate places. [2025-04-30 10:35:45,496 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 245 flow [2025-04-30 10:35:45,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:45,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:45,496 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-30 10:35:45,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:35:45,497 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:45,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash 334476519, now seen corresponding path program 1 times [2025-04-30 10:35:45,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:45,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427616868] [2025-04-30 10:35:45,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:45,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:45,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:35:45,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:35:45,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:45,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:45,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-30 10:35:45,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:45,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427616868] [2025-04-30 10:35:45,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427616868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:45,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:45,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:35:45,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375768743] [2025-04-30 10:35:45,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:45,834 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:45,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:45,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:45,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:46,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2025-04-30 10:35:46,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 95 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:46,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:46,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2025-04-30 10:35:46,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:46,538 INFO L116 PetriNetUnfolderBase]: 64/281 cut-off events. [2025-04-30 10:35:46,539 INFO L117 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-04-30 10:35:46,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 281 events. 64/281 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1105 event pairs, 54 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 498. Up to 132 conditions per place. [2025-04-30 10:35:46,540 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 48 selfloop transitions, 16 changer transitions 3/100 dead transitions. [2025-04-30 10:35:46,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 389 flow [2025-04-30 10:35:46,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:35:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:35:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 453 transitions. [2025-04-30 10:35:46,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48294243070362475 [2025-04-30 10:35:46,542 INFO L175 Difference]: Start difference. First operand has 112 places, 95 transitions, 245 flow. Second operand 7 states and 453 transitions. [2025-04-30 10:35:46,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 389 flow [2025-04-30 10:35:46,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 383 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:35:46,544 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 263 flow [2025-04-30 10:35:46,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2025-04-30 10:35:46,544 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2025-04-30 10:35:46,544 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 263 flow [2025-04-30 10:35:46,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:46,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:46,545 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-30 10:35:46,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:35:46,545 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:46,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash 334476518, now seen corresponding path program 1 times [2025-04-30 10:35:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:46,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29980258] [2025-04-30 10:35:46,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:46,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:35:46,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:35:46,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:46,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:46,753 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-30 10:35:46,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:46,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29980258] [2025-04-30 10:35:46,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29980258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:46,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:46,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:35:46,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460033625] [2025-04-30 10:35:46,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:46,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:35:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:46,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:35:46,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:35:47,114 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2025-04-30 10:35:47,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:47,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:47,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2025-04-30 10:35:47,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:47,318 INFO L116 PetriNetUnfolderBase]: 64/279 cut-off events. [2025-04-30 10:35:47,318 INFO L117 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-04-30 10:35:47,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 279 events. 64/279 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/233 useless extension candidates. Maximal degree in co-relation 513. Up to 130 conditions per place. [2025-04-30 10:35:47,319 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 49 selfloop transitions, 18 changer transitions 3/98 dead transitions. [2025-04-30 10:35:47,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 417 flow [2025-04-30 10:35:47,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:35:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:35:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 574 transitions. [2025-04-30 10:35:47,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5354477611940298 [2025-04-30 10:35:47,321 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 263 flow. Second operand 8 states and 574 transitions. [2025-04-30 10:35:47,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 417 flow [2025-04-30 10:35:47,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 385 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:35:47,323 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 263 flow [2025-04-30 10:35:47,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2025-04-30 10:35:47,323 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2025-04-30 10:35:47,323 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 263 flow [2025-04-30 10:35:47,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:47,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:47,324 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, 1] [2025-04-30 10:35:47,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:35:47,324 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:47,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:47,324 INFO L85 PathProgramCache]: Analyzing trace with hash -690587040, now seen corresponding path program 1 times [2025-04-30 10:35:47,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:47,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467059163] [2025-04-30 10:35:47,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:47,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:47,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:35:47,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:35:47,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:47,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:47,423 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-30 10:35:47,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:47,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467059163] [2025-04-30 10:35:47,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467059163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:47,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:47,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:47,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101511458] [2025-04-30 10:35:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:47,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:47,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:47,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:47,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:47,592 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-04-30 10:35:47,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:47,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:47,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-04-30 10:35:47,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:47,700 INFO L116 PetriNetUnfolderBase]: 64/278 cut-off events. [2025-04-30 10:35:47,701 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-30 10:35:47,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 278 events. 64/278 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1096 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 511. Up to 170 conditions per place. [2025-04-30 10:35:47,702 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 45 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2025-04-30 10:35:47,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 377 flow [2025-04-30 10:35:47,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2025-04-30 10:35:47,705 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6104477611940299 [2025-04-30 10:35:47,705 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 263 flow. Second operand 5 states and 409 transitions. [2025-04-30 10:35:47,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 88 transitions, 377 flow [2025-04-30 10:35:47,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 88 transitions, 341 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-30 10:35:47,706 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 251 flow [2025-04-30 10:35:47,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2025-04-30 10:35:47,707 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2025-04-30 10:35:47,707 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 251 flow [2025-04-30 10:35:47,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:47,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:47,707 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, 1] [2025-04-30 10:35:47,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:35:47,708 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:47,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:47,708 INFO L85 PathProgramCache]: Analyzing trace with hash -690587039, now seen corresponding path program 1 times [2025-04-30 10:35:47,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:47,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525647240] [2025-04-30 10:35:47,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:47,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:47,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:35:47,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:35:47,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:47,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-04-30 10:35:47,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:47,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525647240] [2025-04-30 10:35:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525647240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:47,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496627776] [2025-04-30 10:35:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:47,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:47,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:47,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:48,076 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2025-04-30 10:35:48,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:48,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:48,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2025-04-30 10:35:48,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:48,191 INFO L116 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-04-30 10:35:48,191 INFO L117 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-04-30 10:35:48,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 277 events. 64/277 cut-off events. For 65/65 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/233 useless extension candidates. Maximal degree in co-relation 490. Up to 170 conditions per place. [2025-04-30 10:35:48,193 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 39 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2025-04-30 10:35:48,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 87 transitions, 353 flow [2025-04-30 10:35:48,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2025-04-30 10:35:48,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6462686567164179 [2025-04-30 10:35:48,194 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 251 flow. Second operand 5 states and 433 transitions. [2025-04-30 10:35:48,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 87 transitions, 353 flow [2025-04-30 10:35:48,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 87 transitions, 327 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:35:48,196 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 249 flow [2025-04-30 10:35:48,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2025-04-30 10:35:48,198 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2025-04-30 10:35:48,198 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 249 flow [2025-04-30 10:35:48,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:48,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:48,198 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, 1, 1, 1, 1, 1] [2025-04-30 10:35:48,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:35:48,199 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-04-30 10:35:48,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash 969285793, now seen corresponding path program 1 times [2025-04-30 10:35:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:48,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775081719] [2025-04-30 10:35:48,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:48,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:35:48,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:35:48,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:48,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:35:49,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:49,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775081719] [2025-04-30 10:35:49,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775081719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:49,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923854172] [2025-04-30 10:35:49,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:49,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:49,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:49,362 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-30 10:35:49,363 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-30 10:35:49,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:35:49,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:35:49,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:49,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:49,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-04-30 10:35:49,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:49,611 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-30 10:35:49,621 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-30 10:35:49,706 INFO L325 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-04-30 10:35:49,706 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-30 10:35:49,712 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 15 treesize of output 11 [2025-04-30 10:35:49,717 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-30 10:35:49,720 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 22 treesize of output 17 [2025-04-30 10:35:49,877 INFO L325 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-04-30 10:35:49,877 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 20 treesize of output 22 [2025-04-30 10:35:49,898 INFO L325 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2025-04-30 10:35:49,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 37 [2025-04-30 10:35:50,037 INFO L325 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-04-30 10:35:50,037 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2025-04-30 10:35:50,061 INFO L325 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-04-30 10:35:50,062 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 38 [2025-04-30 10:35:50,079 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-30 10:35:50,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-04-30 10:35:50,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2025-04-30 10:35:51,314 INFO L325 Elim1Store]: treesize reduction 94, result has 69.1 percent of original size [2025-04-30 10:35:51,314 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 147 treesize of output 319 Killed by 15