./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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.2.5-dev-84cfde4 [2024-10-11 19:44:24,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:44:24,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:44:24,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:44:24,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:44:24,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:44:24,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:44:24,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:44:24,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:44:24,882 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:44:24,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:44:24,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:44:24,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:44:24,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:44:24,884 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:44:24,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:44:24,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:44:24,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:44:24,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:44:24,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:44:24,886 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:44:24,889 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:44:24,889 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:44:24,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:44:24,890 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:44:24,890 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:44:24,890 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:44:24,890 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:44:24,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:44:24,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:44:24,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:44:24,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:44:24,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:44:24,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:44:24,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:44:24,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:44:24,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:44:24,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:44:24,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:44:24,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:44:24,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:44:24,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:44:24,895 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 [2024-10-11 19:44:25,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:44:25,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:44:25,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:44:25,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:44:25,187 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:44:25,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2024-10-11 19:44:26,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:44:26,906 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:44:26,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2024-10-11 19:44:26,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3d7f99556/1cc855a181bc46afa9ae8f6ab82211d6/FLAG95772ebd7 [2024-10-11 19:44:26,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3d7f99556/1cc855a181bc46afa9ae8f6ab82211d6 [2024-10-11 19:44:26,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:44:26,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:44:26,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:44:26,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:44:26,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:44:26,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:44:26" (1/1) ... [2024-10-11 19:44:26,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a83092c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:26, skipping insertion in model container [2024-10-11 19:44:26,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:44:26" (1/1) ... [2024-10-11 19:44:27,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:44:27,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:44:27,571 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:44:27,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:44:27,741 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:44:27,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27 WrapperNode [2024-10-11 19:44:27,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:44:27,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:44:27,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:44:27,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:44:27,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,821 INFO L138 Inliner]: procedures = 370, calls = 40, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 202 [2024-10-11 19:44:27,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:44:27,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:44:27,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:44:27,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:44:27,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,873 INFO L175 MemorySlicer]: Split 41 memory accesses to 3 slices as follows [31, 1, 9]. 76 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 28 writes are split as follows [24, 1, 3]. [2024-10-11 19:44:27,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:44:27,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:44:27,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:44:27,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:44:27,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (1/1) ... [2024-10-11 19:44:27,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:44:27,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:44:27,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:44:27,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:44:27,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:44:27,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:44:27,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:44:27,975 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 19:44:27,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 19:44:27,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 19:44:27,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 19:44:27,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 19:44:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 19:44:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 19:44:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 19:44:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:44:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:44:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:44:27,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:44:27,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:44:27,977 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 19:44:27,977 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 19:44:27,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:44:27,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:44:27,980 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:44:28,132 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:44:28,134 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:44:28,714 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:44:28,714 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:44:29,034 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:44:29,034 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 19:44:29,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:29 BoogieIcfgContainer [2024-10-11 19:44:29,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:44:29,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:44:29,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:44:29,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:44:29,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:44:26" (1/3) ... [2024-10-11 19:44:29,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691d77d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:44:29, skipping insertion in model container [2024-10-11 19:44:29,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:27" (2/3) ... [2024-10-11 19:44:29,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691d77d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:44:29, skipping insertion in model container [2024-10-11 19:44:29,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:29" (3/3) ... [2024-10-11 19:44:29,043 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr-deref.i [2024-10-11 19:44:29,062 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:44:29,063 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2024-10-11 19:44:29,063 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:44:29,129 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:44:29,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 272 flow [2024-10-11 19:44:29,227 INFO L124 PetriNetUnfolderBase]: 1/133 cut-off events. [2024-10-11 19:44:29,227 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:29,230 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. [2024-10-11 19:44:29,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 134 transitions, 272 flow [2024-10-11 19:44:29,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 269 flow [2024-10-11 19:44:29,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:44:29,258 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@670329e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:44:29,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-10-11 19:44:29,262 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:44:29,262 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-10-11 19:44:29,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:29,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:29,263 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:44:29,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:29,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash 643940, now seen corresponding path program 1 times [2024-10-11 19:44:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:29,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818673015] [2024-10-11 19:44:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:29,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:29,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:29,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818673015] [2024-10-11 19:44:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818673015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:29,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:29,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:44:29,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451567414] [2024-10-11 19:44:29,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:29,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:29,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:29,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:29,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2024-10-11 19:44:29,625 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) [2024-10-11 19:44:29,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:29,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2024-10-11 19:44:29,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:29,832 INFO L124 PetriNetUnfolderBase]: 64/329 cut-off events. [2024-10-11 19:44:29,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:29,836 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. [2024-10-11 19:44:29,839 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-10-11 19:44:29,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 353 flow [2024-10-11 19:44:29,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2024-10-11 19:44:29,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8059701492537313 [2024-10-11 19:44:29,859 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 269 flow. Second operand 3 states and 324 transitions. [2024-10-11 19:44:29,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 353 flow [2024-10-11 19:44:29,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:29,866 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 280 flow [2024-10-11 19:44:29,868 INFO L260 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} [2024-10-11 19:44:29,873 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2024-10-11 19:44:29,874 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 280 flow [2024-10-11 19:44:29,874 INFO L472 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) [2024-10-11 19:44:29,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:29,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-11 19:44:29,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:44:29,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:29,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash 19958118, now seen corresponding path program 1 times [2024-10-11 19:44:29,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:29,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050079200] [2024-10-11 19:44:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:29,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:29,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050079200] [2024-10-11 19:44:29,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050079200] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:44:29,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210648317] [2024-10-11 19:44:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:44:29,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:44:29,996 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:44:29,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 19:44:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:30,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:44:30,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:30,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:44:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:30,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210648317] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:44:30,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:44:30,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 19:44:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81603328] [2024-10-11 19:44:30,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:44:30,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:44:30,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:30,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:44:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:44:30,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2024-10-11 19:44:30,155 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) [2024-10-11 19:44:30,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:30,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2024-10-11 19:44:30,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:30,370 INFO L124 PetriNetUnfolderBase]: 64/332 cut-off events. [2024-10-11 19:44:30,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:30,371 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. [2024-10-11 19:44:30,376 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2024-10-11 19:44:30,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 380 flow [2024-10-11 19:44:30,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:44:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:44:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2024-10-11 19:44:30,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7599502487562189 [2024-10-11 19:44:30,385 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 280 flow. Second operand 6 states and 611 transitions. [2024-10-11 19:44:30,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 380 flow [2024-10-11 19:44:30,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 137 transitions, 376 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:30,389 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 312 flow [2024-10-11 19:44:30,389 INFO L260 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} [2024-10-11 19:44:30,391 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 9 predicate places. [2024-10-11 19:44:30,391 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 312 flow [2024-10-11 19:44:30,392 INFO L472 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) [2024-10-11 19:44:30,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:30,393 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-10-11 19:44:30,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 19:44:30,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:44:30,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:30,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:30,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1862812644, now seen corresponding path program 2 times [2024-10-11 19:44:30,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:30,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766709949] [2024-10-11 19:44:30,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:30,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 19:44:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:30,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766709949] [2024-10-11 19:44:30,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766709949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:30,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:30,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:44:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660881010] [2024-10-11 19:44:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:30,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:30,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:30,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:30,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2024-10-11 19:44:30,847 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) [2024-10-11 19:44:30,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:30,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2024-10-11 19:44:30,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:31,009 INFO L124 PetriNetUnfolderBase]: 64/320 cut-off events. [2024-10-11 19:44:31,010 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:44:31,012 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. [2024-10-11 19:44:31,014 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2024-10-11 19:44:31,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 388 flow [2024-10-11 19:44:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2024-10-11 19:44:31,017 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2024-10-11 19:44:31,017 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 312 flow. Second operand 3 states and 286 transitions. [2024-10-11 19:44:31,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 388 flow [2024-10-11 19:44:31,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 374 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:31,022 INFO L231 Difference]: Finished difference. Result has 134 places, 125 transitions, 298 flow [2024-10-11 19:44:31,022 INFO L260 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} [2024-10-11 19:44:31,023 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-10-11 19:44:31,023 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 298 flow [2024-10-11 19:44:31,023 INFO L472 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) [2024-10-11 19:44:31,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:31,024 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-10-11 19:44:31,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:44:31,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:31,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1862812645, now seen corresponding path program 1 times [2024-10-11 19:44:31,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:31,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58766099] [2024-10-11 19:44:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:31,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58766099] [2024-10-11 19:44:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58766099] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:44:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462711516] [2024-10-11 19:44:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:31,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:44:31,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:44:31,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 19:44:31,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 19:44:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:31,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:44:31,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:31,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:44:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462711516] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:44:31,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 19:44:31,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-11 19:44:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128574748] [2024-10-11 19:44:31,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 19:44:31,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:44:31,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:31,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:44:31,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:44:31,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2024-10-11 19:44:31,317 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) [2024-10-11 19:44:31,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:31,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2024-10-11 19:44:31,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:31,475 INFO L124 PetriNetUnfolderBase]: 64/326 cut-off events. [2024-10-11 19:44:31,476 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-11 19:44:31,477 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 1242 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. [2024-10-11 19:44:31,478 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 11 changer transitions 0/131 dead transitions. [2024-10-11 19:44:31,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 131 transitions, 434 flow [2024-10-11 19:44:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:44:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 19:44:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1184 transitions. [2024-10-11 19:44:31,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2024-10-11 19:44:31,482 INFO L175 Difference]: Start difference. First operand has 134 places, 125 transitions, 298 flow. Second operand 12 states and 1184 transitions. [2024-10-11 19:44:31,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 131 transitions, 434 flow [2024-10-11 19:44:31,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 131 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:31,488 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 358 flow [2024-10-11 19:44:31,488 INFO L260 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} [2024-10-11 19:44:31,488 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 13 predicate places. [2024-10-11 19:44:31,489 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 358 flow [2024-10-11 19:44:31,490 INFO L472 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) [2024-10-11 19:44:31,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:31,490 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2024-10-11 19:44:31,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:44:31,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 19:44:31,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:31,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:31,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1282607963, now seen corresponding path program 2 times [2024-10-11 19:44:31,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:31,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693754349] [2024-10-11 19:44:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:31,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693754349] [2024-10-11 19:44:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693754349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:31,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:31,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:44:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577709996] [2024-10-11 19:44:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:31,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:31,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:31,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:31,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2024-10-11 19:44:31,948 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) [2024-10-11 19:44:31,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:31,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2024-10-11 19:44:31,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:32,066 INFO L124 PetriNetUnfolderBase]: 64/314 cut-off events. [2024-10-11 19:44:32,067 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-11 19:44:32,067 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. [2024-10-11 19:44:32,069 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2024-10-11 19:44:32,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 119 transitions, 434 flow [2024-10-11 19:44:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-10-11 19:44:32,070 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2024-10-11 19:44:32,071 INFO L175 Difference]: Start difference. First operand has 149 places, 131 transitions, 358 flow. Second operand 3 states and 298 transitions. [2024-10-11 19:44:32,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 119 transitions, 434 flow [2024-10-11 19:44:32,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 386 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-10-11 19:44:32,075 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 310 flow [2024-10-11 19:44:32,075 INFO L260 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} [2024-10-11 19:44:32,076 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-10-11 19:44:32,076 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 310 flow [2024-10-11 19:44:32,076 INFO L472 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) [2024-10-11 19:44:32,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:32,077 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-10-11 19:44:32,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:44:32,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:32,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash 69381473, now seen corresponding path program 1 times [2024-10-11 19:44:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304793325] [2024-10-11 19:44:32,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:32,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304793325] [2024-10-11 19:44:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304793325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:32,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:32,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:44:32,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814782284] [2024-10-11 19:44:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:32,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:44:32,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:32,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:44:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:44:32,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 134 [2024-10-11 19:44:32,591 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) [2024-10-11 19:44:32,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:32,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 134 [2024-10-11 19:44:32,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:32,699 INFO L124 PetriNetUnfolderBase]: 73/332 cut-off events. [2024-10-11 19:44:32,699 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-10-11 19:44:32,700 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. [2024-10-11 19:44:32,701 INFO L140 encePairwiseOnDemand]: 125/134 looper letters, 56 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2024-10-11 19:44:32,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 111 transitions, 408 flow [2024-10-11 19:44:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-10-11 19:44:32,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2024-10-11 19:44:32,703 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 310 flow. Second operand 3 states and 292 transitions. [2024-10-11 19:44:32,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 111 transitions, 408 flow [2024-10-11 19:44:32,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 111 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:32,708 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 272 flow [2024-10-11 19:44:32,708 INFO L260 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} [2024-10-11 19:44:32,709 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -10 predicate places. [2024-10-11 19:44:32,709 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 272 flow [2024-10-11 19:44:32,711 INFO L472 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) [2024-10-11 19:44:32,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:32,711 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-10-11 19:44:32,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:44:32,712 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:32,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash 69381474, now seen corresponding path program 1 times [2024-10-11 19:44:32,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:32,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902642973] [2024-10-11 19:44:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:32,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:32,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:32,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902642973] [2024-10-11 19:44:32,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902642973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:32,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:32,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:44:32,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993533465] [2024-10-11 19:44:32,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:32,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:44:32,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:44:32,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:44:33,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 134 [2024-10-11 19:44:33,299 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) [2024-10-11 19:44:33,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:33,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 134 [2024-10-11 19:44:33,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:33,503 INFO L124 PetriNetUnfolderBase]: 73/327 cut-off events. [2024-10-11 19:44:33,503 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-11 19:44:33,504 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. [2024-10-11 19:44:33,505 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 43 selfloop transitions, 14 changer transitions 3/116 dead transitions. [2024-10-11 19:44:33,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 402 flow [2024-10-11 19:44:33,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:44:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:44:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2024-10-11 19:44:33,507 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6850746268656717 [2024-10-11 19:44:33,507 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 272 flow. Second operand 5 states and 459 transitions. [2024-10-11 19:44:33,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 402 flow [2024-10-11 19:44:33,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 116 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:33,511 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 291 flow [2024-10-11 19:44:33,512 INFO L260 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} [2024-10-11 19:44:33,512 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -11 predicate places. [2024-10-11 19:44:33,512 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 291 flow [2024-10-11 19:44:33,513 INFO L472 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) [2024-10-11 19:44:33,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:33,513 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:33,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 19:44:33,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:33,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1348957676, now seen corresponding path program 1 times [2024-10-11 19:44:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055251841] [2024-10-11 19:44:33,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:33,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:33,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055251841] [2024-10-11 19:44:33,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055251841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:33,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:33,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:44:33,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289972996] [2024-10-11 19:44:33,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:33,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:44:33,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:33,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:44:33,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:44:34,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2024-10-11 19:44:34,393 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) [2024-10-11 19:44:34,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:34,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2024-10-11 19:44:34,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:34,643 INFO L124 PetriNetUnfolderBase]: 64/292 cut-off events. [2024-10-11 19:44:34,643 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-11 19:44:34,644 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. [2024-10-11 19:44:34,645 INFO L140 encePairwiseOnDemand]: 112/134 looper letters, 46 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2024-10-11 19:44:34,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 102 transitions, 407 flow [2024-10-11 19:44:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:44:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:44:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 570 transitions. [2024-10-11 19:44:34,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5317164179104478 [2024-10-11 19:44:34,647 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 291 flow. Second operand 8 states and 570 transitions. [2024-10-11 19:44:34,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 102 transitions, 407 flow [2024-10-11 19:44:34,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 102 transitions, 379 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:44:34,649 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 287 flow [2024-10-11 19:44:34,650 INFO L260 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} [2024-10-11 19:44:34,650 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -13 predicate places. [2024-10-11 19:44:34,650 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 287 flow [2024-10-11 19:44:34,651 INFO L472 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) [2024-10-11 19:44:34,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:34,651 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:34,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:44:34,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:34,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1348957675, now seen corresponding path program 1 times [2024-10-11 19:44:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:34,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654959048] [2024-10-11 19:44:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:35,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654959048] [2024-10-11 19:44:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654959048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:35,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:35,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:44:35,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372481338] [2024-10-11 19:44:35,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:35,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:44:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:35,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:44:35,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:44:35,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2024-10-11 19:44:35,727 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) [2024-10-11 19:44:35,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:35,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2024-10-11 19:44:35,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:35,952 INFO L124 PetriNetUnfolderBase]: 64/290 cut-off events. [2024-10-11 19:44:35,953 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-11 19:44:35,953 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. [2024-10-11 19:44:35,954 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 49 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-10-11 19:44:35,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 100 transitions, 407 flow [2024-10-11 19:44:35,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:44:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:44:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 446 transitions. [2024-10-11 19:44:35,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47547974413646055 [2024-10-11 19:44:35,956 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 287 flow. Second operand 7 states and 446 transitions. [2024-10-11 19:44:35,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 100 transitions, 407 flow [2024-10-11 19:44:35,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 373 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 19:44:35,959 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 275 flow [2024-10-11 19:44:35,959 INFO L260 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} [2024-10-11 19:44:35,960 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -16 predicate places. [2024-10-11 19:44:35,960 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 275 flow [2024-10-11 19:44:35,960 INFO L472 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) [2024-10-11 19:44:35,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:35,961 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:35,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:44:35,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:35,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash 731818980, now seen corresponding path program 1 times [2024-10-11 19:44:35,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:35,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410612070] [2024-10-11 19:44:35,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:35,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410612070] [2024-10-11 19:44:36,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410612070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:36,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:36,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:44:36,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454078104] [2024-10-11 19:44:36,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:36,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:44:36,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:36,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:44:36,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:44:36,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2024-10-11 19:44:36,425 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) [2024-10-11 19:44:36,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:36,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2024-10-11 19:44:36,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:36,581 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2024-10-11 19:44:36,582 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-10-11 19:44:36,582 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. [2024-10-11 19:44:36,583 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 40 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2024-10-11 19:44:36,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 99 transitions, 379 flow [2024-10-11 19:44:36,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:44:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:44:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2024-10-11 19:44:36,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6477611940298508 [2024-10-11 19:44:36,585 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 275 flow. Second operand 5 states and 434 transitions. [2024-10-11 19:44:36,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 99 transitions, 379 flow [2024-10-11 19:44:36,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 99 transitions, 353 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 19:44:36,588 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 273 flow [2024-10-11 19:44:36,588 INFO L260 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} [2024-10-11 19:44:36,589 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -19 predicate places. [2024-10-11 19:44:36,589 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 273 flow [2024-10-11 19:44:36,589 INFO L472 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) [2024-10-11 19:44:36,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:36,590 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:36,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 19:44:36,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:36,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash 731818979, now seen corresponding path program 1 times [2024-10-11 19:44:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856873434] [2024-10-11 19:44:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:36,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:36,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856873434] [2024-10-11 19:44:36,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856873434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:36,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:36,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:44:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197222444] [2024-10-11 19:44:36,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:36,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:44:36,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:36,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:44:36,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:44:36,931 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2024-10-11 19:44:36,931 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) [2024-10-11 19:44:36,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:36,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2024-10-11 19:44:36,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:37,102 INFO L124 PetriNetUnfolderBase]: 64/288 cut-off events. [2024-10-11 19:44:37,103 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-10-11 19:44:37,103 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. [2024-10-11 19:44:37,104 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 46 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2024-10-11 19:44:37,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 389 flow [2024-10-11 19:44:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:44:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:44:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2024-10-11 19:44:37,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2024-10-11 19:44:37,106 INFO L175 Difference]: Start difference. First operand has 117 places, 99 transitions, 273 flow. Second operand 5 states and 410 transitions. [2024-10-11 19:44:37,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 98 transitions, 389 flow [2024-10-11 19:44:37,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 98 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:44:37,109 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 271 flow [2024-10-11 19:44:37,109 INFO L260 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} [2024-10-11 19:44:37,109 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2024-10-11 19:44:37,110 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 271 flow [2024-10-11 19:44:37,110 INFO L472 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) [2024-10-11 19:44:37,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:37,110 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:37,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 19:44:37,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:37,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:37,111 INFO L85 PathProgramCache]: Analyzing trace with hash 365922887, now seen corresponding path program 1 times [2024-10-11 19:44:37,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:37,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762203219] [2024-10-11 19:44:37,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:37,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:37,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:37,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762203219] [2024-10-11 19:44:37,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762203219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:37,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:37,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:44:37,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061092920] [2024-10-11 19:44:37,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:37,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:44:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:37,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:44:37,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:44:37,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2024-10-11 19:44:37,828 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) [2024-10-11 19:44:37,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:37,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2024-10-11 19:44:37,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:37,991 INFO L124 PetriNetUnfolderBase]: 73/315 cut-off events. [2024-10-11 19:44:37,991 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-10-11 19:44:37,992 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 1305 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. [2024-10-11 19:44:37,994 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 54 selfloop transitions, 3 changer transitions 3/104 dead transitions. [2024-10-11 19:44:37,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 403 flow [2024-10-11 19:44:37,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:44:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:44:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2024-10-11 19:44:37,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.710820895522388 [2024-10-11 19:44:37,996 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 271 flow. Second operand 4 states and 381 transitions. [2024-10-11 19:44:37,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 403 flow [2024-10-11 19:44:37,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:44:38,001 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 245 flow [2024-10-11 19:44:38,002 INFO L260 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} [2024-10-11 19:44:38,002 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -24 predicate places. [2024-10-11 19:44:38,002 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 245 flow [2024-10-11 19:44:38,003 INFO L472 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) [2024-10-11 19:44:38,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:38,003 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:38,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 19:44:38,006 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:38,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash 874402569, now seen corresponding path program 1 times [2024-10-11 19:44:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:38,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963774671] [2024-10-11 19:44:38,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:38,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:38,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963774671] [2024-10-11 19:44:38,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963774671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:38,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:38,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:44:38,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15903383] [2024-10-11 19:44:38,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:38,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:44:38,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:38,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:44:38,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:44:39,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2024-10-11 19:44:39,094 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) [2024-10-11 19:44:39,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:39,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2024-10-11 19:44:39,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:39,328 INFO L124 PetriNetUnfolderBase]: 64/281 cut-off events. [2024-10-11 19:44:39,328 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-11 19:44:39,329 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. [2024-10-11 19:44:39,331 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 48 selfloop transitions, 16 changer transitions 3/100 dead transitions. [2024-10-11 19:44:39,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 389 flow [2024-10-11 19:44:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:44:39,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:44:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 453 transitions. [2024-10-11 19:44:39,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48294243070362475 [2024-10-11 19:44:39,333 INFO L175 Difference]: Start difference. First operand has 112 places, 95 transitions, 245 flow. Second operand 7 states and 453 transitions. [2024-10-11 19:44:39,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 389 flow [2024-10-11 19:44:39,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 383 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:44:39,336 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 263 flow [2024-10-11 19:44:39,337 INFO L260 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} [2024-10-11 19:44:39,338 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2024-10-11 19:44:39,338 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 263 flow [2024-10-11 19:44:39,338 INFO L472 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) [2024-10-11 19:44:39,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:39,339 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:39,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 19:44:39,339 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:39,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash 874402568, now seen corresponding path program 1 times [2024-10-11 19:44:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:39,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610114] [2024-10-11 19:44:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:39,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:39,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610114] [2024-10-11 19:44:39,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:39,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:39,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:44:39,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112817812] [2024-10-11 19:44:39,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:39,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 19:44:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:39,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 19:44:39,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 19:44:40,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2024-10-11 19:44:40,091 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) [2024-10-11 19:44:40,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:40,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2024-10-11 19:44:40,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:40,299 INFO L124 PetriNetUnfolderBase]: 64/279 cut-off events. [2024-10-11 19:44:40,299 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-11 19:44:40,300 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. [2024-10-11 19:44:40,301 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 49 selfloop transitions, 18 changer transitions 3/98 dead transitions. [2024-10-11 19:44:40,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 417 flow [2024-10-11 19:44:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:44:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:44:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 574 transitions. [2024-10-11 19:44:40,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5354477611940298 [2024-10-11 19:44:40,303 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 263 flow. Second operand 8 states and 574 transitions. [2024-10-11 19:44:40,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 417 flow [2024-10-11 19:44:40,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 385 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 19:44:40,306 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 263 flow [2024-10-11 19:44:40,306 INFO L260 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} [2024-10-11 19:44:40,307 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2024-10-11 19:44:40,307 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 263 flow [2024-10-11 19:44:40,307 INFO L472 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) [2024-10-11 19:44:40,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:40,308 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:40,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 19:44:40,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:40,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1512699294, now seen corresponding path program 1 times [2024-10-11 19:44:40,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:40,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062449494] [2024-10-11 19:44:40,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:40,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062449494] [2024-10-11 19:44:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062449494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:40,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:40,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:44:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675757962] [2024-10-11 19:44:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:40,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:44:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:40,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:44:40,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:44:40,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2024-10-11 19:44:40,682 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) [2024-10-11 19:44:40,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:40,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2024-10-11 19:44:40,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:40,831 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2024-10-11 19:44:40,831 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-11 19:44:40,832 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 1098 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. [2024-10-11 19:44:40,833 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 45 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-10-11 19:44:40,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 377 flow [2024-10-11 19:44:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:44:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:44:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2024-10-11 19:44:40,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6104477611940299 [2024-10-11 19:44:40,835 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 263 flow. Second operand 5 states and 409 transitions. [2024-10-11 19:44:40,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 88 transitions, 377 flow [2024-10-11 19:44:40,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 88 transitions, 341 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 19:44:40,838 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 251 flow [2024-10-11 19:44:40,838 INFO L260 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} [2024-10-11 19:44:40,839 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2024-10-11 19:44:40,839 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 251 flow [2024-10-11 19:44:40,839 INFO L472 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) [2024-10-11 19:44:40,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:40,840 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:40,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 19:44:40,840 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:40,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1512699293, now seen corresponding path program 1 times [2024-10-11 19:44:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774858730] [2024-10-11 19:44:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:41,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774858730] [2024-10-11 19:44:41,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774858730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:41,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:41,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:44:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095284845] [2024-10-11 19:44:41,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:41,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:44:41,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:41,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:44:41,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:44:41,307 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2024-10-11 19:44:41,308 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) [2024-10-11 19:44:41,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:41,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2024-10-11 19:44:41,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:41,439 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2024-10-11 19:44:41,440 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-10-11 19:44:41,440 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 1090 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. [2024-10-11 19:44:41,441 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 39 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2024-10-11 19:44:41,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 87 transitions, 353 flow [2024-10-11 19:44:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:44:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:44:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2024-10-11 19:44:41,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6462686567164179 [2024-10-11 19:44:41,443 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 251 flow. Second operand 5 states and 433 transitions. [2024-10-11 19:44:41,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 87 transitions, 353 flow [2024-10-11 19:44:41,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 87 transitions, 327 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:44:41,468 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 249 flow [2024-10-11 19:44:41,468 INFO L260 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} [2024-10-11 19:44:41,469 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2024-10-11 19:44:41,469 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 249 flow [2024-10-11 19:44:41,470 INFO L472 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) [2024-10-11 19:44:41,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:41,470 INFO L204 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] [2024-10-11 19:44:41,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 19:44:41,470 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:41,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1583846751, now seen corresponding path program 1 times [2024-10-11 19:44:41,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:41,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779386881] [2024-10-11 19:44:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:43,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779386881] [2024-10-11 19:44:43,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779386881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:43,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:43,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 19:44:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524481029] [2024-10-11 19:44:43,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:43,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:44:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:43,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:44:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:44:45,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 134 [2024-10-11 19:44:45,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 249 flow. Second operand has 14 states, 14 states have (on average 53.785714285714285) internal successors, (753), 14 states have internal predecessors, (753), 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) [2024-10-11 19:44:45,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:45,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 134 [2024-10-11 19:44:45,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:45,886 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2024-10-11 19:44:45,886 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-11 19:44:45,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 275 events. 64/275 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1088 event pairs, 54 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 496. Up to 135 conditions per place. [2024-10-11 19:44:45,888 INFO L140 encePairwiseOnDemand]: 117/134 looper letters, 51 selfloop transitions, 15 changer transitions 3/94 dead transitions. [2024-10-11 19:44:45,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 94 transitions, 401 flow [2024-10-11 19:44:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:44:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:44:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 477 transitions. [2024-10-11 19:44:45,890 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4449626865671642 [2024-10-11 19:44:45,890 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 249 flow. Second operand 8 states and 477 transitions. [2024-10-11 19:44:45,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 94 transitions, 401 flow [2024-10-11 19:44:45,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 94 transitions, 375 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:44:45,893 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 249 flow [2024-10-11 19:44:45,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=249, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2024-10-11 19:44:45,893 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2024-10-11 19:44:45,893 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 249 flow [2024-10-11 19:44:45,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 53.785714285714285) internal successors, (753), 14 states have internal predecessors, (753), 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) [2024-10-11 19:44:45,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:45,894 INFO L204 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] [2024-10-11 19:44:45,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 19:44:45,895 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:45,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1583846750, now seen corresponding path program 1 times [2024-10-11 19:44:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:45,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165345049] [2024-10-11 19:44:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165345049] [2024-10-11 19:44:46,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165345049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:46,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:46,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:44:46,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453616197] [2024-10-11 19:44:46,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:46,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:44:46,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:46,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:44:46,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:44:47,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2024-10-11 19:44:47,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 249 flow. Second operand has 9 states, 9 states have (on average 78.77777777777777) internal successors, (709), 9 states have internal predecessors, (709), 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) [2024-10-11 19:44:47,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:47,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2024-10-11 19:44:47,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:47,582 INFO L124 PetriNetUnfolderBase]: 64/274 cut-off events. [2024-10-11 19:44:47,582 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-11 19:44:47,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 274 events. 64/274 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1088 event pairs, 54 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 506. Up to 135 conditions per place. [2024-10-11 19:44:47,584 INFO L140 encePairwiseOnDemand]: 121/134 looper letters, 54 selfloop transitions, 12 changer transitions 3/93 dead transitions. [2024-10-11 19:44:47,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 93 transitions, 403 flow [2024-10-11 19:44:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:44:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:44:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 668 transitions. [2024-10-11 19:44:47,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6231343283582089 [2024-10-11 19:44:47,586 INFO L175 Difference]: Start difference. First operand has 106 places, 85 transitions, 249 flow. Second operand 8 states and 668 transitions. [2024-10-11 19:44:47,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 93 transitions, 403 flow [2024-10-11 19:44:47,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 93 transitions, 373 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 19:44:47,589 INFO L231 Difference]: Finished difference. Result has 105 places, 84 transitions, 241 flow [2024-10-11 19:44:47,590 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=241, PETRI_PLACES=105, PETRI_TRANSITIONS=84} [2024-10-11 19:44:47,590 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2024-10-11 19:44:47,590 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 84 transitions, 241 flow [2024-10-11 19:44:47,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 78.77777777777777) internal successors, (709), 9 states have internal predecessors, (709), 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) [2024-10-11 19:44:47,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:47,591 INFO L204 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, 1, 1] [2024-10-11 19:44:47,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 19:44:47,591 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:47,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1658328098, now seen corresponding path program 1 times [2024-10-11 19:44:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104996944] [2024-10-11 19:44:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104996944] [2024-10-11 19:44:47,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104996944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:47,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:47,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:44:47,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178258197] [2024-10-11 19:44:47,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:47,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:44:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:47,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:44:47,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:44:47,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 134 [2024-10-11 19:44:47,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 84 transitions, 241 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) [2024-10-11 19:44:47,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:47,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 134 [2024-10-11 19:44:47,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:48,128 INFO L124 PetriNetUnfolderBase]: 73/290 cut-off events. [2024-10-11 19:44:48,128 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-10-11 19:44:48,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 290 events. 73/290 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1173 event pairs, 45 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 534. Up to 108 conditions per place. [2024-10-11 19:44:48,130 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 48 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2024-10-11 19:44:48,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 91 transitions, 387 flow [2024-10-11 19:44:48,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:44:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:44:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2024-10-11 19:44:48,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6019900497512438 [2024-10-11 19:44:48,131 INFO L175 Difference]: Start difference. First operand has 105 places, 84 transitions, 241 flow. Second operand 6 states and 484 transitions. [2024-10-11 19:44:48,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 91 transitions, 387 flow [2024-10-11 19:44:48,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 91 transitions, 363 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 19:44:48,134 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 249 flow [2024-10-11 19:44:48,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2024-10-11 19:44:48,134 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -35 predicate places. [2024-10-11 19:44:48,134 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 249 flow [2024-10-11 19:44:48,136 INFO L472 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) [2024-10-11 19:44:48,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:48,136 INFO L204 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, 1, 1] [2024-10-11 19:44:48,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 19:44:48,136 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:48,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1658328099, now seen corresponding path program 1 times [2024-10-11 19:44:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963231363] [2024-10-11 19:44:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963231363] [2024-10-11 19:44:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963231363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:48,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:48,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:44:48,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117207568] [2024-10-11 19:44:48,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:48,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:44:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:48,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:44:48,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:44:48,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 134 [2024-10-11 19:44:48,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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) [2024-10-11 19:44:48,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:48,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 134 [2024-10-11 19:44:48,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:48,844 INFO L124 PetriNetUnfolderBase]: 73/272 cut-off events. [2024-10-11 19:44:48,845 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-11 19:44:48,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 272 events. 73/272 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1064 event pairs, 18 based on Foata normal form. 2/249 useless extension candidates. Maximal degree in co-relation 534. Up to 135 conditions per place. [2024-10-11 19:44:48,847 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 44 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-10-11 19:44:48,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 383 flow [2024-10-11 19:44:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:44:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:44:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2024-10-11 19:44:48,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6393034825870647 [2024-10-11 19:44:48,850 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 249 flow. Second operand 6 states and 514 transitions. [2024-10-11 19:44:48,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 383 flow [2024-10-11 19:44:48,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 89 transitions, 347 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 19:44:48,852 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 241 flow [2024-10-11 19:44:48,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2024-10-11 19:44:48,852 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -37 predicate places. [2024-10-11 19:44:48,852 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 241 flow [2024-10-11 19:44:48,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 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) [2024-10-11 19:44:48,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:48,853 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:48,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 19:44:48,853 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:48,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash 821866613, now seen corresponding path program 1 times [2024-10-11 19:44:48,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:48,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407290863] [2024-10-11 19:44:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:49,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407290863] [2024-10-11 19:44:49,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407290863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:44:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638498422] [2024-10-11 19:44:49,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:49,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:49,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:49,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:49,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 134 [2024-10-11 19:44:49,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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) [2024-10-11 19:44:49,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:49,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 134 [2024-10-11 19:44:49,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:49,262 INFO L124 PetriNetUnfolderBase]: 64/273 cut-off events. [2024-10-11 19:44:49,262 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-11 19:44:49,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 273 events. 64/273 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1100 event pairs, 56 based on Foata normal form. 8/244 useless extension candidates. Maximal degree in co-relation 496. Up to 162 conditions per place. [2024-10-11 19:44:49,264 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 55 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-10-11 19:44:49,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 85 transitions, 367 flow [2024-10-11 19:44:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2024-10-11 19:44:49,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8084577114427861 [2024-10-11 19:44:49,265 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 241 flow. Second operand 3 states and 325 transitions. [2024-10-11 19:44:49,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 85 transitions, 367 flow [2024-10-11 19:44:49,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 333 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 19:44:49,267 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 209 flow [2024-10-11 19:44:49,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2024-10-11 19:44:49,268 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -42 predicate places. [2024-10-11 19:44:49,268 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 209 flow [2024-10-11 19:44:49,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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) [2024-10-11 19:44:49,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:49,268 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:49,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 19:44:49,269 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:49,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash 821866612, now seen corresponding path program 1 times [2024-10-11 19:44:49,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:49,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156154689] [2024-10-11 19:44:49,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:49,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:49,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:49,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156154689] [2024-10-11 19:44:49,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156154689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:49,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:49,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:44:49,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412469266] [2024-10-11 19:44:49,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:49,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:49,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:49,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:49,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 134 [2024-10-11 19:44:49,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2024-10-11 19:44:49,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:49,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 134 [2024-10-11 19:44:49,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:49,594 INFO L124 PetriNetUnfolderBase]: 71/264 cut-off events. [2024-10-11 19:44:49,595 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-10-11 19:44:49,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 264 events. 71/264 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 980 event pairs, 56 based on Foata normal form. 8/243 useless extension candidates. Maximal degree in co-relation 493. Up to 162 conditions per place. [2024-10-11 19:44:49,597 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 56 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-10-11 19:44:49,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 83 transitions, 335 flow [2024-10-11 19:44:49,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2024-10-11 19:44:49,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8034825870646766 [2024-10-11 19:44:49,598 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 209 flow. Second operand 3 states and 323 transitions. [2024-10-11 19:44:49,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 83 transitions, 335 flow [2024-10-11 19:44:49,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:49,600 INFO L231 Difference]: Finished difference. Result has 92 places, 76 transitions, 205 flow [2024-10-11 19:44:49,600 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=92, PETRI_TRANSITIONS=76} [2024-10-11 19:44:49,601 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -44 predicate places. [2024-10-11 19:44:49,601 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 76 transitions, 205 flow [2024-10-11 19:44:49,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2024-10-11 19:44:49,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:49,601 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:49,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 19:44:49,602 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash -415085578, now seen corresponding path program 1 times [2024-10-11 19:44:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703189953] [2024-10-11 19:44:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:49,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:50,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:50,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703189953] [2024-10-11 19:44:50,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703189953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:50,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:50,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:44:50,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456132880] [2024-10-11 19:44:50,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:50,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:44:50,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:50,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:44:50,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:44:50,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2024-10-11 19:44:50,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 76 transitions, 205 flow. Second operand has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 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) [2024-10-11 19:44:50,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:50,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2024-10-11 19:44:50,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:51,204 INFO L124 PetriNetUnfolderBase]: 85/312 cut-off events. [2024-10-11 19:44:51,204 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-11 19:44:51,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 312 events. 85/312 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1289 event pairs, 60 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 579. Up to 157 conditions per place. [2024-10-11 19:44:51,206 INFO L140 encePairwiseOnDemand]: 118/134 looper letters, 57 selfloop transitions, 15 changer transitions 3/95 dead transitions. [2024-10-11 19:44:51,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 401 flow [2024-10-11 19:44:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:44:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:44:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2024-10-11 19:44:51,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5988805970149254 [2024-10-11 19:44:51,208 INFO L175 Difference]: Start difference. First operand has 92 places, 76 transitions, 205 flow. Second operand 8 states and 642 transitions. [2024-10-11 19:44:51,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 401 flow [2024-10-11 19:44:51,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:51,210 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 244 flow [2024-10-11 19:44:51,214 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2024-10-11 19:44:51,215 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -38 predicate places. [2024-10-11 19:44:51,215 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 244 flow [2024-10-11 19:44:51,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 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) [2024-10-11 19:44:51,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:51,215 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:51,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 19:44:51,216 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:51,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash -415085579, now seen corresponding path program 1 times [2024-10-11 19:44:51,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:51,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421695804] [2024-10-11 19:44:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:51,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421695804] [2024-10-11 19:44:51,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421695804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:51,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:51,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:44:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915985128] [2024-10-11 19:44:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:51,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:44:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:44:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:44:51,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 134 [2024-10-11 19:44:51,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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) [2024-10-11 19:44:51,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:51,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 134 [2024-10-11 19:44:51,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:51,942 INFO L124 PetriNetUnfolderBase]: 79/290 cut-off events. [2024-10-11 19:44:51,942 INFO L125 PetriNetUnfolderBase]: For 86/92 co-relation queries the response was YES. [2024-10-11 19:44:51,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 290 events. 79/290 cut-off events. For 86/92 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1140 event pairs, 54 based on Foata normal form. 17/276 useless extension candidates. Maximal degree in co-relation 593. Up to 139 conditions per place. [2024-10-11 19:44:51,944 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 60 selfloop transitions, 11 changer transitions 3/94 dead transitions. [2024-10-11 19:44:51,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 94 transitions, 426 flow [2024-10-11 19:44:51,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:44:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:44:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2024-10-11 19:44:51,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6766169154228856 [2024-10-11 19:44:51,945 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 244 flow. Second operand 6 states and 544 transitions. [2024-10-11 19:44:51,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 94 transitions, 426 flow [2024-10-11 19:44:51,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 399 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 19:44:51,947 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 237 flow [2024-10-11 19:44:51,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2024-10-11 19:44:51,948 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -40 predicate places. [2024-10-11 19:44:51,948 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 237 flow [2024-10-11 19:44:51,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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) [2024-10-11 19:44:51,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:51,949 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:51,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 19:44:51,949 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:44:51,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:51,949 INFO L85 PathProgramCache]: Analyzing trace with hash 17249648, now seen corresponding path program 1 times [2024-10-11 19:44:51,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:51,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366307087] [2024-10-11 19:44:51,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:51,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:44:55,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:55,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366307087] [2024-10-11 19:44:55,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366307087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:55,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:55,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-10-11 19:44:55,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302064132] [2024-10-11 19:44:55,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:55,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 19:44:55,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:55,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 19:44:55,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2024-10-11 19:45:02,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2024-10-11 19:45:02,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 237 flow. Second operand has 29 states, 29 states have (on average 57.3448275862069) internal successors, (1663), 29 states have internal predecessors, (1663), 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) [2024-10-11 19:45:02,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:02,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2024-10-11 19:45:02,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:04,239 INFO L124 PetriNetUnfolderBase]: 111/368 cut-off events. [2024-10-11 19:45:04,239 INFO L125 PetriNetUnfolderBase]: For 155/162 co-relation queries the response was YES. [2024-10-11 19:45:04,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 368 events. 111/368 cut-off events. For 155/162 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1596 event pairs, 6 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 771. Up to 65 conditions per place. [2024-10-11 19:45:04,242 INFO L140 encePairwiseOnDemand]: 105/134 looper letters, 71 selfloop transitions, 34 changer transitions 3/119 dead transitions. [2024-10-11 19:45:04,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 119 transitions, 555 flow [2024-10-11 19:45:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 19:45:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-10-11 19:45:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1722 transitions. [2024-10-11 19:45:04,245 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4431291816778178 [2024-10-11 19:45:04,245 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 237 flow. Second operand 29 states and 1722 transitions. [2024-10-11 19:45:04,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 119 transitions, 555 flow [2024-10-11 19:45:04,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 525 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 19:45:04,250 INFO L231 Difference]: Finished difference. Result has 123 places, 85 transitions, 328 flow [2024-10-11 19:45:04,250 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=328, PETRI_PLACES=123, PETRI_TRANSITIONS=85} [2024-10-11 19:45:04,251 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -13 predicate places. [2024-10-11 19:45:04,251 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 85 transitions, 328 flow [2024-10-11 19:45:04,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 57.3448275862069) internal successors, (1663), 29 states have internal predecessors, (1663), 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) [2024-10-11 19:45:04,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:04,252 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:45:04,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 19:45:04,253 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:45:04,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash 17249649, now seen corresponding path program 1 times [2024-10-11 19:45:04,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:45:04,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614383646] [2024-10-11 19:45:04,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:45:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:45:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:45:07,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:45:07,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614383646] [2024-10-11 19:45:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614383646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:45:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:45:07,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-11 19:45:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947188847] [2024-10-11 19:45:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:45:07,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 19:45:07,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:45:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 19:45:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2024-10-11 19:45:13,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 134 [2024-10-11 19:45:13,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 85 transitions, 328 flow. Second operand has 27 states, 27 states have (on average 40.44444444444444) internal successors, (1092), 27 states have internal predecessors, (1092), 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) [2024-10-11 19:45:13,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:13,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 134 [2024-10-11 19:45:13,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:14,841 INFO L124 PetriNetUnfolderBase]: 139/424 cut-off events. [2024-10-11 19:45:14,842 INFO L125 PetriNetUnfolderBase]: For 246/253 co-relation queries the response was YES. [2024-10-11 19:45:14,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 424 events. 139/424 cut-off events. For 246/253 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1917 event pairs, 6 based on Foata normal form. 12/408 useless extension candidates. Maximal degree in co-relation 995. Up to 98 conditions per place. [2024-10-11 19:45:14,845 INFO L140 encePairwiseOnDemand]: 107/134 looper letters, 76 selfloop transitions, 33 changer transitions 3/122 dead transitions. [2024-10-11 19:45:14,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 122 transitions, 635 flow [2024-10-11 19:45:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 19:45:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-10-11 19:45:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1233 transitions. [2024-10-11 19:45:14,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3172928461142563 [2024-10-11 19:45:14,848 INFO L175 Difference]: Start difference. First operand has 123 places, 85 transitions, 328 flow. Second operand 29 states and 1233 transitions. [2024-10-11 19:45:14,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 122 transitions, 635 flow [2024-10-11 19:45:14,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 122 transitions, 593 flow, removed 0 selfloop flow, removed 21 redundant places. [2024-10-11 19:45:14,852 INFO L231 Difference]: Finished difference. Result has 132 places, 86 transitions, 367 flow [2024-10-11 19:45:14,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=367, PETRI_PLACES=132, PETRI_TRANSITIONS=86} [2024-10-11 19:45:14,853 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -4 predicate places. [2024-10-11 19:45:14,853 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 86 transitions, 367 flow [2024-10-11 19:45:14,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 40.44444444444444) internal successors, (1092), 27 states have internal predecessors, (1092), 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) [2024-10-11 19:45:14,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:14,854 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:45:14,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 19:45:14,854 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:45:14,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash -460145899, now seen corresponding path program 1 times [2024-10-11 19:45:14,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:45:14,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086806987] [2024-10-11 19:45:14,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:14,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:45:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:45:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-11 19:45:15,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:45:15,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086806987] [2024-10-11 19:45:15,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086806987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:45:15,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:45:15,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:45:15,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142584205] [2024-10-11 19:45:15,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:45:15,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:45:15,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:45:15,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:45:15,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:45:16,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 134 [2024-10-11 19:45:16,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 86 transitions, 367 flow. Second operand has 10 states, 10 states have (on average 63.3) internal successors, (633), 10 states have internal predecessors, (633), 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) [2024-10-11 19:45:16,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:16,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 134 [2024-10-11 19:45:16,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:16,526 INFO L124 PetriNetUnfolderBase]: 107/353 cut-off events. [2024-10-11 19:45:16,526 INFO L125 PetriNetUnfolderBase]: For 351/359 co-relation queries the response was YES. [2024-10-11 19:45:16,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 353 events. 107/353 cut-off events. For 351/359 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1543 event pairs, 59 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 890. Up to 222 conditions per place. [2024-10-11 19:45:16,529 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 52 selfloop transitions, 19 changer transitions 0/93 dead transitions. [2024-10-11 19:45:16,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 93 transitions, 546 flow [2024-10-11 19:45:16,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:45:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:45:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2024-10-11 19:45:16,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5149253731343284 [2024-10-11 19:45:16,531 INFO L175 Difference]: Start difference. First operand has 132 places, 86 transitions, 367 flow. Second operand 6 states and 414 transitions. [2024-10-11 19:45:16,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 93 transitions, 546 flow [2024-10-11 19:45:16,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 93 transitions, 477 flow, removed 0 selfloop flow, removed 26 redundant places. [2024-10-11 19:45:16,534 INFO L231 Difference]: Finished difference. Result has 110 places, 85 transitions, 340 flow [2024-10-11 19:45:16,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=110, PETRI_TRANSITIONS=85} [2024-10-11 19:45:16,535 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2024-10-11 19:45:16,535 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 340 flow [2024-10-11 19:45:16,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.3) internal successors, (633), 10 states have internal predecessors, (633), 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) [2024-10-11 19:45:16,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:16,535 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:45:16,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 19:45:16,536 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2024-10-11 19:45:16,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1379620214, now seen corresponding path program 1 times [2024-10-11 19:45:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:45:16,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929207210] [2024-10-11 19:45:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:45:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:45:16,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:45:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:45:16,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:45:16,876 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:45:16,878 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 92 remaining) [2024-10-11 19:45:16,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 92 remaining) [2024-10-11 19:45:16,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 92 remaining) [2024-10-11 19:45:16,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 92 remaining) [2024-10-11 19:45:16,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 92 remaining) [2024-10-11 19:45:16,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 92 remaining) [2024-10-11 19:45:16,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 92 remaining) [2024-10-11 19:45:16,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 92 remaining) [2024-10-11 19:45:16,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 92 remaining) [2024-10-11 19:45:16,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 92 remaining) [2024-10-11 19:45:16,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 92 remaining) [2024-10-11 19:45:16,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 92 remaining) [2024-10-11 19:45:16,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 92 remaining) [2024-10-11 19:45:16,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 92 remaining) [2024-10-11 19:45:16,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 92 remaining) [2024-10-11 19:45:16,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 92 remaining) [2024-10-11 19:45:16,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 92 remaining) [2024-10-11 19:45:16,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 92 remaining) [2024-10-11 19:45:16,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 92 remaining) [2024-10-11 19:45:16,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 92 remaining) [2024-10-11 19:45:16,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 92 remaining) [2024-10-11 19:45:16,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 92 remaining) [2024-10-11 19:45:16,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 92 remaining) [2024-10-11 19:45:16,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 92 remaining) [2024-10-11 19:45:16,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 92 remaining) [2024-10-11 19:45:16,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 92 remaining) [2024-10-11 19:45:16,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 92 remaining) [2024-10-11 19:45:16,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 92 remaining) [2024-10-11 19:45:16,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 92 remaining) [2024-10-11 19:45:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 92 remaining) [2024-10-11 19:45:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 92 remaining) [2024-10-11 19:45:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 92 remaining) [2024-10-11 19:45:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 92 remaining) [2024-10-11 19:45:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 92 remaining) [2024-10-11 19:45:16,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 92 remaining) [2024-10-11 19:45:16,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 92 remaining) [2024-10-11 19:45:16,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 92 remaining) [2024-10-11 19:45:16,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 92 remaining) [2024-10-11 19:45:16,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 92 remaining) [2024-10-11 19:45:16,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 92 remaining) [2024-10-11 19:45:16,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 92 remaining) [2024-10-11 19:45:16,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 92 remaining) [2024-10-11 19:45:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 92 remaining) [2024-10-11 19:45:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 92 remaining) [2024-10-11 19:45:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 92 remaining) [2024-10-11 19:45:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 92 remaining) [2024-10-11 19:45:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 92 remaining) [2024-10-11 19:45:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 92 remaining) [2024-10-11 19:45:16,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 92 remaining) [2024-10-11 19:45:16,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 92 remaining) [2024-10-11 19:45:16,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 92 remaining) [2024-10-11 19:45:16,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 92 remaining) [2024-10-11 19:45:16,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 92 remaining) [2024-10-11 19:45:16,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 92 remaining) [2024-10-11 19:45:16,890 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 92 remaining) [2024-10-11 19:45:16,891 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 92 remaining) [2024-10-11 19:45:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 92 remaining) [2024-10-11 19:45:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK (24 of 92 remaining) [2024-10-11 19:45:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 92 remaining) [2024-10-11 19:45:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 92 remaining) [2024-10-11 19:45:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 92 remaining) [2024-10-11 19:45:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 92 remaining) [2024-10-11 19:45:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 92 remaining) [2024-10-11 19:45:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 92 remaining) [2024-10-11 19:45:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 92 remaining) [2024-10-11 19:45:16,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 92 remaining) [2024-10-11 19:45:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 92 remaining) [2024-10-11 19:45:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 92 remaining) [2024-10-11 19:45:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 92 remaining) [2024-10-11 19:45:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 92 remaining) [2024-10-11 19:45:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 92 remaining) [2024-10-11 19:45:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 92 remaining) [2024-10-11 19:45:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 92 remaining) [2024-10-11 19:45:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 92 remaining) [2024-10-11 19:45:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 92 remaining) [2024-10-11 19:45:16,893 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 92 remaining) [2024-10-11 19:45:16,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 92 remaining) [2024-10-11 19:45:16,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 92 remaining) [2024-10-11 19:45:16,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 92 remaining) [2024-10-11 19:45:16,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 92 remaining) [2024-10-11 19:45:16,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 92 remaining) [2024-10-11 19:45:16,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 92 remaining) [2024-10-11 19:45:16,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 19:45:16,896 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:45:16,959 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:45:16,959 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:45:16,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:45:16 BasicIcfg [2024-10-11 19:45:16,968 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:45:16,969 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:45:16,969 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:45:16,969 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:45:16,970 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:29" (3/4) ... [2024-10-11 19:45:16,970 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 19:45:17,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 19:45:17,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:45:17,055 INFO L158 Benchmark]: Toolchain (without parser) took 50108.94ms. Allocated memory was 176.2MB in the beginning and 685.8MB in the end (delta: 509.6MB). Free memory was 142.0MB in the beginning and 410.2MB in the end (delta: -268.2MB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. [2024-10-11 19:45:17,055 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:45:17,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 794.40ms. Allocated memory is still 176.2MB. Free memory was 142.0MB in the beginning and 100.1MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-11 19:45:17,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.58ms. Allocated memory is still 176.2MB. Free memory was 100.1MB in the beginning and 97.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:45:17,055 INFO L158 Benchmark]: Boogie Preprocessor took 73.58ms. Allocated memory is still 176.2MB. Free memory was 97.0MB in the beginning and 92.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:45:17,056 INFO L158 Benchmark]: RCFGBuilder took 1137.89ms. Allocated memory is still 176.2MB. Free memory was 91.7MB in the beginning and 98.8MB in the end (delta: -7.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-11 19:45:17,056 INFO L158 Benchmark]: TraceAbstraction took 47931.87ms. Allocated memory was 176.2MB in the beginning and 685.8MB in the end (delta: 509.6MB). Free memory was 97.7MB in the beginning and 419.7MB in the end (delta: -321.9MB). Peak memory consumption was 189.8MB. Max. memory is 16.1GB. [2024-10-11 19:45:17,056 INFO L158 Benchmark]: Witness Printer took 85.27ms. Allocated memory is still 685.8MB. Free memory was 419.7MB in the beginning and 410.2MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 19:45:17,058 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 794.40ms. Allocated memory is still 176.2MB. Free memory was 142.0MB in the beginning and 100.1MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.58ms. Allocated memory is still 176.2MB. Free memory was 100.1MB in the beginning and 97.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.58ms. Allocated memory is still 176.2MB. Free memory was 97.0MB in the beginning and 92.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1137.89ms. Allocated memory is still 176.2MB. Free memory was 91.7MB in the beginning and 98.8MB in the end (delta: -7.1MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 47931.87ms. Allocated memory was 176.2MB in the beginning and 685.8MB in the end (delta: 509.6MB). Free memory was 97.7MB in the beginning and 419.7MB in the end (delta: -321.9MB). Peak memory consumption was 189.8MB. Max. memory is 16.1GB. * Witness Printer took 85.27ms. Allocated memory is still 685.8MB. Free memory was 419.7MB in the beginning and 410.2MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] CALL 0 assume_abort_if_not(0 <= k && k < 10) [L11] COND FALSE 0 !(!cond) [L1258] RET 0 assume_abort_if_not(0 <= k && k < 10) [L1259] 0 struct s *p; [L1260] 0 pthread_t t1; [L1261] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1261] RET, EXPR 0 new(1) [L1261] 0 slot[j] = new(1) [L1262] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1262] RET, EXPR 0 new(2) [L1262] EXPR 0 slot[j] [L1262] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1262] RET 0 list_add(new(2), slot[j]) [L1263] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1263] RET, EXPR 0 new(1) [L1263] 0 slot[k] = new(1) [L1264] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1264] RET, EXPR 0 new(2) [L1264] EXPR 0 slot[k] [L1264] CALL 0 list_add(new(2), slot[k]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1264] RET 0 list_add(new(2), slot[k]) [L1265] CALL, EXPR 0 new(3) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1265] RET, EXPR 0 new(3) [L1265] 0 p = new(3) [L1266] EXPR 0 slot[j] [L1266] CALL 0 list_add(p, slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1266] RET 0 list_add(p, slot[j]) [L1267] CALL, EXPR 0 new(3) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1267] RET, EXPR 0 new(3) [L1267] 0 p = new(3) [L1268] EXPR 0 slot[k] [L1268] CALL 0 list_add(p, slot[k]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1268] RET 0 list_add(p, slot[k]) [L1269] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, k=9, mutex={1:0}, p={-7:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, i=8, mutex={1:0}, slot={2:0}] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1269]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 159 locations, 92 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 47.7s, OverallIterations: 28, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 30.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13082 SdHoareTripleChecker+Valid, 26.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10112 mSDsluCounter, 8623 SdHoareTripleChecker+Invalid, 21.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8291 mSDsCounter, 826 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50305 IncrementalHoareTripleChecker+Invalid, 51131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 826 mSolverCounterUnsat, 332 mSDtfsCounter, 50305 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=26, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 752 ConstructedInterpolants, 0 QuantifiedInterpolants, 8390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 1275/1308 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 19:45:17,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)