./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya --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.4-dev-0e0057c [2023-11-29 05:50:43,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:50:43,979 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:50:43,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:50:43,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:50:44,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:50:44,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:50:44,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:50:44,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:50:44,008 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:50:44,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:50:44,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:50:44,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:50:44,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:50:44,011 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:50:44,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:50:44,013 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:50:44,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:50:44,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:50:44,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:50:44,014 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:50:44,016 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:50:44,016 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:50:44,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:50:44,017 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:50:44,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:50:44,017 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:50:44,018 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:50:44,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:50:44,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:50:44,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:50:44,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:50:44,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:50:44,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:50:44,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:50:44,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:50:44,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:50:44,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:50:44,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:50:44,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:50:44,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:50:44,021 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya 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 [2023-11-29 05:50:44,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:50:44,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:50:44,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:50:44,256 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:50:44,256 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:50:44,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2023-11-29 05:50:46,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:50:47,235 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:50:47,236 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2023-11-29 05:50:47,256 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/data/c36c91aa6/64349bbddb3640669f05e7187b890656/FLAG9d6048ade [2023-11-29 05:50:47,274 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/data/c36c91aa6/64349bbddb3640669f05e7187b890656 [2023-11-29 05:50:47,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:50:47,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:50:47,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:50:47,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:50:47,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:50:47,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:50:47" (1/1) ... [2023-11-29 05:50:47,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a8d4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:47, skipping insertion in model container [2023-11-29 05:50:47,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:50:47" (1/1) ... [2023-11-29 05:50:47,347 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:50:47,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:50:47,993 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:50:48,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:50:48,125 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:50:48,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48 WrapperNode [2023-11-29 05:50:48,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:50:48,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:50:48,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:50:48,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:50:48,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,186 INFO L138 Inliner]: procedures = 371, calls = 44, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 205 [2023-11-29 05:50:48,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:50:48,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:50:48,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:50:48,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:50:48,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,228 INFO L175 MemorySlicer]: Split 42 memory accesses to 4 slices as follows [1, 31, 9, 1]. 74 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 29 writes are split as follows [1, 24, 3, 1]. [2023-11-29 05:50:48,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:50:48,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:50:48,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:50:48,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:50:48,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (1/1) ... [2023-11-29 05:50:48,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:50:48,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:48,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:50:48,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:50:48,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 05:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 05:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 05:50:48,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 05:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:50:48,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 05:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-29 05:50:48,327 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-29 05:50:48,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:50:48,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:50:48,329 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:50:48,546 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:50:48,548 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:50:49,091 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:50:49,367 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:50:49,367 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:50:49,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:50:49 BoogieIcfgContainer [2023-11-29 05:50:49,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:50:49,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:50:49,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:50:49,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:50:49,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:50:47" (1/3) ... [2023-11-29 05:50:49,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f85d61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:50:49, skipping insertion in model container [2023-11-29 05:50:49,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:48" (2/3) ... [2023-11-29 05:50:49,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f85d61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:50:49, skipping insertion in model container [2023-11-29 05:50:49,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:50:49" (3/3) ... [2023-11-29 05:50:49,375 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr-deref.i [2023-11-29 05:50:49,391 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:50:49,391 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 81 error locations. [2023-11-29 05:50:49,391 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:50:49,450 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:50:49,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 137 transitions, 278 flow [2023-11-29 05:50:49,528 INFO L124 PetriNetUnfolderBase]: 1/136 cut-off events. [2023-11-29 05:50:49,528 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:50:49,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 136 events. 1/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 274 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-11-29 05:50:49,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 137 transitions, 278 flow [2023-11-29 05:50:49,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 136 transitions, 275 flow [2023-11-29 05:50:49,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:50:49,554 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@dafe715, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:50:49,554 INFO L358 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2023-11-29 05:50:49,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:50:49,558 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-11-29 05:50:49,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:50:49,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:49,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-29 05:50:49,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:49,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:49,564 INFO L85 PathProgramCache]: Analyzing trace with hash 646922, now seen corresponding path program 1 times [2023-11-29 05:50:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:49,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613898987] [2023-11-29 05:50:49,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:49,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613898987] [2023-11-29 05:50:49,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613898987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:49,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:49,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:49,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169718912] [2023-11-29 05:50:49,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:49,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:49,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:49,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:49,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 137 [2023-11-29 05:50:49,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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) [2023-11-29 05:50:49,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:49,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 137 [2023-11-29 05:50:49,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:50,024 INFO L124 PetriNetUnfolderBase]: 64/332 cut-off events. [2023-11-29 05:50:50,024 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 05:50:50,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 332 events. 64/332 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1328 event pairs, 63 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2023-11-29 05:50:50,030 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 39 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2023-11-29 05:50:50,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 137 transitions, 359 flow [2023-11-29 05:50:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-11-29 05:50:50,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8102189781021898 [2023-11-29 05:50:50,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-11-29 05:50:50,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-11-29 05:50:50,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:50,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-11-29 05:50:50,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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) [2023-11-29 05:50:50,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-11-29 05:50:50,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-11-29 05:50:50,062 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 275 flow. Second operand 3 states and 333 transitions. [2023-11-29 05:50:50,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 137 transitions, 359 flow [2023-11-29 05:50:50,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 137 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:50:50,068 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 286 flow [2023-11-29 05:50:50,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2023-11-29 05:50:50,073 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 2 predicate places. [2023-11-29 05:50:50,074 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 286 flow [2023-11-29 05:50:50,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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) [2023-11-29 05:50:50,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:50,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-29 05:50:50,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:50:50,075 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:50,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:50,076 INFO L85 PathProgramCache]: Analyzing trace with hash 20050473, now seen corresponding path program 1 times [2023-11-29 05:50:50,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:50,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296553753] [2023-11-29 05:50:50,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:50,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:50,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:50,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296553753] [2023-11-29 05:50:50,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296553753] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:50,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986260564] [2023-11-29 05:50:50,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:50,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:50,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:50,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:50,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:50:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:50,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:50:50,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:50,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986260564] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:50:50,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:50:50,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-29 05:50:50,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489743944] [2023-11-29 05:50:50,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:50:50,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:50:50,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:50,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:50:50,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:50:50,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 137 [2023-11-29 05:50:50,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 states have internal predecessors, (687), 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) [2023-11-29 05:50:50,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:50,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 137 [2023-11-29 05:50:50,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:50,576 INFO L124 PetriNetUnfolderBase]: 64/335 cut-off events. [2023-11-29 05:50:50,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:50:50,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 335 events. 64/335 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1305 event pairs, 63 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 508. Up to 167 conditions per place. [2023-11-29 05:50:50,581 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 39 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2023-11-29 05:50:50,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 140 transitions, 386 flow [2023-11-29 05:50:50,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:50:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:50:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2023-11-29 05:50:50,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7652068126520681 [2023-11-29 05:50:50,588 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 629 transitions. [2023-11-29 05:50:50,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions. [2023-11-29 05:50:50,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:50,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions. [2023-11-29 05:50:50,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 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) [2023-11-29 05:50:50,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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) [2023-11-29 05:50:50,598 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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) [2023-11-29 05:50:50,598 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 286 flow. Second operand 6 states and 629 transitions. [2023-11-29 05:50:50,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 140 transitions, 386 flow [2023-11-29 05:50:50,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 140 transitions, 382 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 05:50:50,604 INFO L231 Difference]: Finished difference. Result has 148 places, 140 transitions, 318 flow [2023-11-29 05:50:50,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=148, PETRI_TRANSITIONS=140} [2023-11-29 05:50:50,606 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2023-11-29 05:50:50,606 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 140 transitions, 318 flow [2023-11-29 05:50:50,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 states have internal predecessors, (687), 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) [2023-11-29 05:50:50,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:50,607 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-11-29 05:50:50,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 05:50:50,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:50,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:50,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash 319106762, now seen corresponding path program 2 times [2023-11-29 05:50:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:50,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980386339] [2023-11-29 05:50:50,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:50,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:50:50,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980386339] [2023-11-29 05:50:50,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980386339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:50,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:50,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:50,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158429034] [2023-11-29 05:50:50,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:50,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:50,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:50,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:50,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:51,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 137 [2023-11-29 05:50:51,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 140 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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) [2023-11-29 05:50:51,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:51,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 137 [2023-11-29 05:50:51,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:51,188 INFO L124 PetriNetUnfolderBase]: 64/323 cut-off events. [2023-11-29 05:50:51,188 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 05:50:51,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 323 events. 64/323 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/249 useless extension candidates. Maximal degree in co-relation 493. Up to 165 conditions per place. [2023-11-29 05:50:51,192 INFO L140 encePairwiseOnDemand]: 113/137 looper letters, 38 selfloop transitions, 12 changer transitions 0/128 dead transitions. [2023-11-29 05:50:51,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 128 transitions, 394 flow [2023-11-29 05:50:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-11-29 05:50:51,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7177615571776156 [2023-11-29 05:50:51,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-11-29 05:50:51,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-11-29 05:50:51,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:51,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-11-29 05:50:51,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:51,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-11-29 05:50:51,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-11-29 05:50:51,198 INFO L175 Difference]: Start difference. First operand has 148 places, 140 transitions, 318 flow. Second operand 3 states and 295 transitions. [2023-11-29 05:50:51,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 128 transitions, 394 flow [2023-11-29 05:50:51,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 128 transitions, 380 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-29 05:50:51,203 INFO L231 Difference]: Finished difference. Result has 137 places, 128 transitions, 304 flow [2023-11-29 05:50:51,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=137, PETRI_TRANSITIONS=128} [2023-11-29 05:50:51,204 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -2 predicate places. [2023-11-29 05:50:51,204 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 128 transitions, 304 flow [2023-11-29 05:50:51,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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) [2023-11-29 05:50:51,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:51,204 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-11-29 05:50:51,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:50:51,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:51,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash 319106763, now seen corresponding path program 1 times [2023-11-29 05:50:51,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:51,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152688272] [2023-11-29 05:50:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:51,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:51,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152688272] [2023-11-29 05:50:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152688272] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329344398] [2023-11-29 05:50:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:51,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:51,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:51,300 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:51,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:50:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:51,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:50:51,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:51,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329344398] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:50:51,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:50:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-29 05:50:51,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768805653] [2023-11-29 05:50:51,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:50:51,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:50:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:50:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:50:51,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 137 [2023-11-29 05:50:51,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 128 transitions, 304 flow. Second operand has 13 states, 13 states have (on average 98.07692307692308) internal successors, (1275), 13 states have internal predecessors, (1275), 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) [2023-11-29 05:50:51,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:51,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 137 [2023-11-29 05:50:51,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:51,698 INFO L124 PetriNetUnfolderBase]: 64/329 cut-off events. [2023-11-29 05:50:51,698 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-29 05:50:51,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 329 events. 64/329 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1252 event pairs, 63 based on Foata normal form. 6/255 useless extension candidates. Maximal degree in co-relation 499. Up to 167 conditions per place. [2023-11-29 05:50:51,702 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 39 selfloop transitions, 11 changer transitions 0/134 dead transitions. [2023-11-29 05:50:51,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 134 transitions, 440 flow [2023-11-29 05:50:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:50:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:50:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1220 transitions. [2023-11-29 05:50:51,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7420924574209246 [2023-11-29 05:50:51,707 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1220 transitions. [2023-11-29 05:50:51,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1220 transitions. [2023-11-29 05:50:51,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:51,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1220 transitions. [2023-11-29 05:50:51,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 101.66666666666667) internal successors, (1220), 12 states have internal predecessors, (1220), 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) [2023-11-29 05:50:51,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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) [2023-11-29 05:50:51,719 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 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) [2023-11-29 05:50:51,719 INFO L175 Difference]: Start difference. First operand has 137 places, 128 transitions, 304 flow. Second operand 12 states and 1220 transitions. [2023-11-29 05:50:51,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 134 transitions, 440 flow [2023-11-29 05:50:51,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 134 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:51,724 INFO L231 Difference]: Finished difference. Result has 152 places, 134 transitions, 364 flow [2023-11-29 05:50:51,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=364, PETRI_PLACES=152, PETRI_TRANSITIONS=134} [2023-11-29 05:50:51,726 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 13 predicate places. [2023-11-29 05:50:51,726 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 134 transitions, 364 flow [2023-11-29 05:50:51,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 98.07692307692308) internal successors, (1275), 13 states have internal predecessors, (1275), 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) [2023-11-29 05:50:51,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:51,727 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2023-11-29 05:50:51,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:50:51,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:51,931 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:51,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash -903667093, now seen corresponding path program 2 times [2023-11-29 05:50:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:51,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155822797] [2023-11-29 05:50:51,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:51,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:50:52,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:52,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155822797] [2023-11-29 05:50:52,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155822797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:52,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:52,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525909257] [2023-11-29 05:50:52,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:52,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:52,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:52,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:52,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 137 [2023-11-29 05:50:52,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 134 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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) [2023-11-29 05:50:52,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:52,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 137 [2023-11-29 05:50:52,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:52,314 INFO L124 PetriNetUnfolderBase]: 64/317 cut-off events. [2023-11-29 05:50:52,314 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 05:50:52,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 317 events. 64/317 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1213 event pairs, 63 based on Foata normal form. 6/249 useless extension candidates. Maximal degree in co-relation 481. Up to 171 conditions per place. [2023-11-29 05:50:52,318 INFO L140 encePairwiseOnDemand]: 113/137 looper letters, 38 selfloop transitions, 12 changer transitions 0/122 dead transitions. [2023-11-29 05:50:52,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 122 transitions, 440 flow [2023-11-29 05:50:52,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-11-29 05:50:52,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469586374695864 [2023-11-29 05:50:52,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-11-29 05:50:52,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-11-29 05:50:52,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:52,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-11-29 05:50:52,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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) [2023-11-29 05:50:52,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-11-29 05:50:52,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-11-29 05:50:52,324 INFO L175 Difference]: Start difference. First operand has 152 places, 134 transitions, 364 flow. Second operand 3 states and 307 transitions. [2023-11-29 05:50:52,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 122 transitions, 440 flow [2023-11-29 05:50:52,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 122 transitions, 392 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-11-29 05:50:52,330 INFO L231 Difference]: Finished difference. Result has 137 places, 122 transitions, 316 flow [2023-11-29 05:50:52,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=137, PETRI_TRANSITIONS=122} [2023-11-29 05:50:52,332 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -2 predicate places. [2023-11-29 05:50:52,332 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 122 transitions, 316 flow [2023-11-29 05:50:52,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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) [2023-11-29 05:50:52,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:52,332 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2023-11-29 05:50:52,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:50:52,333 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:52,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash -840662422, now seen corresponding path program 1 times [2023-11-29 05:50:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:52,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880533637] [2023-11-29 05:50:52,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:50:52,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:52,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880533637] [2023-11-29 05:50:52,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880533637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:52,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:52,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:50:52,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384267645] [2023-11-29 05:50:52,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:52,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:50:52,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:52,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:50:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:50:52,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 137 [2023-11-29 05:50:52,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 122 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 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) [2023-11-29 05:50:52,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:52,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 137 [2023-11-29 05:50:52,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:53,001 INFO L124 PetriNetUnfolderBase]: 77/367 cut-off events. [2023-11-29 05:50:53,002 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-11-29 05:50:53,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 367 events. 77/367 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1559 event pairs, 55 based on Foata normal form. 2/294 useless extension candidates. Maximal degree in co-relation 584. Up to 163 conditions per place. [2023-11-29 05:50:53,005 INFO L140 encePairwiseOnDemand]: 126/137 looper letters, 69 selfloop transitions, 3 changer transitions 0/129 dead transitions. [2023-11-29 05:50:53,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 129 transitions, 474 flow [2023-11-29 05:50:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:50:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:50:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-11-29 05:50:53,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7262773722627737 [2023-11-29 05:50:53,008 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-11-29 05:50:53,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-11-29 05:50:53,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:53,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-11-29 05:50:53,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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) [2023-11-29 05:50:53,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 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) [2023-11-29 05:50:53,011 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 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) [2023-11-29 05:50:53,012 INFO L175 Difference]: Start difference. First operand has 137 places, 122 transitions, 316 flow. Second operand 4 states and 398 transitions. [2023-11-29 05:50:53,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 129 transitions, 474 flow [2023-11-29 05:50:53,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:53,016 INFO L231 Difference]: Finished difference. Result has 133 places, 116 transitions, 295 flow [2023-11-29 05:50:53,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=133, PETRI_TRANSITIONS=116} [2023-11-29 05:50:53,017 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -6 predicate places. [2023-11-29 05:50:53,018 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 116 transitions, 295 flow [2023-11-29 05:50:53,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 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) [2023-11-29 05:50:53,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:53,018 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2023-11-29 05:50:53,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:50:53,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:53,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash -840662421, now seen corresponding path program 1 times [2023-11-29 05:50:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064067843] [2023-11-29 05:50:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:50:53,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:53,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064067843] [2023-11-29 05:50:53,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064067843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:53,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:53,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733447202] [2023-11-29 05:50:53,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:53,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:50:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:53,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:50:53,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:50:53,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 137 [2023-11-29 05:50:53,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 116 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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) [2023-11-29 05:50:53,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:53,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 137 [2023-11-29 05:50:53,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:53,768 INFO L124 PetriNetUnfolderBase]: 84/383 cut-off events. [2023-11-29 05:50:53,769 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-29 05:50:53,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 383 events. 84/383 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1701 event pairs, 54 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 633. Up to 145 conditions per place. [2023-11-29 05:50:53,771 INFO L140 encePairwiseOnDemand]: 128/137 looper letters, 67 selfloop transitions, 5 changer transitions 0/131 dead transitions. [2023-11-29 05:50:53,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 131 transitions, 474 flow [2023-11-29 05:50:53,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:50:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:50:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 486 transitions. [2023-11-29 05:50:53,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7094890510948905 [2023-11-29 05:50:53,774 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 486 transitions. [2023-11-29 05:50:53,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 486 transitions. [2023-11-29 05:50:53,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:53,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 486 transitions. [2023-11-29 05:50:53,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 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) [2023-11-29 05:50:53,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-11-29 05:50:53,778 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-11-29 05:50:53,778 INFO L175 Difference]: Start difference. First operand has 133 places, 116 transitions, 295 flow. Second operand 5 states and 486 transitions. [2023-11-29 05:50:53,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 131 transitions, 474 flow [2023-11-29 05:50:53,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:50:53,782 INFO L231 Difference]: Finished difference. Result has 133 places, 114 transitions, 306 flow [2023-11-29 05:50:53,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=133, PETRI_TRANSITIONS=114} [2023-11-29 05:50:53,783 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -6 predicate places. [2023-11-29 05:50:53,783 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 114 transitions, 306 flow [2023-11-29 05:50:53,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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) [2023-11-29 05:50:53,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:53,784 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:53,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:50:53,784 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:53,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1793599229, now seen corresponding path program 1 times [2023-11-29 05:50:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:53,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169848756] [2023-11-29 05:50:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:50:54,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169848756] [2023-11-29 05:50:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169848756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:54,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:50:54,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366325102] [2023-11-29 05:50:54,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:54,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:50:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:54,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:50:54,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:50:54,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 137 [2023-11-29 05:50:54,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 114 transitions, 306 flow. Second operand has 7 states, 7 states have (on average 68.42857142857143) internal successors, (479), 7 states have internal predecessors, (479), 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) [2023-11-29 05:50:54,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:54,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 137 [2023-11-29 05:50:54,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:54,824 INFO L124 PetriNetUnfolderBase]: 73/350 cut-off events. [2023-11-29 05:50:54,824 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2023-11-29 05:50:54,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 350 events. 73/350 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1496 event pairs, 65 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 644. Up to 192 conditions per place. [2023-11-29 05:50:54,827 INFO L140 encePairwiseOnDemand]: 115/137 looper letters, 49 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2023-11-29 05:50:54,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 109 transitions, 428 flow [2023-11-29 05:50:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:50:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:50:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 594 transitions. [2023-11-29 05:50:54,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541970802919708 [2023-11-29 05:50:54,831 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 594 transitions. [2023-11-29 05:50:54,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 594 transitions. [2023-11-29 05:50:54,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:54,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 594 transitions. [2023-11-29 05:50:54,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 74.25) internal successors, (594), 8 states have internal predecessors, (594), 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) [2023-11-29 05:50:54,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-11-29 05:50:54,837 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-11-29 05:50:54,837 INFO L175 Difference]: Start difference. First operand has 133 places, 114 transitions, 306 flow. Second operand 8 states and 594 transitions. [2023-11-29 05:50:54,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 109 transitions, 428 flow [2023-11-29 05:50:54,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 109 transitions, 421 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:50:54,841 INFO L231 Difference]: Finished difference. Result has 132 places, 109 transitions, 323 flow [2023-11-29 05:50:54,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=323, PETRI_PLACES=132, PETRI_TRANSITIONS=109} [2023-11-29 05:50:54,842 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -7 predicate places. [2023-11-29 05:50:54,843 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 109 transitions, 323 flow [2023-11-29 05:50:54,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.42857142857143) internal successors, (479), 7 states have internal predecessors, (479), 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) [2023-11-29 05:50:54,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:54,843 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:54,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:50:54,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:54,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:54,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1793599230, now seen corresponding path program 1 times [2023-11-29 05:50:54,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:54,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990784484] [2023-11-29 05:50:54,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:54,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:50:55,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:55,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990784484] [2023-11-29 05:50:55,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990784484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:55,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:55,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:50:55,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706777308] [2023-11-29 05:50:55,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:55,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:50:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:55,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:50:55,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:50:55,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 137 [2023-11-29 05:50:55,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 109 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 60.42857142857143) internal successors, (423), 7 states have internal predecessors, (423), 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) [2023-11-29 05:50:55,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:55,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 137 [2023-11-29 05:50:55,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:56,226 INFO L124 PetriNetUnfolderBase]: 73/348 cut-off events. [2023-11-29 05:50:56,226 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-29 05:50:56,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 348 events. 73/348 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1513 event pairs, 65 based on Foata normal form. 1/286 useless extension candidates. Maximal degree in co-relation 641. Up to 198 conditions per place. [2023-11-29 05:50:56,228 INFO L140 encePairwiseOnDemand]: 122/137 looper letters, 52 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2023-11-29 05:50:56,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 107 transitions, 449 flow [2023-11-29 05:50:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:50:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:50:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 467 transitions. [2023-11-29 05:50:56,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869655891553702 [2023-11-29 05:50:56,231 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 467 transitions. [2023-11-29 05:50:56,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 467 transitions. [2023-11-29 05:50:56,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:56,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 467 transitions. [2023-11-29 05:50:56,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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) [2023-11-29 05:50:56,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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) [2023-11-29 05:50:56,235 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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) [2023-11-29 05:50:56,235 INFO L175 Difference]: Start difference. First operand has 132 places, 109 transitions, 323 flow. Second operand 7 states and 467 transitions. [2023-11-29 05:50:56,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 107 transitions, 449 flow [2023-11-29 05:50:56,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 107 transitions, 415 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 05:50:56,239 INFO L231 Difference]: Finished difference. Result has 129 places, 107 transitions, 311 flow [2023-11-29 05:50:56,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=129, PETRI_TRANSITIONS=107} [2023-11-29 05:50:56,240 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -10 predicate places. [2023-11-29 05:50:56,240 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 107 transitions, 311 flow [2023-11-29 05:50:56,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 60.42857142857143) internal successors, (423), 7 states have internal predecessors, (423), 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) [2023-11-29 05:50:56,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:56,240 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:56,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:50:56,241 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:56,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:56,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1366995786, now seen corresponding path program 1 times [2023-11-29 05:50:56,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:56,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757541899] [2023-11-29 05:50:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:56,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:50:56,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:56,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757541899] [2023-11-29 05:50:56,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757541899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:56,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:56,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:50:56,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055412532] [2023-11-29 05:50:56,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:56,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:50:56,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:56,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:50:56,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:50:56,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 137 [2023-11-29 05:50:56,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 107 transitions, 311 flow. Second operand has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 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) [2023-11-29 05:50:56,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:56,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 137 [2023-11-29 05:50:56,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:56,958 INFO L124 PetriNetUnfolderBase]: 73/347 cut-off events. [2023-11-29 05:50:56,958 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-11-29 05:50:56,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 347 events. 73/347 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1500 event pairs, 65 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 627. Up to 197 conditions per place. [2023-11-29 05:50:56,961 INFO L140 encePairwiseOnDemand]: 123/137 looper letters, 43 selfloop transitions, 13 changer transitions 0/106 dead transitions. [2023-11-29 05:50:56,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 106 transitions, 421 flow [2023-11-29 05:50:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:50:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:50:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2023-11-29 05:50:56,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6554744525547446 [2023-11-29 05:50:56,964 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 449 transitions. [2023-11-29 05:50:56,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 449 transitions. [2023-11-29 05:50:56,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:56,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 449 transitions. [2023-11-29 05:50:56,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 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) [2023-11-29 05:50:56,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-11-29 05:50:56,968 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-11-29 05:50:56,968 INFO L175 Difference]: Start difference. First operand has 129 places, 107 transitions, 311 flow. Second operand 5 states and 449 transitions. [2023-11-29 05:50:56,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 106 transitions, 421 flow [2023-11-29 05:50:56,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 106 transitions, 395 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 05:50:56,972 INFO L231 Difference]: Finished difference. Result has 126 places, 106 transitions, 309 flow [2023-11-29 05:50:56,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=126, PETRI_TRANSITIONS=106} [2023-11-29 05:50:56,973 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -13 predicate places. [2023-11-29 05:50:56,973 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 106 transitions, 309 flow [2023-11-29 05:50:56,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 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) [2023-11-29 05:50:56,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:56,974 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:56,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:50:56,974 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:56,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:56,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1366995785, now seen corresponding path program 1 times [2023-11-29 05:50:56,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:56,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090449584] [2023-11-29 05:50:56,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:56,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:50:57,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:57,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090449584] [2023-11-29 05:50:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090449584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:57,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:57,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:50:57,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473436989] [2023-11-29 05:50:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:57,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:50:57,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:57,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:50:57,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:50:57,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 137 [2023-11-29 05:50:57,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 106 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 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) [2023-11-29 05:50:57,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:57,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 137 [2023-11-29 05:50:57,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:57,488 INFO L124 PetriNetUnfolderBase]: 73/346 cut-off events. [2023-11-29 05:50:57,488 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 05:50:57,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 346 events. 73/346 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1504 event pairs, 65 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 632. Up to 197 conditions per place. [2023-11-29 05:50:57,490 INFO L140 encePairwiseOnDemand]: 123/137 looper letters, 49 selfloop transitions, 13 changer transitions 0/105 dead transitions. [2023-11-29 05:50:57,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 105 transitions, 431 flow [2023-11-29 05:50:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:50:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:50:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2023-11-29 05:50:57,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6204379562043796 [2023-11-29 05:50:57,493 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 425 transitions. [2023-11-29 05:50:57,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 425 transitions. [2023-11-29 05:50:57,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:57,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 425 transitions. [2023-11-29 05:50:57,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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) [2023-11-29 05:50:57,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-11-29 05:50:57,497 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-11-29 05:50:57,497 INFO L175 Difference]: Start difference. First operand has 126 places, 106 transitions, 309 flow. Second operand 5 states and 425 transitions. [2023-11-29 05:50:57,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 105 transitions, 431 flow [2023-11-29 05:50:57,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 105 transitions, 405 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:50:57,501 INFO L231 Difference]: Finished difference. Result has 125 places, 105 transitions, 307 flow [2023-11-29 05:50:57,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=125, PETRI_TRANSITIONS=105} [2023-11-29 05:50:57,502 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -14 predicate places. [2023-11-29 05:50:57,502 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 105 transitions, 307 flow [2023-11-29 05:50:57,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 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) [2023-11-29 05:50:57,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:57,502 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:57,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:50:57,502 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:57,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:57,503 INFO L85 PathProgramCache]: Analyzing trace with hash -707749788, now seen corresponding path program 1 times [2023-11-29 05:50:57,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:57,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593045293] [2023-11-29 05:50:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:50:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593045293] [2023-11-29 05:50:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593045293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:58,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:58,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:50:58,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712092274] [2023-11-29 05:50:58,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:58,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:50:58,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:58,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:50:58,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:50:58,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 137 [2023-11-29 05:50:58,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 105 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 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) [2023-11-29 05:50:58,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:58,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 137 [2023-11-29 05:50:58,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:59,013 INFO L124 PetriNetUnfolderBase]: 84/378 cut-off events. [2023-11-29 05:50:59,013 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-11-29 05:50:59,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 378 events. 84/378 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1726 event pairs, 54 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 684. Up to 139 conditions per place. [2023-11-29 05:50:59,016 INFO L140 encePairwiseOnDemand]: 117/137 looper letters, 59 selfloop transitions, 18 changer transitions 0/124 dead transitions. [2023-11-29 05:50:59,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 124 transitions, 508 flow [2023-11-29 05:50:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:50:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:50:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 665 transitions. [2023-11-29 05:50:59,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6934306569343066 [2023-11-29 05:50:59,020 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 665 transitions. [2023-11-29 05:50:59,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 665 transitions. [2023-11-29 05:50:59,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:59,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 665 transitions. [2023-11-29 05:50:59,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 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) [2023-11-29 05:50:59,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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) [2023-11-29 05:50:59,025 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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) [2023-11-29 05:50:59,025 INFO L175 Difference]: Start difference. First operand has 125 places, 105 transitions, 307 flow. Second operand 7 states and 665 transitions. [2023-11-29 05:50:59,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 124 transitions, 508 flow [2023-11-29 05:50:59,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 124 transitions, 482 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:50:59,029 INFO L231 Difference]: Finished difference. Result has 125 places, 104 transitions, 326 flow [2023-11-29 05:50:59,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=326, PETRI_PLACES=125, PETRI_TRANSITIONS=104} [2023-11-29 05:50:59,030 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -14 predicate places. [2023-11-29 05:50:59,030 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 104 transitions, 326 flow [2023-11-29 05:50:59,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 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) [2023-11-29 05:50:59,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:59,031 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:59,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:50:59,031 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:50:59,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:59,032 INFO L85 PathProgramCache]: Analyzing trace with hash -763110362, now seen corresponding path program 1 times [2023-11-29 05:50:59,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:59,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060334647] [2023-11-29 05:50:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:50:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060334647] [2023-11-29 05:50:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060334647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:59,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:50:59,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011394738] [2023-11-29 05:50:59,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:59,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:50:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:59,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:50:59,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:50:59,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 137 [2023-11-29 05:50:59,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 104 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 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) [2023-11-29 05:50:59,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:59,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 137 [2023-11-29 05:50:59,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:00,197 INFO L124 PetriNetUnfolderBase]: 73/334 cut-off events. [2023-11-29 05:51:00,197 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2023-11-29 05:51:00,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 334 events. 73/334 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1447 event pairs, 52 based on Foata normal form. 2/276 useless extension candidates. Maximal degree in co-relation 653. Up to 142 conditions per place. [2023-11-29 05:51:00,200 INFO L140 encePairwiseOnDemand]: 117/137 looper letters, 45 selfloop transitions, 18 changer transitions 3/109 dead transitions. [2023-11-29 05:51:00,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 109 transitions, 475 flow [2023-11-29 05:51:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:51:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:51:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 594 transitions. [2023-11-29 05:51:00,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6193952033368092 [2023-11-29 05:51:00,202 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 594 transitions. [2023-11-29 05:51:00,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 594 transitions. [2023-11-29 05:51:00,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:00,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 594 transitions. [2023-11-29 05:51:00,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 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) [2023-11-29 05:51:00,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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) [2023-11-29 05:51:00,206 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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) [2023-11-29 05:51:00,206 INFO L175 Difference]: Start difference. First operand has 125 places, 104 transitions, 326 flow. Second operand 7 states and 594 transitions. [2023-11-29 05:51:00,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 109 transitions, 475 flow [2023-11-29 05:51:00,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 109 transitions, 441 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:51:00,211 INFO L231 Difference]: Finished difference. Result has 122 places, 100 transitions, 320 flow [2023-11-29 05:51:00,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=122, PETRI_TRANSITIONS=100} [2023-11-29 05:51:00,211 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -17 predicate places. [2023-11-29 05:51:00,212 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 100 transitions, 320 flow [2023-11-29 05:51:00,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 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) [2023-11-29 05:51:00,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:00,212 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:00,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:51:00,212 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:00,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash -763110363, now seen corresponding path program 1 times [2023-11-29 05:51:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573389808] [2023-11-29 05:51:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:00,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:00,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:00,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573389808] [2023-11-29 05:51:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573389808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:00,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:00,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:51:00,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449534943] [2023-11-29 05:51:00,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:00,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:51:00,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:00,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:51:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:51:00,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 137 [2023-11-29 05:51:00,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 100 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 69.71428571428571) internal successors, (488), 7 states have internal predecessors, (488), 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) [2023-11-29 05:51:00,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:00,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 137 [2023-11-29 05:51:00,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:01,106 INFO L124 PetriNetUnfolderBase]: 73/339 cut-off events. [2023-11-29 05:51:01,106 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-11-29 05:51:01,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 339 events. 73/339 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1497 event pairs, 45 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 666. Up to 111 conditions per place. [2023-11-29 05:51:01,109 INFO L140 encePairwiseOnDemand]: 117/137 looper letters, 56 selfloop transitions, 18 changer transitions 0/106 dead transitions. [2023-11-29 05:51:01,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 106 transitions, 482 flow [2023-11-29 05:51:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:51:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:51:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 598 transitions. [2023-11-29 05:51:01,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5456204379562044 [2023-11-29 05:51:01,111 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 598 transitions. [2023-11-29 05:51:01,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 598 transitions. [2023-11-29 05:51:01,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:01,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 598 transitions. [2023-11-29 05:51:01,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 74.75) internal successors, (598), 8 states have internal predecessors, (598), 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) [2023-11-29 05:51:01,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-11-29 05:51:01,114 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-11-29 05:51:01,115 INFO L175 Difference]: Start difference. First operand has 122 places, 100 transitions, 320 flow. Second operand 8 states and 598 transitions. [2023-11-29 05:51:01,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 106 transitions, 482 flow [2023-11-29 05:51:01,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 106 transitions, 446 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 05:51:01,119 INFO L231 Difference]: Finished difference. Result has 121 places, 98 transitions, 316 flow [2023-11-29 05:51:01,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=316, PETRI_PLACES=121, PETRI_TRANSITIONS=98} [2023-11-29 05:51:01,120 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -18 predicate places. [2023-11-29 05:51:01,120 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 98 transitions, 316 flow [2023-11-29 05:51:01,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.71428571428571) internal successors, (488), 7 states have internal predecessors, (488), 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) [2023-11-29 05:51:01,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:01,120 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:01,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:51:01,121 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:01,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1090371840, now seen corresponding path program 1 times [2023-11-29 05:51:01,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:01,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867272222] [2023-11-29 05:51:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:01,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:01,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867272222] [2023-11-29 05:51:01,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867272222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:01,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:01,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:51:01,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605293686] [2023-11-29 05:51:01,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:01,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:51:01,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:01,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:51:01,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:51:01,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 137 [2023-11-29 05:51:01,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 98 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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) [2023-11-29 05:51:01,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:01,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 137 [2023-11-29 05:51:01,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:01,836 INFO L124 PetriNetUnfolderBase]: 73/336 cut-off events. [2023-11-29 05:51:01,836 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-11-29 05:51:01,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 336 events. 73/336 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1477 event pairs, 60 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 644. Up to 196 conditions per place. [2023-11-29 05:51:01,839 INFO L140 encePairwiseOnDemand]: 123/137 looper letters, 44 selfloop transitions, 13 changer transitions 0/97 dead transitions. [2023-11-29 05:51:01,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 97 transitions, 428 flow [2023-11-29 05:51:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:51:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:51:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2023-11-29 05:51:01,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654014598540146 [2023-11-29 05:51:01,841 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 448 transitions. [2023-11-29 05:51:01,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 448 transitions. [2023-11-29 05:51:01,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:01,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 448 transitions. [2023-11-29 05:51:01,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 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) [2023-11-29 05:51:01,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-11-29 05:51:01,845 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-11-29 05:51:01,845 INFO L175 Difference]: Start difference. First operand has 121 places, 98 transitions, 316 flow. Second operand 5 states and 448 transitions. [2023-11-29 05:51:01,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 97 transitions, 428 flow [2023-11-29 05:51:01,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 97 transitions, 392 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 05:51:01,850 INFO L231 Difference]: Finished difference. Result has 117 places, 97 transitions, 304 flow [2023-11-29 05:51:01,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=117, PETRI_TRANSITIONS=97} [2023-11-29 05:51:01,850 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -22 predicate places. [2023-11-29 05:51:01,851 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 97 transitions, 304 flow [2023-11-29 05:51:01,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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) [2023-11-29 05:51:01,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:01,851 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:01,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:51:01,852 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:01,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:01,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1090371839, now seen corresponding path program 1 times [2023-11-29 05:51:01,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:01,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088987749] [2023-11-29 05:51:01,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:01,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:02,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:02,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088987749] [2023-11-29 05:51:02,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088987749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:02,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:02,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:51:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331397785] [2023-11-29 05:51:02,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:02,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:51:02,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:02,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:51:02,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:51:02,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 137 [2023-11-29 05:51:02,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 97 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 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) [2023-11-29 05:51:02,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:02,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 137 [2023-11-29 05:51:02,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:02,362 INFO L124 PetriNetUnfolderBase]: 73/335 cut-off events. [2023-11-29 05:51:02,362 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2023-11-29 05:51:02,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 335 events. 73/335 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1473 event pairs, 60 based on Foata normal form. 1/274 useless extension candidates. Maximal degree in co-relation 635. Up to 196 conditions per place. [2023-11-29 05:51:02,365 INFO L140 encePairwiseOnDemand]: 123/137 looper letters, 50 selfloop transitions, 13 changer transitions 0/96 dead transitions. [2023-11-29 05:51:02,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 96 transitions, 428 flow [2023-11-29 05:51:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:51:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:51:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 424 transitions. [2023-11-29 05:51:02,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.618978102189781 [2023-11-29 05:51:02,367 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 424 transitions. [2023-11-29 05:51:02,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 424 transitions. [2023-11-29 05:51:02,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:02,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 424 transitions. [2023-11-29 05:51:02,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 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) [2023-11-29 05:51:02,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-11-29 05:51:02,370 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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) [2023-11-29 05:51:02,370 INFO L175 Difference]: Start difference. First operand has 117 places, 97 transitions, 304 flow. Second operand 5 states and 424 transitions. [2023-11-29 05:51:02,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 96 transitions, 428 flow [2023-11-29 05:51:02,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 96 transitions, 402 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:51:02,375 INFO L231 Difference]: Finished difference. Result has 116 places, 96 transitions, 302 flow [2023-11-29 05:51:02,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=116, PETRI_TRANSITIONS=96} [2023-11-29 05:51:02,376 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -23 predicate places. [2023-11-29 05:51:02,376 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 96 transitions, 302 flow [2023-11-29 05:51:02,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 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) [2023-11-29 05:51:02,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:02,376 INFO L208 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] [2023-11-29 05:51:02,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:51:02,377 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:02,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash 459852901, now seen corresponding path program 1 times [2023-11-29 05:51:02,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:02,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671394632] [2023-11-29 05:51:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:04,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:04,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671394632] [2023-11-29 05:51:04,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671394632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:04,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:04,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 05:51:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859617660] [2023-11-29 05:51:04,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:04,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:51:04,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:04,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:51:04,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:51:07,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 137 [2023-11-29 05:51:07,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 96 transitions, 302 flow. Second operand has 17 states, 17 states have (on average 48.470588235294116) internal successors, (824), 17 states have internal predecessors, (824), 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) [2023-11-29 05:51:07,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:07,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 137 [2023-11-29 05:51:07,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:08,527 INFO L124 PetriNetUnfolderBase]: 73/335 cut-off events. [2023-11-29 05:51:08,527 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-11-29 05:51:08,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 335 events. 73/335 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1485 event pairs, 45 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 638. Up to 109 conditions per place. [2023-11-29 05:51:08,529 INFO L140 encePairwiseOnDemand]: 113/137 looper letters, 55 selfloop transitions, 24 changer transitions 3/110 dead transitions. [2023-11-29 05:51:08,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 110 transitions, 501 flow [2023-11-29 05:51:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:51:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-29 05:51:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 776 transitions. [2023-11-29 05:51:08,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37761557177615573 [2023-11-29 05:51:08,533 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 776 transitions. [2023-11-29 05:51:08,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 776 transitions. [2023-11-29 05:51:08,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:08,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 776 transitions. [2023-11-29 05:51:08,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 51.733333333333334) internal successors, (776), 15 states have internal predecessors, (776), 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) [2023-11-29 05:51:08,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 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) [2023-11-29 05:51:08,538 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 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) [2023-11-29 05:51:08,538 INFO L175 Difference]: Start difference. First operand has 116 places, 96 transitions, 302 flow. Second operand 15 states and 776 transitions. [2023-11-29 05:51:08,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 110 transitions, 501 flow [2023-11-29 05:51:08,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 110 transitions, 475 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:51:08,541 INFO L231 Difference]: Finished difference. Result has 124 places, 94 transitions, 320 flow [2023-11-29 05:51:08,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=320, PETRI_PLACES=124, PETRI_TRANSITIONS=94} [2023-11-29 05:51:08,541 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -15 predicate places. [2023-11-29 05:51:08,542 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 94 transitions, 320 flow [2023-11-29 05:51:08,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 48.470588235294116) internal successors, (824), 17 states have internal predecessors, (824), 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) [2023-11-29 05:51:08,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:08,542 INFO L208 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] [2023-11-29 05:51:08,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:51:08,542 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:08,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash 459852900, now seen corresponding path program 1 times [2023-11-29 05:51:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:08,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105091867] [2023-11-29 05:51:08,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:08,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:09,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:09,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105091867] [2023-11-29 05:51:09,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105091867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:09,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:09,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:51:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007156585] [2023-11-29 05:51:09,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:09,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:51:09,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:09,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:51:09,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:51:10,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 137 [2023-11-29 05:51:10,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 94 transitions, 320 flow. Second operand has 10 states, 10 states have (on average 81.5) internal successors, (815), 10 states have internal predecessors, (815), 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) [2023-11-29 05:51:10,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:10,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 137 [2023-11-29 05:51:10,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:10,416 INFO L124 PetriNetUnfolderBase]: 73/334 cut-off events. [2023-11-29 05:51:10,417 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2023-11-29 05:51:10,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 334 events. 73/334 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1493 event pairs, 45 based on Foata normal form. 1/275 useless extension candidates. Maximal degree in co-relation 675. Up to 116 conditions per place. [2023-11-29 05:51:10,419 INFO L140 encePairwiseOnDemand]: 124/137 looper letters, 61 selfloop transitions, 12 changer transitions 0/101 dead transitions. [2023-11-29 05:51:10,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 101 transitions, 482 flow [2023-11-29 05:51:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:51:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:51:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 692 transitions. [2023-11-29 05:51:10,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6313868613138686 [2023-11-29 05:51:10,421 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 692 transitions. [2023-11-29 05:51:10,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 692 transitions. [2023-11-29 05:51:10,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:10,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 692 transitions. [2023-11-29 05:51:10,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 86.5) internal successors, (692), 8 states have internal predecessors, (692), 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) [2023-11-29 05:51:10,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-11-29 05:51:10,425 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-11-29 05:51:10,425 INFO L175 Difference]: Start difference. First operand has 124 places, 94 transitions, 320 flow. Second operand 8 states and 692 transitions. [2023-11-29 05:51:10,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 101 transitions, 482 flow [2023-11-29 05:51:10,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 101 transitions, 434 flow, removed 0 selfloop flow, removed 14 redundant places. [2023-11-29 05:51:10,428 INFO L231 Difference]: Finished difference. Result has 116 places, 93 transitions, 294 flow [2023-11-29 05:51:10,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=294, PETRI_PLACES=116, PETRI_TRANSITIONS=93} [2023-11-29 05:51:10,428 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -23 predicate places. [2023-11-29 05:51:10,428 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 93 transitions, 294 flow [2023-11-29 05:51:10,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 81.5) internal successors, (815), 10 states have internal predecessors, (815), 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) [2023-11-29 05:51:10,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:10,429 INFO L208 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] [2023-11-29 05:51:10,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:51:10,429 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:10,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -462970266, now seen corresponding path program 1 times [2023-11-29 05:51:10,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:10,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300925359] [2023-11-29 05:51:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300925359] [2023-11-29 05:51:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300925359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:10,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:10,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:51:10,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23093088] [2023-11-29 05:51:10,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:10,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:51:10,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:10,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:51:10,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:51:10,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 137 [2023-11-29 05:51:10,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 93 transitions, 294 flow. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 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) [2023-11-29 05:51:10,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:10,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 137 [2023-11-29 05:51:10,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:11,108 INFO L124 PetriNetUnfolderBase]: 82/332 cut-off events. [2023-11-29 05:51:11,108 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-29 05:51:11,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 332 events. 82/332 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1425 event pairs, 18 based on Foata normal form. 2/282 useless extension candidates. Maximal degree in co-relation 653. Up to 161 conditions per place. [2023-11-29 05:51:11,110 INFO L140 encePairwiseOnDemand]: 119/137 looper letters, 49 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2023-11-29 05:51:11,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 100 transitions, 442 flow [2023-11-29 05:51:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:51:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:51:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2023-11-29 05:51:11,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6472019464720195 [2023-11-29 05:51:11,111 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 532 transitions. [2023-11-29 05:51:11,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 532 transitions. [2023-11-29 05:51:11,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:11,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 532 transitions. [2023-11-29 05:51:11,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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) [2023-11-29 05:51:11,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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) [2023-11-29 05:51:11,114 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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) [2023-11-29 05:51:11,114 INFO L175 Difference]: Start difference. First operand has 116 places, 93 transitions, 294 flow. Second operand 6 states and 532 transitions. [2023-11-29 05:51:11,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 100 transitions, 442 flow [2023-11-29 05:51:11,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 100 transitions, 418 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 05:51:11,117 INFO L231 Difference]: Finished difference. Result has 112 places, 91 transitions, 298 flow [2023-11-29 05:51:11,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=107, 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=6, PETRI_FLOW=298, PETRI_PLACES=112, PETRI_TRANSITIONS=91} [2023-11-29 05:51:11,117 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -27 predicate places. [2023-11-29 05:51:11,117 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 91 transitions, 298 flow [2023-11-29 05:51:11,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 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) [2023-11-29 05:51:11,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:11,118 INFO L208 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] [2023-11-29 05:51:11,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:51:11,118 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:11,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash -462970267, now seen corresponding path program 1 times [2023-11-29 05:51:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:11,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631322552] [2023-11-29 05:51:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:11,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:11,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:11,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631322552] [2023-11-29 05:51:11,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631322552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:11,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:11,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:51:11,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546785989] [2023-11-29 05:51:11,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:11,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:51:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:51:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:51:11,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 137 [2023-11-29 05:51:11,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 91 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 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) [2023-11-29 05:51:11,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:11,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 137 [2023-11-29 05:51:11,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:11,595 INFO L124 PetriNetUnfolderBase]: 82/348 cut-off events. [2023-11-29 05:51:11,595 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-29 05:51:11,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 348 events. 82/348 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1579 event pairs, 36 based on Foata normal form. 2/288 useless extension candidates. Maximal degree in co-relation 679. Up to 123 conditions per place. [2023-11-29 05:51:11,597 INFO L140 encePairwiseOnDemand]: 117/137 looper letters, 53 selfloop transitions, 18 changer transitions 0/98 dead transitions. [2023-11-29 05:51:11,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 98 transitions, 458 flow [2023-11-29 05:51:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:51:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:51:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 502 transitions. [2023-11-29 05:51:11,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.610705596107056 [2023-11-29 05:51:11,599 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 502 transitions. [2023-11-29 05:51:11,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 502 transitions. [2023-11-29 05:51:11,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:11,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 502 transitions. [2023-11-29 05:51:11,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 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) [2023-11-29 05:51:11,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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) [2023-11-29 05:51:11,602 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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) [2023-11-29 05:51:11,602 INFO L175 Difference]: Start difference. First operand has 112 places, 91 transitions, 298 flow. Second operand 6 states and 502 transitions. [2023-11-29 05:51:11,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 98 transitions, 458 flow [2023-11-29 05:51:11,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 426 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:51:11,605 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 298 flow [2023-11-29 05:51:11,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=105, 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=6, PETRI_FLOW=298, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2023-11-29 05:51:11,605 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -29 predicate places. [2023-11-29 05:51:11,605 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 298 flow [2023-11-29 05:51:11,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 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) [2023-11-29 05:51:11,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:11,606 INFO L208 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] [2023-11-29 05:51:11,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:51:11,606 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:11,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1745013380, now seen corresponding path program 1 times [2023-11-29 05:51:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:11,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765901803] [2023-11-29 05:51:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:12,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:12,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765901803] [2023-11-29 05:51:12,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765901803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:12,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:12,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:51:12,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069968116] [2023-11-29 05:51:12,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:12,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:51:12,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:12,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:51:12,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:51:12,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 137 [2023-11-29 05:51:12,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 298 flow. Second operand has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 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) [2023-11-29 05:51:12,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:12,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 137 [2023-11-29 05:51:12,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:12,687 INFO L124 PetriNetUnfolderBase]: 73/329 cut-off events. [2023-11-29 05:51:12,687 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2023-11-29 05:51:12,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 329 events. 73/329 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1482 event pairs, 45 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 660. Up to 121 conditions per place. [2023-11-29 05:51:12,690 INFO L140 encePairwiseOnDemand]: 123/137 looper letters, 57 selfloop transitions, 13 changer transitions 0/96 dead transitions. [2023-11-29 05:51:12,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 96 transitions, 454 flow [2023-11-29 05:51:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:51:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:51:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-11-29 05:51:12,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.666058394160584 [2023-11-29 05:51:12,692 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-11-29 05:51:12,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-11-29 05:51:12,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:12,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-11-29 05:51:12,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 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) [2023-11-29 05:51:12,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 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) [2023-11-29 05:51:12,696 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 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) [2023-11-29 05:51:12,696 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 298 flow. Second operand 4 states and 365 transitions. [2023-11-29 05:51:12,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 96 transitions, 454 flow [2023-11-29 05:51:12,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 96 transitions, 418 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:51:12,701 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 286 flow [2023-11-29 05:51:12,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=104, 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=4, PETRI_FLOW=286, PETRI_PLACES=107, PETRI_TRANSITIONS=88} [2023-11-29 05:51:12,702 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -32 predicate places. [2023-11-29 05:51:12,702 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 286 flow [2023-11-29 05:51:12,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 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) [2023-11-29 05:51:12,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:12,703 INFO L208 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] [2023-11-29 05:51:12,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:51:12,703 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:12,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1745013379, now seen corresponding path program 1 times [2023-11-29 05:51:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:12,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977913948] [2023-11-29 05:51:12,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:13,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977913948] [2023-11-29 05:51:13,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977913948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:13,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:13,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:51:13,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577903022] [2023-11-29 05:51:13,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:13,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:51:13,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:13,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:51:13,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:51:13,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 137 [2023-11-29 05:51:13,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 88 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 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) [2023-11-29 05:51:13,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:13,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 137 [2023-11-29 05:51:13,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:13,806 INFO L124 PetriNetUnfolderBase]: 73/328 cut-off events. [2023-11-29 05:51:13,806 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2023-11-29 05:51:13,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 328 events. 73/328 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1472 event pairs, 45 based on Foata normal form. 1/273 useless extension candidates. Maximal degree in co-relation 629. Up to 120 conditions per place. [2023-11-29 05:51:13,808 INFO L140 encePairwiseOnDemand]: 123/137 looper letters, 50 selfloop transitions, 13 changer transitions 0/95 dead transitions. [2023-11-29 05:51:13,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 95 transitions, 428 flow [2023-11-29 05:51:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:51:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:51:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2023-11-29 05:51:13,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.791970802919708 [2023-11-29 05:51:13,810 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2023-11-29 05:51:13,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2023-11-29 05:51:13,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:13,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2023-11-29 05:51:13,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 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) [2023-11-29 05:51:13,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 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) [2023-11-29 05:51:13,811 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 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) [2023-11-29 05:51:13,811 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 286 flow. Second operand 4 states and 434 transitions. [2023-11-29 05:51:13,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 95 transitions, 428 flow [2023-11-29 05:51:13,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 95 transitions, 402 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:51:13,814 INFO L231 Difference]: Finished difference. Result has 106 places, 87 transitions, 284 flow [2023-11-29 05:51:13,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=103, 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=4, PETRI_FLOW=284, PETRI_PLACES=106, PETRI_TRANSITIONS=87} [2023-11-29 05:51:13,815 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -33 predicate places. [2023-11-29 05:51:13,815 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 87 transitions, 284 flow [2023-11-29 05:51:13,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 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) [2023-11-29 05:51:13,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:13,816 INFO L208 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] [2023-11-29 05:51:13,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:51:13,816 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:13,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:13,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1269404698, now seen corresponding path program 1 times [2023-11-29 05:51:13,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:13,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382242442] [2023-11-29 05:51:13,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:13,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:13,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:13,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382242442] [2023-11-29 05:51:13,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382242442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:13,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:13,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:51:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652769258] [2023-11-29 05:51:13,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:13,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:51:13,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:13,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:51:13,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:51:14,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 137 [2023-11-29 05:51:14,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 87 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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) [2023-11-29 05:51:14,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:14,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 137 [2023-11-29 05:51:14,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:14,197 INFO L124 PetriNetUnfolderBase]: 73/325 cut-off events. [2023-11-29 05:51:14,197 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2023-11-29 05:51:14,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 325 events. 73/325 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1450 event pairs, 53 based on Foata normal form. 9/285 useless extension candidates. Maximal degree in co-relation 626. Up to 187 conditions per place. [2023-11-29 05:51:14,199 INFO L140 encePairwiseOnDemand]: 133/137 looper letters, 60 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2023-11-29 05:51:14,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 93 transitions, 435 flow [2023-11-29 05:51:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:51:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:51:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-11-29 05:51:14,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8126520681265207 [2023-11-29 05:51:14,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-11-29 05:51:14,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-11-29 05:51:14,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:14,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-11-29 05:51:14,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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) [2023-11-29 05:51:14,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-11-29 05:51:14,202 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-11-29 05:51:14,202 INFO L175 Difference]: Start difference. First operand has 106 places, 87 transitions, 284 flow. Second operand 3 states and 334 transitions. [2023-11-29 05:51:14,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 93 transitions, 435 flow [2023-11-29 05:51:14,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 93 transitions, 407 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:51:14,205 INFO L231 Difference]: Finished difference. Result has 103 places, 85 transitions, 260 flow [2023-11-29 05:51:14,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=103, PETRI_TRANSITIONS=85} [2023-11-29 05:51:14,205 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -36 predicate places. [2023-11-29 05:51:14,206 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 260 flow [2023-11-29 05:51:14,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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) [2023-11-29 05:51:14,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:14,206 INFO L208 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] [2023-11-29 05:51:14,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:51:14,206 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:14,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1269404697, now seen corresponding path program 1 times [2023-11-29 05:51:14,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:14,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923216566] [2023-11-29 05:51:14,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:14,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:14,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923216566] [2023-11-29 05:51:14,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923216566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:14,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:14,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:51:14,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468056314] [2023-11-29 05:51:14,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:14,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:51:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:14,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:51:14,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:51:14,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 137 [2023-11-29 05:51:14,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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) [2023-11-29 05:51:14,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:14,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 137 [2023-11-29 05:51:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:14,559 INFO L124 PetriNetUnfolderBase]: 84/329 cut-off events. [2023-11-29 05:51:14,559 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-11-29 05:51:14,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 329 events. 84/329 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1405 event pairs, 55 based on Foata normal form. 9/295 useless extension candidates. Maximal degree in co-relation 666. Up to 199 conditions per place. [2023-11-29 05:51:14,562 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 63 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-11-29 05:51:14,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 95 transitions, 429 flow [2023-11-29 05:51:14,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:51:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:51:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-11-29 05:51:14,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8175182481751825 [2023-11-29 05:51:14,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-11-29 05:51:14,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-11-29 05:51:14,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:14,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-11-29 05:51:14,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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) [2023-11-29 05:51:14,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-11-29 05:51:14,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-11-29 05:51:14,565 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 260 flow. Second operand 3 states and 336 transitions. [2023-11-29 05:51:14,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 95 transitions, 429 flow [2023-11-29 05:51:14,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 95 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:51:14,569 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 296 flow [2023-11-29 05:51:14,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=105, PETRI_TRANSITIONS=88} [2023-11-29 05:51:14,570 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -34 predicate places. [2023-11-29 05:51:14,570 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 296 flow [2023-11-29 05:51:14,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 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) [2023-11-29 05:51:14,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:14,571 INFO L208 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] [2023-11-29 05:51:14,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:51:14,571 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:14,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:14,571 INFO L85 PathProgramCache]: Analyzing trace with hash 570830355, now seen corresponding path program 1 times [2023-11-29 05:51:14,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:14,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701406945] [2023-11-29 05:51:14,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:14,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:14,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:14,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701406945] [2023-11-29 05:51:14,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701406945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:14,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:14,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:51:14,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970104182] [2023-11-29 05:51:14,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:14,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:51:14,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:14,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:51:14,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:51:15,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 137 [2023-11-29 05:51:15,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 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) [2023-11-29 05:51:15,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:15,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 137 [2023-11-29 05:51:15,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:15,383 INFO L124 PetriNetUnfolderBase]: 84/341 cut-off events. [2023-11-29 05:51:15,383 INFO L125 PetriNetUnfolderBase]: For 201/204 co-relation queries the response was YES. [2023-11-29 05:51:15,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 341 events. 84/341 cut-off events. For 201/204 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1489 event pairs, 45 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 720. Up to 113 conditions per place. [2023-11-29 05:51:15,385 INFO L140 encePairwiseOnDemand]: 126/137 looper letters, 68 selfloop transitions, 11 changer transitions 0/104 dead transitions. [2023-11-29 05:51:15,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 104 transitions, 508 flow [2023-11-29 05:51:15,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:51:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:51:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions. [2023-11-29 05:51:15,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.683698296836983 [2023-11-29 05:51:15,387 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 562 transitions. [2023-11-29 05:51:15,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions. [2023-11-29 05:51:15,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:15,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions. [2023-11-29 05:51:15,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 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) [2023-11-29 05:51:15,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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) [2023-11-29 05:51:15,390 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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) [2023-11-29 05:51:15,390 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 296 flow. Second operand 6 states and 562 transitions. [2023-11-29 05:51:15,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 104 transitions, 508 flow [2023-11-29 05:51:15,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 104 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:51:15,394 INFO L231 Difference]: Finished difference. Result has 107 places, 87 transitions, 306 flow [2023-11-29 05:51:15,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=107, PETRI_TRANSITIONS=87} [2023-11-29 05:51:15,395 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -32 predicate places. [2023-11-29 05:51:15,395 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 87 transitions, 306 flow [2023-11-29 05:51:15,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.33333333333333) internal successors, (530), 6 states have internal predecessors, (530), 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) [2023-11-29 05:51:15,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:15,396 INFO L208 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] [2023-11-29 05:51:15,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 05:51:15,396 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:15,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash 570830356, now seen corresponding path program 1 times [2023-11-29 05:51:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:15,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582728990] [2023-11-29 05:51:15,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:15,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:15,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582728990] [2023-11-29 05:51:15,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582728990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:15,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:15,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:51:15,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763020425] [2023-11-29 05:51:15,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:15,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:51:15,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:15,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:51:15,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:51:16,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 137 [2023-11-29 05:51:16,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 87 transitions, 306 flow. Second operand has 7 states, 7 states have (on average 79.57142857142857) internal successors, (557), 7 states have internal predecessors, (557), 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) [2023-11-29 05:51:16,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:16,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 137 [2023-11-29 05:51:16,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:16,925 INFO L124 PetriNetUnfolderBase]: 96/366 cut-off events. [2023-11-29 05:51:16,925 INFO L125 PetriNetUnfolderBase]: For 228/232 co-relation queries the response was YES. [2023-11-29 05:51:16,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 366 events. 96/366 cut-off events. For 228/232 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1669 event pairs, 51 based on Foata normal form. 10/331 useless extension candidates. Maximal degree in co-relation 798. Up to 140 conditions per place. [2023-11-29 05:51:16,928 INFO L140 encePairwiseOnDemand]: 124/137 looper letters, 74 selfloop transitions, 15 changer transitions 0/113 dead transitions. [2023-11-29 05:51:16,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 556 flow [2023-11-29 05:51:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:51:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:51:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 601 transitions. [2023-11-29 05:51:16,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6266944734098019 [2023-11-29 05:51:16,930 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 601 transitions. [2023-11-29 05:51:16,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 601 transitions. [2023-11-29 05:51:16,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:16,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 601 transitions. [2023-11-29 05:51:16,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 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) [2023-11-29 05:51:16,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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) [2023-11-29 05:51:16,932 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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) [2023-11-29 05:51:16,932 INFO L175 Difference]: Start difference. First operand has 107 places, 87 transitions, 306 flow. Second operand 7 states and 601 transitions. [2023-11-29 05:51:16,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 556 flow [2023-11-29 05:51:16,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 113 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:51:16,935 INFO L231 Difference]: Finished difference. Result has 109 places, 89 transitions, 331 flow [2023-11-29 05:51:16,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=331, PETRI_PLACES=109, PETRI_TRANSITIONS=89} [2023-11-29 05:51:16,935 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -30 predicate places. [2023-11-29 05:51:16,935 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 89 transitions, 331 flow [2023-11-29 05:51:16,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.57142857142857) internal successors, (557), 7 states have internal predecessors, (557), 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) [2023-11-29 05:51:16,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:16,936 INFO L208 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] [2023-11-29 05:51:16,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 05:51:16,936 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:16,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash 515872536, now seen corresponding path program 1 times [2023-11-29 05:51:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:16,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460518672] [2023-11-29 05:51:16,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:16,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:19,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:19,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460518672] [2023-11-29 05:51:19,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460518672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:19,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:19,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2023-11-29 05:51:19,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237154676] [2023-11-29 05:51:19,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:19,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:51:19,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:19,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:51:19,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:51:29,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 137 [2023-11-29 05:51:29,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 89 transitions, 331 flow. Second operand has 26 states, 26 states have (on average 60.5) internal successors, (1573), 26 states have internal predecessors, (1573), 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) [2023-11-29 05:51:29,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:29,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 137 [2023-11-29 05:51:29,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:31,513 INFO L124 PetriNetUnfolderBase]: 124/430 cut-off events. [2023-11-29 05:51:31,513 INFO L125 PetriNetUnfolderBase]: For 311/318 co-relation queries the response was YES. [2023-11-29 05:51:31,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 430 events. 124/430 cut-off events. For 311/318 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2076 event pairs, 6 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 994. Up to 65 conditions per place. [2023-11-29 05:51:31,516 INFO L140 encePairwiseOnDemand]: 109/137 looper letters, 87 selfloop transitions, 37 changer transitions 3/142 dead transitions. [2023-11-29 05:51:31,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 142 transitions, 760 flow [2023-11-29 05:51:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 05:51:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-29 05:51:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1583 transitions. [2023-11-29 05:51:31,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621897810218978 [2023-11-29 05:51:31,519 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1583 transitions. [2023-11-29 05:51:31,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1583 transitions. [2023-11-29 05:51:31,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:31,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1583 transitions. [2023-11-29 05:51:31,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 63.32) internal successors, (1583), 25 states have internal predecessors, (1583), 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) [2023-11-29 05:51:31,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 137.0) internal successors, (3562), 26 states have internal predecessors, (3562), 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) [2023-11-29 05:51:31,525 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 137.0) internal successors, (3562), 26 states have internal predecessors, (3562), 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) [2023-11-29 05:51:31,525 INFO L175 Difference]: Start difference. First operand has 109 places, 89 transitions, 331 flow. Second operand 25 states and 1583 transitions. [2023-11-29 05:51:31,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 142 transitions, 760 flow [2023-11-29 05:51:31,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 142 transitions, 725 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-29 05:51:31,529 INFO L231 Difference]: Finished difference. Result has 132 places, 99 transitions, 455 flow [2023-11-29 05:51:31,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=455, PETRI_PLACES=132, PETRI_TRANSITIONS=99} [2023-11-29 05:51:31,530 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -7 predicate places. [2023-11-29 05:51:31,530 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 99 transitions, 455 flow [2023-11-29 05:51:31,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 60.5) internal successors, (1573), 26 states have internal predecessors, (1573), 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) [2023-11-29 05:51:31,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:31,530 INFO L208 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] [2023-11-29 05:51:31,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 05:51:31,531 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:31,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:31,531 INFO L85 PathProgramCache]: Analyzing trace with hash 515872537, now seen corresponding path program 1 times [2023-11-29 05:51:31,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:31,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776745023] [2023-11-29 05:51:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:31,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:35,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776745023] [2023-11-29 05:51:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776745023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2023-11-29 05:51:35,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204328826] [2023-11-29 05:51:35,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:35,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:51:35,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:35,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:51:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:51:44,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 137 [2023-11-29 05:51:44,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 99 transitions, 455 flow. Second operand has 26 states, 26 states have (on average 43.5) internal successors, (1131), 26 states have internal predecessors, (1131), 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) [2023-11-29 05:51:44,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:44,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 137 [2023-11-29 05:51:44,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:45,707 INFO L124 PetriNetUnfolderBase]: 157/505 cut-off events. [2023-11-29 05:51:45,707 INFO L125 PetriNetUnfolderBase]: For 535/543 co-relation queries the response was YES. [2023-11-29 05:51:45,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 505 events. 157/505 cut-off events. For 535/543 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2535 event pairs, 6 based on Foata normal form. 12/480 useless extension candidates. Maximal degree in co-relation 1354. Up to 84 conditions per place. [2023-11-29 05:51:45,710 INFO L140 encePairwiseOnDemand]: 109/137 looper letters, 94 selfloop transitions, 45 changer transitions 3/156 dead transitions. [2023-11-29 05:51:45,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 156 transitions, 936 flow [2023-11-29 05:51:45,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 05:51:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-29 05:51:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1296 transitions. [2023-11-29 05:51:45,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.337851929092805 [2023-11-29 05:51:45,712 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 1296 transitions. [2023-11-29 05:51:45,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 1296 transitions. [2023-11-29 05:51:45,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:45,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1296 transitions. [2023-11-29 05:51:45,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 46.285714285714285) internal successors, (1296), 28 states have internal predecessors, (1296), 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) [2023-11-29 05:51:45,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 137.0) internal successors, (3973), 29 states have internal predecessors, (3973), 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) [2023-11-29 05:51:45,719 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 137.0) internal successors, (3973), 29 states have internal predecessors, (3973), 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) [2023-11-29 05:51:45,719 INFO L175 Difference]: Start difference. First operand has 132 places, 99 transitions, 455 flow. Second operand 28 states and 1296 transitions. [2023-11-29 05:51:45,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 156 transitions, 936 flow [2023-11-29 05:51:45,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 156 transitions, 902 flow, removed 0 selfloop flow, removed 16 redundant places. [2023-11-29 05:51:45,724 INFO L231 Difference]: Finished difference. Result has 146 places, 106 transitions, 587 flow [2023-11-29 05:51:45,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=587, PETRI_PLACES=146, PETRI_TRANSITIONS=106} [2023-11-29 05:51:45,725 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2023-11-29 05:51:45,725 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 106 transitions, 587 flow [2023-11-29 05:51:45,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 43.5) internal successors, (1131), 26 states have internal predecessors, (1131), 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) [2023-11-29 05:51:45,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:45,726 INFO L208 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] [2023-11-29 05:51:45,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 05:51:45,726 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:45,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash 127224378, now seen corresponding path program 1 times [2023-11-29 05:51:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:45,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985016946] [2023-11-29 05:51:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:45,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:46,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:46,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985016946] [2023-11-29 05:51:46,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985016946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:46,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:46,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:51:46,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809264177] [2023-11-29 05:51:46,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:46,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:51:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:46,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:51:46,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:51:47,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 137 [2023-11-29 05:51:47,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 106 transitions, 587 flow. Second operand has 12 states, 12 states have (on average 64.83333333333333) internal successors, (778), 12 states have internal predecessors, (778), 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) [2023-11-29 05:51:47,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:47,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 137 [2023-11-29 05:51:47,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:48,047 INFO L124 PetriNetUnfolderBase]: 123/444 cut-off events. [2023-11-29 05:51:48,047 INFO L125 PetriNetUnfolderBase]: For 800/808 co-relation queries the response was YES. [2023-11-29 05:51:48,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 444 events. 123/444 cut-off events. For 800/808 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2256 event pairs, 18 based on Foata normal form. 19/415 useless extension candidates. Maximal degree in co-relation 1285. Up to 165 conditions per place. [2023-11-29 05:51:48,050 INFO L140 encePairwiseOnDemand]: 115/137 looper letters, 65 selfloop transitions, 27 changer transitions 0/120 dead transitions. [2023-11-29 05:51:48,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 120 transitions, 845 flow [2023-11-29 05:51:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:51:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:51:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 561 transitions. [2023-11-29 05:51:48,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5118613138686131 [2023-11-29 05:51:48,052 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 561 transitions. [2023-11-29 05:51:48,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 561 transitions. [2023-11-29 05:51:48,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:48,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 561 transitions. [2023-11-29 05:51:48,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 70.125) internal successors, (561), 8 states have internal predecessors, (561), 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) [2023-11-29 05:51:48,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-11-29 05:51:48,054 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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) [2023-11-29 05:51:48,054 INFO L175 Difference]: Start difference. First operand has 146 places, 106 transitions, 587 flow. Second operand 8 states and 561 transitions. [2023-11-29 05:51:48,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 120 transitions, 845 flow [2023-11-29 05:51:48,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 120 transitions, 750 flow, removed 1 selfloop flow, removed 24 redundant places. [2023-11-29 05:51:48,059 INFO L231 Difference]: Finished difference. Result has 127 places, 106 transitions, 565 flow [2023-11-29 05:51:48,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=565, PETRI_PLACES=127, PETRI_TRANSITIONS=106} [2023-11-29 05:51:48,059 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -12 predicate places. [2023-11-29 05:51:48,059 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 565 flow [2023-11-29 05:51:48,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 64.83333333333333) internal successors, (778), 12 states have internal predecessors, (778), 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) [2023-11-29 05:51:48,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:48,060 INFO L208 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, 1] [2023-11-29 05:51:48,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 05:51:48,060 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-29 05:51:48,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:48,060 INFO L85 PathProgramCache]: Analyzing trace with hash -351010806, now seen corresponding path program 1 times [2023-11-29 05:51:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:48,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000958478] [2023-11-29 05:51:48,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:51:48,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:51:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:51:48,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:51:48,289 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:51:48,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 94 remaining) [2023-11-29 05:51:48,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 94 remaining) [2023-11-29 05:51:48,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 94 remaining) [2023-11-29 05:51:48,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 94 remaining) [2023-11-29 05:51:48,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 94 remaining) [2023-11-29 05:51:48,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 94 remaining) [2023-11-29 05:51:48,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 94 remaining) [2023-11-29 05:51:48,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 94 remaining) [2023-11-29 05:51:48,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 94 remaining) [2023-11-29 05:51:48,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 94 remaining) [2023-11-29 05:51:48,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 94 remaining) [2023-11-29 05:51:48,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 94 remaining) [2023-11-29 05:51:48,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 94 remaining) [2023-11-29 05:51:48,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 94 remaining) [2023-11-29 05:51:48,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 94 remaining) [2023-11-29 05:51:48,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 94 remaining) [2023-11-29 05:51:48,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 94 remaining) [2023-11-29 05:51:48,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 94 remaining) [2023-11-29 05:51:48,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 94 remaining) [2023-11-29 05:51:48,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 94 remaining) [2023-11-29 05:51:48,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 94 remaining) [2023-11-29 05:51:48,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 94 remaining) [2023-11-29 05:51:48,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 94 remaining) [2023-11-29 05:51:48,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 94 remaining) [2023-11-29 05:51:48,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 94 remaining) [2023-11-29 05:51:48,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 94 remaining) [2023-11-29 05:51:48,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 94 remaining) [2023-11-29 05:51:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 94 remaining) [2023-11-29 05:51:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 94 remaining) [2023-11-29 05:51:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 94 remaining) [2023-11-29 05:51:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 94 remaining) [2023-11-29 05:51:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 94 remaining) [2023-11-29 05:51:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 94 remaining) [2023-11-29 05:51:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 94 remaining) [2023-11-29 05:51:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 94 remaining) [2023-11-29 05:51:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 94 remaining) [2023-11-29 05:51:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 94 remaining) [2023-11-29 05:51:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 94 remaining) [2023-11-29 05:51:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 94 remaining) [2023-11-29 05:51:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 94 remaining) [2023-11-29 05:51:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 94 remaining) [2023-11-29 05:51:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 94 remaining) [2023-11-29 05:51:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 94 remaining) [2023-11-29 05:51:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 94 remaining) [2023-11-29 05:51:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 94 remaining) [2023-11-29 05:51:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 94 remaining) [2023-11-29 05:51:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 94 remaining) [2023-11-29 05:51:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 94 remaining) [2023-11-29 05:51:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 94 remaining) [2023-11-29 05:51:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 94 remaining) [2023-11-29 05:51:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 94 remaining) [2023-11-29 05:51:48,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 94 remaining) [2023-11-29 05:51:48,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 94 remaining) [2023-11-29 05:51:48,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 94 remaining) [2023-11-29 05:51:48,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 94 remaining) [2023-11-29 05:51:48,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 94 remaining) [2023-11-29 05:51:48,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 94 remaining) [2023-11-29 05:51:48,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 94 remaining) [2023-11-29 05:51:48,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 94 remaining) [2023-11-29 05:51:48,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 94 remaining) [2023-11-29 05:51:48,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 94 remaining) [2023-11-29 05:51:48,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 94 remaining) [2023-11-29 05:51:48,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 94 remaining) [2023-11-29 05:51:48,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 94 remaining) [2023-11-29 05:51:48,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 94 remaining) [2023-11-29 05:51:48,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 94 remaining) [2023-11-29 05:51:48,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 94 remaining) [2023-11-29 05:51:48,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 94 remaining) [2023-11-29 05:51:48,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 94 remaining) [2023-11-29 05:51:48,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK (24 of 94 remaining) [2023-11-29 05:51:48,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 94 remaining) [2023-11-29 05:51:48,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 94 remaining) [2023-11-29 05:51:48,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 94 remaining) [2023-11-29 05:51:48,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 94 remaining) [2023-11-29 05:51:48,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 94 remaining) [2023-11-29 05:51:48,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 94 remaining) [2023-11-29 05:51:48,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 94 remaining) [2023-11-29 05:51:48,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 94 remaining) [2023-11-29 05:51:48,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 94 remaining) [2023-11-29 05:51:48,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 94 remaining) [2023-11-29 05:51:48,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 94 remaining) [2023-11-29 05:51:48,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 94 remaining) [2023-11-29 05:51:48,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 94 remaining) [2023-11-29 05:51:48,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 94 remaining) [2023-11-29 05:51:48,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 94 remaining) [2023-11-29 05:51:48,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 94 remaining) [2023-11-29 05:51:48,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 94 remaining) [2023-11-29 05:51:48,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 94 remaining) [2023-11-29 05:51:48,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 94 remaining) [2023-11-29 05:51:48,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 94 remaining) [2023-11-29 05:51:48,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 94 remaining) [2023-11-29 05:51:48,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 94 remaining) [2023-11-29 05:51:48,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 94 remaining) [2023-11-29 05:51:48,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 94 remaining) [2023-11-29 05:51:48,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 05:51:48,304 INFO L445 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, 1, 1] [2023-11-29 05:51:48,311 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:51:48,312 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:51:48,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 05:51:48,359 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre50 could not be translated [2023-11-29 05:51:48,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:51:48 BasicIcfg [2023-11-29 05:51:48,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:51:48,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:51:48,373 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:51:48,373 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:51:48,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:50:49" (3/4) ... [2023-11-29 05:51:48,375 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:51:48,396 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 05:51:48,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre50 could not be translated [2023-11-29 05:51:48,442 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:51:48,443 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:51:48,443 INFO L158 Benchmark]: Toolchain (without parser) took 61164.63ms. Allocated memory was 151.0MB in the beginning and 534.8MB in the end (delta: 383.8MB). Free memory was 110.5MB in the beginning and 311.5MB in the end (delta: -201.0MB). Peak memory consumption was 184.4MB. Max. memory is 16.1GB. [2023-11-29 05:51:48,444 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:51:48,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 846.37ms. Allocated memory is still 151.0MB. Free memory was 110.5MB in the beginning and 70.7MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-29 05:51:48,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.49ms. Allocated memory is still 151.0MB. Free memory was 70.7MB in the beginning and 67.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:51:48,445 INFO L158 Benchmark]: Boogie Preprocessor took 65.59ms. Allocated memory is still 151.0MB. Free memory was 67.0MB in the beginning and 62.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:51:48,445 INFO L158 Benchmark]: RCFGBuilder took 1114.98ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 62.7MB in the beginning and 143.7MB in the end (delta: -81.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-29 05:51:48,445 INFO L158 Benchmark]: TraceAbstraction took 59002.65ms. Allocated memory was 184.5MB in the beginning and 534.8MB in the end (delta: 350.2MB). Free memory was 143.7MB in the beginning and 320.9MB in the end (delta: -177.2MB). Peak memory consumption was 174.0MB. Max. memory is 16.1GB. [2023-11-29 05:51:48,446 INFO L158 Benchmark]: Witness Printer took 69.56ms. Allocated memory is still 534.8MB. Free memory was 320.9MB in the beginning and 311.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 05:51:48,448 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 151.0MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 846.37ms. Allocated memory is still 151.0MB. Free memory was 110.5MB in the beginning and 70.7MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.49ms. Allocated memory is still 151.0MB. Free memory was 70.7MB in the beginning and 67.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.59ms. Allocated memory is still 151.0MB. Free memory was 67.0MB in the beginning and 62.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1114.98ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 62.7MB in the beginning and 143.7MB in the end (delta: -81.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 59002.65ms. Allocated memory was 184.5MB in the beginning and 534.8MB in the end (delta: 350.2MB). Free memory was 143.7MB in the beginning and 320.9MB in the end (delta: -177.2MB). Peak memory consumption was 174.0MB. Max. memory is 16.1GB. * Witness Printer took 69.56ms. Allocated memory is still 534.8MB. Free memory was 320.9MB in the beginning and 311.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre50 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre50 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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={-6:0}, slot={2:0}, t1={15:0}] [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 [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: -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, 162 locations, 94 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: 58.8s, OverallIterations: 30, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14684 SdHoareTripleChecker+Valid, 35.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11385 mSDsluCounter, 9527 SdHoareTripleChecker+Invalid, 30.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9495 mSDsCounter, 875 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57550 IncrementalHoareTripleChecker+Invalid, 58425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 875 mSolverCounterUnsat, 32 mSDtfsCounter, 57550 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=587occurred in iteration=28, InterpolantAutomatonStates: 216, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 916 NumberOfCodeBlocks, 916 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 843 ConstructedInterpolants, 0 QuantifiedInterpolants, 9405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 163 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 33 InterpolantComputations, 27 PerfectInterpolantSequences, 1385/1418 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! [2023-11-29 05:51:48,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5413c1eb-73aa-4ce4-8531-601cc97d53ab/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)