./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/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_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/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_da6c7385-0479-4f91-a3d1-3b81fa7248d6/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 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:27:25,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:27:25,982 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:27:25,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:27:25,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:27:26,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:27:26,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:27:26,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:27:26,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:27:26,018 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:27:26,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:27:26,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:27:26,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:27:26,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:27:26,021 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:27:26,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:27:26,022 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:27:26,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:27:26,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:27:26,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:27:26,024 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:27:26,025 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:27:26,025 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:27:26,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:27:26,026 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:27:26,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:27:26,027 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:27:26,028 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:27:26,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:27:26,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:27:26,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:27:26,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:27:26,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:27:26,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:27:26,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:27:26,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:27:26,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:27:26,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:27:26,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:27:26,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:27:26,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:27:26,032 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_da6c7385-0479-4f91-a3d1-3b81fa7248d6/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_da6c7385-0479-4f91-a3d1-3b81fa7248d6/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 -> 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 [2023-11-29 05:27:26,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:27:26,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:27:26,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:27:26,317 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:27:26,317 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:27:26,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2023-11-29 05:27:29,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:27:29,629 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:27:29,629 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2023-11-29 05:27:29,650 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/data/e8716ccd1/7f1b590eb2fd42d39f1ae065c915a7e9/FLAG89ebf8fdb [2023-11-29 05:27:29,668 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/data/e8716ccd1/7f1b590eb2fd42d39f1ae065c915a7e9 [2023-11-29 05:27:29,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:27:29,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:27:29,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:27:29,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:27:29,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:27:29,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:27:29" (1/1) ... [2023-11-29 05:27:29,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e27f997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:29, skipping insertion in model container [2023-11-29 05:27:29,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:27:29" (1/1) ... [2023-11-29 05:27:29,749 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:27:30,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:27:30,335 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:27:30,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:27:30,504 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:27:30,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30 WrapperNode [2023-11-29 05:27:30,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:27:30,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:27:30,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:27:30,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:27:30,515 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:27:30" (1/1) ... [2023-11-29 05:27:30,540 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:27:30" (1/1) ... [2023-11-29 05:27:30,579 INFO L138 Inliner]: procedures = 371, calls = 43, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 194 [2023-11-29 05:27:30,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:27:30,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:27:30,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:27:30,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:27:30,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (1/1) ... [2023-11-29 05:27:30,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (1/1) ... [2023-11-29 05:27:30,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (1/1) ... [2023-11-29 05:27:30,632 INFO L175 MemorySlicer]: Split 40 memory accesses to 4 slices as follows [1, 9, 1, 29]. 73 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 27 writes are split as follows [1, 3, 1, 22]. [2023-11-29 05:27:30,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (1/1) ... [2023-11-29 05:27:30,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (1/1) ... [2023-11-29 05:27:30,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (1/1) ... [2023-11-29 05:27:30,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (1/1) ... [2023-11-29 05:27:30,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (1/1) ... [2023-11-29 05:27:30,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (1/1) ... [2023-11-29 05:27:30,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:27:30,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:27:30,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:27:30,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:27:30,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (1/1) ... [2023-11-29 05:27:30,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:27:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:27:30,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/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:27:30,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/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:27:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:27:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:27:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:27:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:27:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 05:27:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:27:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 05:27:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:27:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:27:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:27:30,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 05:27:30,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:27:30,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:27:30,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:27:30,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:27:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 05:27:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:27:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:27:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:27:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:27:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:27:30,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 05:27:30,753 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-29 05:27:30,753 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-29 05:27:30,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:27:30,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:27:30,755 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:27:30,980 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:27:30,983 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:27:31,547 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:27:31,818 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:27:31,819 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:27:31,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:27:31 BoogieIcfgContainer [2023-11-29 05:27:31,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:27:31,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:27:31,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:27:31,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:27:31,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:27:29" (1/3) ... [2023-11-29 05:27:31,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a85a3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:27:31, skipping insertion in model container [2023-11-29 05:27:31,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:27:30" (2/3) ... [2023-11-29 05:27:31,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a85a3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:27:31, skipping insertion in model container [2023-11-29 05:27:31,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:27:31" (3/3) ... [2023-11-29 05:27:31,829 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc-deref.i [2023-11-29 05:27:31,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:27:31,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2023-11-29 05:27:31,852 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:27:31,938 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:27:31,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 131 transitions, 266 flow [2023-11-29 05:27:32,077 INFO L124 PetriNetUnfolderBase]: 1/130 cut-off events. [2023-11-29 05:27:32,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:27:32,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 130 events. 1/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 253 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-29 05:27:32,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 131 transitions, 266 flow [2023-11-29 05:27:32,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 130 transitions, 263 flow [2023-11-29 05:27:32,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:27:32,106 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;@64626fe5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:27:32,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2023-11-29 05:27:32,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:27:32,110 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-11-29 05:27:32,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:27:32,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:32,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-29 05:27:32,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:32,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash 615170, now seen corresponding path program 1 times [2023-11-29 05:27:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:32,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178669341] [2023-11-29 05:27:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:32,385 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:27:32,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178669341] [2023-11-29 05:27:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178669341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:32,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:32,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82240287] [2023-11-29 05:27:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:32,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:32,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:32,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:32,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2023-11-29 05:27:32,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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:27:32,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:32,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2023-11-29 05:27:32,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:32,663 INFO L124 PetriNetUnfolderBase]: 64/327 cut-off events. [2023-11-29 05:27:32,663 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 05:27:32,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 327 events. 64/327 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1326 event pairs, 63 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 377. Up to 166 conditions per place. [2023-11-29 05:27:32,669 INFO L140 encePairwiseOnDemand]: 128/131 looper letters, 38 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2023-11-29 05:27:32,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 131 transitions, 345 flow [2023-11-29 05:27:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-11-29 05:27:32,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.806615776081425 [2023-11-29 05:27:32,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-11-29 05:27:32,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-11-29 05:27:32,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:32,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-11-29 05:27:32,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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:27:32,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:27:32,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:27:32,707 INFO L175 Difference]: Start difference. First operand has 133 places, 130 transitions, 263 flow. Second operand 3 states and 317 transitions. [2023-11-29 05:27:32,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 131 transitions, 345 flow [2023-11-29 05:27:32,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 131 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:27:32,716 INFO L231 Difference]: Finished difference. Result has 135 places, 131 transitions, 274 flow [2023-11-29 05:27:32,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=135, PETRI_TRANSITIONS=131} [2023-11-29 05:27:32,723 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 2 predicate places. [2023-11-29 05:27:32,723 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 131 transitions, 274 flow [2023-11-29 05:27:32,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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:27:32,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:32,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-29 05:27:32,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:27:32,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:32,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash 19066370, now seen corresponding path program 1 times [2023-11-29 05:27:32,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:32,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774221447] [2023-11-29 05:27:32,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:32,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:32,821 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:27:32,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774221447] [2023-11-29 05:27:32,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774221447] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:27:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538562714] [2023-11-29 05:27:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:32,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:27:32,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:27:32,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:27:32,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:27:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:32,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:27:32,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:27:33,004 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:27:33,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:27:33,024 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:27:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538562714] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:27:33,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:27:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-29 05:27:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285813964] [2023-11-29 05:27:33,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:27:33,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:27:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:27:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:27:33,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2023-11-29 05:27:33,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 131 transitions, 274 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 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:27:33,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:33,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2023-11-29 05:27:33,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:33,224 INFO L124 PetriNetUnfolderBase]: 64/330 cut-off events. [2023-11-29 05:27:33,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:27:33,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 330 events. 64/330 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1319 event pairs, 63 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 502. Up to 166 conditions per place. [2023-11-29 05:27:33,229 INFO L140 encePairwiseOnDemand]: 128/131 looper letters, 38 selfloop transitions, 5 changer transitions 0/134 dead transitions. [2023-11-29 05:27:33,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 372 flow [2023-11-29 05:27:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:27:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:27:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-11-29 05:27:33,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7608142493638677 [2023-11-29 05:27:33,235 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-11-29 05:27:33,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-11-29 05:27:33,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:33,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-11-29 05:27:33,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 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:27:33,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 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:27:33,265 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 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:27:33,266 INFO L175 Difference]: Start difference. First operand has 135 places, 131 transitions, 274 flow. Second operand 6 states and 598 transitions. [2023-11-29 05:27:33,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 372 flow [2023-11-29 05:27:33,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 134 transitions, 368 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 05:27:33,272 INFO L231 Difference]: Finished difference. Result has 142 places, 134 transitions, 306 flow [2023-11-29 05:27:33,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=142, PETRI_TRANSITIONS=134} [2023-11-29 05:27:33,274 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 9 predicate places. [2023-11-29 05:27:33,274 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 134 transitions, 306 flow [2023-11-29 05:27:33,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 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:27:33,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:33,276 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-11-29 05:27:33,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:27:33,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:27:33,477 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:33,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:33,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1066672898, now seen corresponding path program 2 times [2023-11-29 05:27:33,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:33,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817980827] [2023-11-29 05:27:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:33,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:33,598 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:27:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817980827] [2023-11-29 05:27:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817980827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:33,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:33,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:33,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317453514] [2023-11-29 05:27:33,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:33,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:33,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:33,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:33,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:33,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 131 [2023-11-29 05:27:33,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 134 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:33,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:33,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 131 [2023-11-29 05:27:33,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:33,920 INFO L124 PetriNetUnfolderBase]: 64/319 cut-off events. [2023-11-29 05:27:33,921 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 05:27:33,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 319 events. 64/319 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1261 event pairs, 63 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 487. Up to 165 conditions per place. [2023-11-29 05:27:33,924 INFO L140 encePairwiseOnDemand]: 111/131 looper letters, 38 selfloop transitions, 10 changer transitions 0/124 dead transitions. [2023-11-29 05:27:33,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 124 transitions, 382 flow [2023-11-29 05:27:33,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2023-11-29 05:27:33,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251908396946565 [2023-11-29 05:27:33,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2023-11-29 05:27:33,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2023-11-29 05:27:33,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:33,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2023-11-29 05:27:33,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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:27:33,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:27:33,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:27:33,933 INFO L175 Difference]: Start difference. First operand has 142 places, 134 transitions, 306 flow. Second operand 3 states and 285 transitions. [2023-11-29 05:27:33,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 124 transitions, 382 flow [2023-11-29 05:27:33,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 124 transitions, 368 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-29 05:27:33,939 INFO L231 Difference]: Finished difference. Result has 133 places, 124 transitions, 292 flow [2023-11-29 05:27:33,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=133, PETRI_TRANSITIONS=124} [2023-11-29 05:27:33,941 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 0 predicate places. [2023-11-29 05:27:33,941 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 124 transitions, 292 flow [2023-11-29 05:27:33,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:33,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:33,942 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-11-29 05:27:33,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:27:33,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:33,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:33,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1066672899, now seen corresponding path program 1 times [2023-11-29 05:27:33,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:33,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440299909] [2023-11-29 05:27:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:34,072 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:27:34,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440299909] [2023-11-29 05:27:34,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440299909] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:27:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049384228] [2023-11-29 05:27:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:34,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:27:34,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:27:34,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:27:34,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:27:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:34,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:27:34,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:27:34,215 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:27:34,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:27:34,285 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:27:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049384228] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:27:34,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:27:34,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-29 05:27:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908033044] [2023-11-29 05:27:34,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:27:34,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:27:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:27:34,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:27:34,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2023-11-29 05:27:34,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 124 transitions, 292 flow. Second operand has 13 states, 13 states have (on average 93.07692307692308) internal successors, (1210), 13 states have internal predecessors, (1210), 0 states have call successors, (0), 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:27:34,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:34,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2023-11-29 05:27:34,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:34,486 INFO L124 PetriNetUnfolderBase]: 64/325 cut-off events. [2023-11-29 05:27:34,486 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-29 05:27:34,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 325 events. 64/325 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1268 event pairs, 63 based on Foata normal form. 6/252 useless extension candidates. Maximal degree in co-relation 492. Up to 166 conditions per place. [2023-11-29 05:27:34,489 INFO L140 encePairwiseOnDemand]: 128/131 looper letters, 38 selfloop transitions, 11 changer transitions 0/130 dead transitions. [2023-11-29 05:27:34,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 130 transitions, 426 flow [2023-11-29 05:27:34,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:27:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:27:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1159 transitions. [2023-11-29 05:27:34,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7372773536895675 [2023-11-29 05:27:34,494 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1159 transitions. [2023-11-29 05:27:34,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1159 transitions. [2023-11-29 05:27:34,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:34,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1159 transitions. [2023-11-29 05:27:34,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.58333333333333) internal successors, (1159), 12 states have internal predecessors, (1159), 0 states have call successors, (0), 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:27:34,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 131.0) internal successors, (1703), 13 states have internal predecessors, (1703), 0 states have call successors, (0), 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:27:34,504 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 131.0) internal successors, (1703), 13 states have internal predecessors, (1703), 0 states have call successors, (0), 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:27:34,504 INFO L175 Difference]: Start difference. First operand has 133 places, 124 transitions, 292 flow. Second operand 12 states and 1159 transitions. [2023-11-29 05:27:34,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 130 transitions, 426 flow [2023-11-29 05:27:34,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 130 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:34,510 INFO L231 Difference]: Finished difference. Result has 148 places, 130 transitions, 356 flow [2023-11-29 05:27:34,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=356, PETRI_PLACES=148, PETRI_TRANSITIONS=130} [2023-11-29 05:27:34,512 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 15 predicate places. [2023-11-29 05:27:34,512 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 130 transitions, 356 flow [2023-11-29 05:27:34,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 93.07692307692308) internal successors, (1210), 13 states have internal predecessors, (1210), 0 states have call successors, (0), 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:27:34,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:34,513 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2023-11-29 05:27:34,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:27:34,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:27:34,714 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:34,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:34,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1200636675, now seen corresponding path program 2 times [2023-11-29 05:27:34,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:34,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465534554] [2023-11-29 05:27:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:34,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:34,854 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:27:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:34,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465534554] [2023-11-29 05:27:34,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465534554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:34,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:34,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:34,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418257532] [2023-11-29 05:27:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:34,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:34,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:34,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:34,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 131 [2023-11-29 05:27:34,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 130 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:34,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:34,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 131 [2023-11-29 05:27:34,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:35,127 INFO L124 PetriNetUnfolderBase]: 64/315 cut-off events. [2023-11-29 05:27:35,127 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-29 05:27:35,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 315 events. 64/315 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1238 event pairs, 63 based on Foata normal form. 5/246 useless extension candidates. Maximal degree in co-relation 478. Up to 171 conditions per place. [2023-11-29 05:27:35,130 INFO L140 encePairwiseOnDemand]: 111/131 looper letters, 39 selfloop transitions, 10 changer transitions 0/120 dead transitions. [2023-11-29 05:27:35,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 120 transitions, 434 flow [2023-11-29 05:27:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-11-29 05:27:35,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7506361323155216 [2023-11-29 05:27:35,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-11-29 05:27:35,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-11-29 05:27:35,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:35,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-11-29 05:27:35,134 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:27:35,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:27:35,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:27:35,136 INFO L175 Difference]: Start difference. First operand has 148 places, 130 transitions, 356 flow. Second operand 3 states and 295 transitions. [2023-11-29 05:27:35,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 120 transitions, 434 flow [2023-11-29 05:27:35,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 120 transitions, 386 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-11-29 05:27:35,142 INFO L231 Difference]: Finished difference. Result has 135 places, 120 transitions, 308 flow [2023-11-29 05:27:35,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=135, PETRI_TRANSITIONS=120} [2023-11-29 05:27:35,143 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 2 predicate places. [2023-11-29 05:27:35,144 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 120 transitions, 308 flow [2023-11-29 05:27:35,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:35,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:35,144 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2023-11-29 05:27:35,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:27:35,144 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:35,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1534338997, now seen corresponding path program 1 times [2023-11-29 05:27:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:35,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762967729] [2023-11-29 05:27:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:35,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:35,360 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:27:35,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762967729] [2023-11-29 05:27:35,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762967729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:35,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:35,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:27:35,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304676202] [2023-11-29 05:27:35,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:35,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:27:35,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:27:35,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:27:35,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 131 [2023-11-29 05:27:35,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 120 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 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:27:35,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:35,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 131 [2023-11-29 05:27:35,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:35,831 INFO L124 PetriNetUnfolderBase]: 77/365 cut-off events. [2023-11-29 05:27:35,832 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-29 05:27:35,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 365 events. 77/365 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1572 event pairs, 55 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 578. Up to 161 conditions per place. [2023-11-29 05:27:35,835 INFO L140 encePairwiseOnDemand]: 120/131 looper letters, 67 selfloop transitions, 3 changer transitions 0/127 dead transitions. [2023-11-29 05:27:35,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 462 flow [2023-11-29 05:27:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:27:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:27:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-11-29 05:27:35,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7251908396946565 [2023-11-29 05:27:35,837 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-11-29 05:27:35,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-11-29 05:27:35,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:35,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-11-29 05:27:35,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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:27:35,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 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:27:35,841 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 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:27:35,841 INFO L175 Difference]: Start difference. First operand has 135 places, 120 transitions, 308 flow. Second operand 4 states and 380 transitions. [2023-11-29 05:27:35,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 462 flow [2023-11-29 05:27:35,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:35,846 INFO L231 Difference]: Finished difference. Result has 131 places, 114 transitions, 291 flow [2023-11-29 05:27:35,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=131, PETRI_TRANSITIONS=114} [2023-11-29 05:27:35,847 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -2 predicate places. [2023-11-29 05:27:35,848 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 114 transitions, 291 flow [2023-11-29 05:27:35,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 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:27:35,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:35,848 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2023-11-29 05:27:35,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:27:35,848 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:35,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1534338996, now seen corresponding path program 1 times [2023-11-29 05:27:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:35,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866104138] [2023-11-29 05:27:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:36,184 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:27:36,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866104138] [2023-11-29 05:27:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866104138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:36,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188765600] [2023-11-29 05:27:36,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:36,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:27:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:36,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:27:36,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:27:36,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 131 [2023-11-29 05:27:36,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 114 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 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:27:36,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:36,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 131 [2023-11-29 05:27:36,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:36,808 INFO L124 PetriNetUnfolderBase]: 84/381 cut-off events. [2023-11-29 05:27:36,808 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-29 05:27:36,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 381 events. 84/381 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1711 event pairs, 54 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 630. Up to 144 conditions per place. [2023-11-29 05:27:36,812 INFO L140 encePairwiseOnDemand]: 122/131 looper letters, 66 selfloop transitions, 5 changer transitions 0/129 dead transitions. [2023-11-29 05:27:36,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 129 transitions, 468 flow [2023-11-29 05:27:36,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:27:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:27:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 460 transitions. [2023-11-29 05:27:36,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7022900763358778 [2023-11-29 05:27:36,815 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 460 transitions. [2023-11-29 05:27:36,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 460 transitions. [2023-11-29 05:27:36,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:36,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 460 transitions. [2023-11-29 05:27:36,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 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:27:36,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:36,820 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:36,820 INFO L175 Difference]: Start difference. First operand has 131 places, 114 transitions, 291 flow. Second operand 5 states and 460 transitions. [2023-11-29 05:27:36,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 129 transitions, 468 flow [2023-11-29 05:27:36,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 129 transitions, 466 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:27:36,825 INFO L231 Difference]: Finished difference. Result has 131 places, 112 transitions, 302 flow [2023-11-29 05:27:36,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=131, PETRI_TRANSITIONS=112} [2023-11-29 05:27:36,826 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -2 predicate places. [2023-11-29 05:27:36,827 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 112 transitions, 302 flow [2023-11-29 05:27:36,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 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:27:36,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:36,827 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:36,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:27:36,827 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:36,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:36,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1345356097, now seen corresponding path program 1 times [2023-11-29 05:27:36,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:36,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707411777] [2023-11-29 05:27:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:36,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:37,154 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:27:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:37,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707411777] [2023-11-29 05:27:37,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707411777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:37,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:37,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:27:37,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441020874] [2023-11-29 05:27:37,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:37,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:27:37,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:37,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:27:37,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:27:37,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 131 [2023-11-29 05:27:37,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 112 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 66.42857142857143) internal successors, (465), 7 states have internal predecessors, (465), 0 states have call successors, (0), 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:27:37,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:37,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 131 [2023-11-29 05:27:37,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:37,956 INFO L124 PetriNetUnfolderBase]: 73/348 cut-off events. [2023-11-29 05:27:37,956 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2023-11-29 05:27:37,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 348 events. 73/348 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1493 event pairs, 65 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 640. Up to 192 conditions per place. [2023-11-29 05:27:37,959 INFO L140 encePairwiseOnDemand]: 110/131 looper letters, 48 selfloop transitions, 16 changer transitions 0/107 dead transitions. [2023-11-29 05:27:37,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 107 transitions, 420 flow [2023-11-29 05:27:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:27:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:27:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 576 transitions. [2023-11-29 05:27:37,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.549618320610687 [2023-11-29 05:27:37,962 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 576 transitions. [2023-11-29 05:27:37,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 576 transitions. [2023-11-29 05:27:37,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:37,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 576 transitions. [2023-11-29 05:27:37,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 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:27:37,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 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:27:37,967 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 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:27:37,967 INFO L175 Difference]: Start difference. First operand has 131 places, 112 transitions, 302 flow. Second operand 8 states and 576 transitions. [2023-11-29 05:27:37,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 107 transitions, 420 flow [2023-11-29 05:27:37,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 107 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:27:37,970 INFO L231 Difference]: Finished difference. Result has 130 places, 107 transitions, 317 flow [2023-11-29 05:27:37,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=130, PETRI_TRANSITIONS=107} [2023-11-29 05:27:37,971 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -3 predicate places. [2023-11-29 05:27:37,972 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 107 transitions, 317 flow [2023-11-29 05:27:37,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.42857142857143) internal successors, (465), 7 states have internal predecessors, (465), 0 states have call successors, (0), 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:27:37,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:37,972 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:37,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:27:37,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:37,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:37,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1345356098, now seen corresponding path program 1 times [2023-11-29 05:27:37,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:37,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048082062] [2023-11-29 05:27:37,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:37,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:38,363 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:27:38,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:38,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048082062] [2023-11-29 05:27:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048082062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:38,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:38,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:27:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62561815] [2023-11-29 05:27:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:38,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:27:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:38,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:27:38,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:27:39,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 131 [2023-11-29 05:27:39,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 107 transitions, 317 flow. Second operand has 7 states, 7 states have (on average 70.42857142857143) internal successors, (493), 7 states have internal predecessors, (493), 0 states have call successors, (0), 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:27:39,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:39,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 131 [2023-11-29 05:27:39,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:39,442 INFO L124 PetriNetUnfolderBase]: 73/346 cut-off events. [2023-11-29 05:27:39,442 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-29 05:27:39,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 346 events. 73/346 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1519 event pairs, 65 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 636. Up to 198 conditions per place. [2023-11-29 05:27:39,445 INFO L140 encePairwiseOnDemand]: 118/131 looper letters, 52 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2023-11-29 05:27:39,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 105 transitions, 439 flow [2023-11-29 05:27:39,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:27:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:27:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 535 transitions. [2023-11-29 05:27:39,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5834242093784079 [2023-11-29 05:27:39,448 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 535 transitions. [2023-11-29 05:27:39,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 535 transitions. [2023-11-29 05:27:39,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:39,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 535 transitions. [2023-11-29 05:27:39,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 76.42857142857143) internal successors, (535), 7 states have internal predecessors, (535), 0 states have call successors, (0), 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:27:39,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 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:27:39,454 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 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:27:39,454 INFO L175 Difference]: Start difference. First operand has 130 places, 107 transitions, 317 flow. Second operand 7 states and 535 transitions. [2023-11-29 05:27:39,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 105 transitions, 439 flow [2023-11-29 05:27:39,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 105 transitions, 407 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 05:27:39,458 INFO L231 Difference]: Finished difference. Result has 127 places, 105 transitions, 303 flow [2023-11-29 05:27:39,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=303, PETRI_PLACES=127, PETRI_TRANSITIONS=105} [2023-11-29 05:27:39,460 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -6 predicate places. [2023-11-29 05:27:39,460 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 105 transitions, 303 flow [2023-11-29 05:27:39,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.42857142857143) internal successors, (493), 7 states have internal predecessors, (493), 0 states have call successors, (0), 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:27:39,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:39,461 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:39,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:27:39,461 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:39,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash 102074541, now seen corresponding path program 1 times [2023-11-29 05:27:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:39,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790867293] [2023-11-29 05:27:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:39,718 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:27:39,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:39,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790867293] [2023-11-29 05:27:39,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790867293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:39,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:39,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:27:39,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128514654] [2023-11-29 05:27:39,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:39,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:27:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:39,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:27:39,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:27:40,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 131 [2023-11-29 05:27:40,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 105 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:40,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:40,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 131 [2023-11-29 05:27:40,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:40,199 INFO L124 PetriNetUnfolderBase]: 73/345 cut-off events. [2023-11-29 05:27:40,199 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-11-29 05:27:40,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 345 events. 73/345 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1506 event pairs, 65 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 622. Up to 197 conditions per place. [2023-11-29 05:27:40,202 INFO L140 encePairwiseOnDemand]: 119/131 looper letters, 44 selfloop transitions, 11 changer transitions 0/104 dead transitions. [2023-11-29 05:27:40,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 104 transitions, 411 flow [2023-11-29 05:27:40,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:27:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:27:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2023-11-29 05:27:40,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6610687022900763 [2023-11-29 05:27:40,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 433 transitions. [2023-11-29 05:27:40,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 433 transitions. [2023-11-29 05:27:40,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:40,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 433 transitions. [2023-11-29 05:27:40,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 0 states have call successors, (0), 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:27:40,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:40,207 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:40,207 INFO L175 Difference]: Start difference. First operand has 127 places, 105 transitions, 303 flow. Second operand 5 states and 433 transitions. [2023-11-29 05:27:40,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 104 transitions, 411 flow [2023-11-29 05:27:40,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 104 transitions, 389 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 05:27:40,211 INFO L231 Difference]: Finished difference. Result has 124 places, 104 transitions, 301 flow [2023-11-29 05:27:40,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=124, PETRI_TRANSITIONS=104} [2023-11-29 05:27:40,212 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -9 predicate places. [2023-11-29 05:27:40,212 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 104 transitions, 301 flow [2023-11-29 05:27:40,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:40,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:40,212 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:40,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:27:40,213 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:40,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 102074540, now seen corresponding path program 1 times [2023-11-29 05:27:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:40,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051223490] [2023-11-29 05:27:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:40,311 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:27:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:40,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051223490] [2023-11-29 05:27:40,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051223490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:40,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:40,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:27:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961974427] [2023-11-29 05:27:40,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:40,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:27:40,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:40,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:27:40,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:27:40,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 131 [2023-11-29 05:27:40,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 104 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 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:27:40,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:40,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 131 [2023-11-29 05:27:40,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:40,787 INFO L124 PetriNetUnfolderBase]: 73/344 cut-off events. [2023-11-29 05:27:40,787 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-29 05:27:40,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 344 events. 73/344 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1506 event pairs, 65 based on Foata normal form. 1/278 useless extension candidates. Maximal degree in co-relation 626. Up to 197 conditions per place. [2023-11-29 05:27:40,790 INFO L140 encePairwiseOnDemand]: 119/131 looper letters, 49 selfloop transitions, 11 changer transitions 0/103 dead transitions. [2023-11-29 05:27:40,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 103 transitions, 419 flow [2023-11-29 05:27:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:27:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:27:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2023-11-29 05:27:40,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6305343511450382 [2023-11-29 05:27:40,792 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 413 transitions. [2023-11-29 05:27:40,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 413 transitions. [2023-11-29 05:27:40,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:40,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 413 transitions. [2023-11-29 05:27:40,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 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:27:40,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:40,796 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:40,796 INFO L175 Difference]: Start difference. First operand has 124 places, 104 transitions, 301 flow. Second operand 5 states and 413 transitions. [2023-11-29 05:27:40,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 103 transitions, 419 flow [2023-11-29 05:27:40,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 103 transitions, 397 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:27:40,799 INFO L231 Difference]: Finished difference. Result has 123 places, 103 transitions, 299 flow [2023-11-29 05:27:40,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=123, PETRI_TRANSITIONS=103} [2023-11-29 05:27:40,800 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -10 predicate places. [2023-11-29 05:27:40,800 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 103 transitions, 299 flow [2023-11-29 05:27:40,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 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:27:40,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:40,800 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:40,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:27:40,801 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:40,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:40,801 INFO L85 PathProgramCache]: Analyzing trace with hash 66461605, now seen corresponding path program 1 times [2023-11-29 05:27:40,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:40,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696422634] [2023-11-29 05:27:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:40,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:41,248 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:27:41,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696422634] [2023-11-29 05:27:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696422634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:41,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:41,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:27:41,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966525489] [2023-11-29 05:27:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:41,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:27:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:41,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:27:41,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:27:41,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 131 [2023-11-29 05:27:41,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 103 transitions, 299 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 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:27:41,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:41,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 131 [2023-11-29 05:27:41,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:42,101 INFO L124 PetriNetUnfolderBase]: 84/372 cut-off events. [2023-11-29 05:27:42,101 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-11-29 05:27:42,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 372 events. 84/372 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1683 event pairs, 54 based on Foata normal form. 1/302 useless extension candidates. Maximal degree in co-relation 675. Up to 139 conditions per place. [2023-11-29 05:27:42,105 INFO L140 encePairwiseOnDemand]: 113/131 looper letters, 60 selfloop transitions, 16 changer transitions 0/122 dead transitions. [2023-11-29 05:27:42,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 122 transitions, 498 flow [2023-11-29 05:27:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:27:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:27:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2023-11-29 05:27:42,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6859323882224646 [2023-11-29 05:27:42,108 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2023-11-29 05:27:42,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2023-11-29 05:27:42,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:42,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2023-11-29 05:27:42,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 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:27:42,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 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:27:42,114 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 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:27:42,115 INFO L175 Difference]: Start difference. First operand has 123 places, 103 transitions, 299 flow. Second operand 7 states and 629 transitions. [2023-11-29 05:27:42,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 122 transitions, 498 flow [2023-11-29 05:27:42,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 476 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:27:42,120 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 318 flow [2023-11-29 05:27:42,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2023-11-29 05:27:42,121 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -10 predicate places. [2023-11-29 05:27:42,121 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 318 flow [2023-11-29 05:27:42,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 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:27:42,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:42,121 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:27:42,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:27:42,122 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:42,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash -669831975, now seen corresponding path program 1 times [2023-11-29 05:27:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477180795] [2023-11-29 05:27:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:42,795 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:27:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:42,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477180795] [2023-11-29 05:27:42,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477180795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:42,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:42,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:27:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818749194] [2023-11-29 05:27:42,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:42,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:27:42,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:42,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:27:42,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:27:43,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 131 [2023-11-29 05:27:43,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:43,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:43,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 131 [2023-11-29 05:27:43,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:43,452 INFO L124 PetriNetUnfolderBase]: 73/331 cut-off events. [2023-11-29 05:27:43,452 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2023-11-29 05:27:43,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 331 events. 73/331 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1431 event pairs, 52 based on Foata normal form. 2/276 useless extension candidates. Maximal degree in co-relation 647. Up to 142 conditions per place. [2023-11-29 05:27:43,454 INFO L140 encePairwiseOnDemand]: 113/131 looper letters, 46 selfloop transitions, 16 changer transitions 3/107 dead transitions. [2023-11-29 05:27:43,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 107 transitions, 465 flow [2023-11-29 05:27:43,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:27:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:27:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 572 transitions. [2023-11-29 05:27:43,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.623773173391494 [2023-11-29 05:27:43,458 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 572 transitions. [2023-11-29 05:27:43,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 572 transitions. [2023-11-29 05:27:43,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:43,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 572 transitions. [2023-11-29 05:27:43,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.71428571428571) internal successors, (572), 7 states have internal predecessors, (572), 0 states have call successors, (0), 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:27:43,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 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:27:43,464 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 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:27:43,464 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 318 flow. Second operand 7 states and 572 transitions. [2023-11-29 05:27:43,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 107 transitions, 465 flow [2023-11-29 05:27:43,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 107 transitions, 435 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:27:43,468 INFO L231 Difference]: Finished difference. Result has 120 places, 98 transitions, 312 flow [2023-11-29 05:27:43,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=120, PETRI_TRANSITIONS=98} [2023-11-29 05:27:43,469 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -13 predicate places. [2023-11-29 05:27:43,469 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 98 transitions, 312 flow [2023-11-29 05:27:43,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:43,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:43,470 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:27:43,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:27:43,470 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:43,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:43,470 INFO L85 PathProgramCache]: Analyzing trace with hash -669831976, now seen corresponding path program 1 times [2023-11-29 05:27:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:43,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995442178] [2023-11-29 05:27:43,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:43,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:43,776 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:27:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995442178] [2023-11-29 05:27:43,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995442178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:43,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:43,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:27:43,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036463493] [2023-11-29 05:27:43,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:43,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:27:43,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:43,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:27:43,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:27:44,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 131 [2023-11-29 05:27:44,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 98 transitions, 312 flow. Second operand has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 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:27:44,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:44,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 131 [2023-11-29 05:27:44,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:44,548 INFO L124 PetriNetUnfolderBase]: 73/336 cut-off events. [2023-11-29 05:27:44,548 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-29 05:27:44,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 336 events. 73/336 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1468 event pairs, 45 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 659. Up to 111 conditions per place. [2023-11-29 05:27:44,550 INFO L140 encePairwiseOnDemand]: 112/131 looper letters, 55 selfloop transitions, 17 changer transitions 0/104 dead transitions. [2023-11-29 05:27:44,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 104 transitions, 470 flow [2023-11-29 05:27:44,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:27:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:27:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 580 transitions. [2023-11-29 05:27:44,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5534351145038168 [2023-11-29 05:27:44,554 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 580 transitions. [2023-11-29 05:27:44,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 580 transitions. [2023-11-29 05:27:44,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:44,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 580 transitions. [2023-11-29 05:27:44,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 72.5) internal successors, (580), 8 states have internal predecessors, (580), 0 states have call successors, (0), 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:27:44,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 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:27:44,560 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 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:27:44,560 INFO L175 Difference]: Start difference. First operand has 120 places, 98 transitions, 312 flow. Second operand 8 states and 580 transitions. [2023-11-29 05:27:44,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 104 transitions, 470 flow [2023-11-29 05:27:44,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 104 transitions, 438 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 05:27:44,565 INFO L231 Difference]: Finished difference. Result has 119 places, 96 transitions, 310 flow [2023-11-29 05:27:44,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=310, PETRI_PLACES=119, PETRI_TRANSITIONS=96} [2023-11-29 05:27:44,566 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -14 predicate places. [2023-11-29 05:27:44,566 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 96 transitions, 310 flow [2023-11-29 05:27:44,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 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:27:44,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:44,567 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:27:44,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:27:44,567 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:44,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash 536587469, now seen corresponding path program 1 times [2023-11-29 05:27:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041048789] [2023-11-29 05:27:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:44,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:44,708 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:27:44,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:44,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041048789] [2023-11-29 05:27:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041048789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:44,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:44,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:27:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830875697] [2023-11-29 05:27:44,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:44,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:27:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:44,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:27:44,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:27:45,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 131 [2023-11-29 05:27:45,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 96 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 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:27:45,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:45,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 131 [2023-11-29 05:27:45,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:45,198 INFO L124 PetriNetUnfolderBase]: 73/333 cut-off events. [2023-11-29 05:27:45,198 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2023-11-29 05:27:45,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 333 events. 73/333 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1459 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:27:45,201 INFO L140 encePairwiseOnDemand]: 119/131 looper letters, 50 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2023-11-29 05:27:45,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 95 transitions, 430 flow [2023-11-29 05:27:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:27:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:27:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-11-29 05:27:45,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6290076335877862 [2023-11-29 05:27:45,203 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-11-29 05:27:45,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-11-29 05:27:45,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:45,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-11-29 05:27:45,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 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:27:45,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:45,207 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:45,207 INFO L175 Difference]: Start difference. First operand has 119 places, 96 transitions, 310 flow. Second operand 5 states and 412 transitions. [2023-11-29 05:27:45,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 95 transitions, 430 flow [2023-11-29 05:27:45,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 95 transitions, 396 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 05:27:45,211 INFO L231 Difference]: Finished difference. Result has 115 places, 95 transitions, 296 flow [2023-11-29 05:27:45,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=115, PETRI_TRANSITIONS=95} [2023-11-29 05:27:45,212 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -18 predicate places. [2023-11-29 05:27:45,212 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 95 transitions, 296 flow [2023-11-29 05:27:45,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 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:27:45,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:45,213 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:27:45,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:27:45,213 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:45,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash 536587470, now seen corresponding path program 1 times [2023-11-29 05:27:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334148952] [2023-11-29 05:27:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:45,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:45,463 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:27:45,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:45,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334148952] [2023-11-29 05:27:45,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334148952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:45,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:45,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:27:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607354941] [2023-11-29 05:27:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:45,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:27:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:27:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:27:45,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 131 [2023-11-29 05:27:45,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 95 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:45,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:45,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 131 [2023-11-29 05:27:45,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:46,053 INFO L124 PetriNetUnfolderBase]: 73/332 cut-off events. [2023-11-29 05:27:46,053 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2023-11-29 05:27:46,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 332 events. 73/332 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1461 event pairs, 60 based on Foata normal form. 1/273 useless extension candidates. Maximal degree in co-relation 623. Up to 196 conditions per place. [2023-11-29 05:27:46,055 INFO L140 encePairwiseOnDemand]: 119/131 looper letters, 45 selfloop transitions, 11 changer transitions 0/94 dead transitions. [2023-11-29 05:27:46,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 94 transitions, 406 flow [2023-11-29 05:27:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:27:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:27:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 432 transitions. [2023-11-29 05:27:46,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6595419847328244 [2023-11-29 05:27:46,058 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 432 transitions. [2023-11-29 05:27:46,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 432 transitions. [2023-11-29 05:27:46,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:46,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 432 transitions. [2023-11-29 05:27:46,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 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:27:46,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:46,062 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:46,062 INFO L175 Difference]: Start difference. First operand has 115 places, 95 transitions, 296 flow. Second operand 5 states and 432 transitions. [2023-11-29 05:27:46,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 94 transitions, 406 flow [2023-11-29 05:27:46,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 94 transitions, 384 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:27:46,079 INFO L231 Difference]: Finished difference. Result has 114 places, 94 transitions, 294 flow [2023-11-29 05:27:46,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=114, PETRI_TRANSITIONS=94} [2023-11-29 05:27:46,081 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -19 predicate places. [2023-11-29 05:27:46,081 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 94 transitions, 294 flow [2023-11-29 05:27:46,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:46,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:46,081 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:27:46,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:27:46,081 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:46,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash 784401102, now seen corresponding path program 1 times [2023-11-29 05:27:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:46,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125542923] [2023-11-29 05:27:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:47,803 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:27:47,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:47,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125542923] [2023-11-29 05:27:47,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125542923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:47,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:47,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 05:27:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966808227] [2023-11-29 05:27:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:47,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:27:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:47,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:27:47,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:27:49,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 131 [2023-11-29 05:27:49,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 94 transitions, 294 flow. Second operand has 14 states, 14 states have (on average 48.785714285714285) internal successors, (683), 14 states have internal predecessors, (683), 0 states have call successors, (0), 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:27:49,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:49,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 131 [2023-11-29 05:27:49,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:50,649 INFO L124 PetriNetUnfolderBase]: 73/332 cut-off events. [2023-11-29 05:27:50,649 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-11-29 05:27:50,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 332 events. 73/332 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1462 event pairs, 45 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 631. Up to 115 conditions per place. [2023-11-29 05:27:50,652 INFO L140 encePairwiseOnDemand]: 111/131 looper letters, 57 selfloop transitions, 20 changer transitions 3/108 dead transitions. [2023-11-29 05:27:50,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 108 transitions, 489 flow [2023-11-29 05:27:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:27:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-29 05:27:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 774 transitions. [2023-11-29 05:27:50,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3938931297709924 [2023-11-29 05:27:50,656 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 774 transitions. [2023-11-29 05:27:50,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 774 transitions. [2023-11-29 05:27:50,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:50,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 774 transitions. [2023-11-29 05:27:50,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 51.6) internal successors, (774), 15 states have internal predecessors, (774), 0 states have call successors, (0), 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:27:50,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 131.0) internal successors, (2096), 16 states have internal predecessors, (2096), 0 states have call successors, (0), 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:27:50,663 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 131.0) internal successors, (2096), 16 states have internal predecessors, (2096), 0 states have call successors, (0), 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:27:50,663 INFO L175 Difference]: Start difference. First operand has 114 places, 94 transitions, 294 flow. Second operand 15 states and 774 transitions. [2023-11-29 05:27:50,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 108 transitions, 489 flow [2023-11-29 05:27:50,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 108 transitions, 467 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:27:50,666 INFO L231 Difference]: Finished difference. Result has 122 places, 92 transitions, 308 flow [2023-11-29 05:27:50,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=308, PETRI_PLACES=122, PETRI_TRANSITIONS=92} [2023-11-29 05:27:50,667 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -11 predicate places. [2023-11-29 05:27:50,667 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 92 transitions, 308 flow [2023-11-29 05:27:50,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 48.785714285714285) internal successors, (683), 14 states have internal predecessors, (683), 0 states have call successors, (0), 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:27:50,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:50,668 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:27:50,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:27:50,668 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:50,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash 784401101, now seen corresponding path program 1 times [2023-11-29 05:27:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:50,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708201595] [2023-11-29 05:27:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:51,546 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:27:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:51,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708201595] [2023-11-29 05:27:51,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708201595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:51,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:51,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:27:51,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058749589] [2023-11-29 05:27:51,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:51,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:27:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:51,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:27:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:27:52,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 131 [2023-11-29 05:27:52,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 92 transitions, 308 flow. Second operand has 10 states, 10 states have (on average 77.5) internal successors, (775), 10 states have internal predecessors, (775), 0 states have call successors, (0), 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:27:52,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:52,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 131 [2023-11-29 05:27:52,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:52,598 INFO L124 PetriNetUnfolderBase]: 73/331 cut-off events. [2023-11-29 05:27:52,598 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2023-11-29 05:27:52,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 331 events. 73/331 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1458 event pairs, 45 based on Foata normal form. 1/274 useless extension candidates. Maximal degree in co-relation 664. Up to 114 conditions per place. [2023-11-29 05:27:52,601 INFO L140 encePairwiseOnDemand]: 118/131 looper letters, 59 selfloop transitions, 12 changer transitions 0/99 dead transitions. [2023-11-29 05:27:52,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 99 transitions, 464 flow [2023-11-29 05:27:52,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:27:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:27:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 658 transitions. [2023-11-29 05:27:52,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6278625954198473 [2023-11-29 05:27:52,604 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 658 transitions. [2023-11-29 05:27:52,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 658 transitions. [2023-11-29 05:27:52,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:52,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 658 transitions. [2023-11-29 05:27:52,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 82.25) internal successors, (658), 8 states have internal predecessors, (658), 0 states have call successors, (0), 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:27:52,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 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:27:52,608 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 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:27:52,608 INFO L175 Difference]: Start difference. First operand has 122 places, 92 transitions, 308 flow. Second operand 8 states and 658 transitions. [2023-11-29 05:27:52,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 99 transitions, 464 flow [2023-11-29 05:27:52,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 99 transitions, 426 flow, removed 0 selfloop flow, removed 13 redundant places. [2023-11-29 05:27:52,612 INFO L231 Difference]: Finished difference. Result has 114 places, 91 transitions, 290 flow [2023-11-29 05:27:52,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=290, PETRI_PLACES=114, PETRI_TRANSITIONS=91} [2023-11-29 05:27:52,612 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -19 predicate places. [2023-11-29 05:27:52,612 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 91 transitions, 290 flow [2023-11-29 05:27:52,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.5) internal successors, (775), 10 states have internal predecessors, (775), 0 states have call successors, (0), 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:27:52,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:52,613 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:27:52,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:27:52,613 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:52,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2104762954, now seen corresponding path program 1 times [2023-11-29 05:27:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293953783] [2023-11-29 05:27:52,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:52,794 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:27:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:52,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293953783] [2023-11-29 05:27:52,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293953783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:52,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:52,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:27:52,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6459791] [2023-11-29 05:27:52,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:52,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:27:52,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:52,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:27:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:27:52,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 131 [2023-11-29 05:27:52,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 91 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 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:27:52,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:52,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 131 [2023-11-29 05:27:52,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:53,150 INFO L124 PetriNetUnfolderBase]: 82/347 cut-off events. [2023-11-29 05:27:53,150 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2023-11-29 05:27:53,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 347 events. 82/347 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1566 event pairs, 36 based on Foata normal form. 2/289 useless extension candidates. Maximal degree in co-relation 672. Up to 123 conditions per place. [2023-11-29 05:27:53,154 INFO L140 encePairwiseOnDemand]: 112/131 looper letters, 52 selfloop transitions, 17 changer transitions 0/98 dead transitions. [2023-11-29 05:27:53,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 446 flow [2023-11-29 05:27:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:27:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:27:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 416 transitions. [2023-11-29 05:27:53,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6351145038167939 [2023-11-29 05:27:53,156 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 416 transitions. [2023-11-29 05:27:53,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 416 transitions. [2023-11-29 05:27:53,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:53,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 416 transitions. [2023-11-29 05:27:53,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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:27:53,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:53,160 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:53,160 INFO L175 Difference]: Start difference. First operand has 114 places, 91 transitions, 290 flow. Second operand 5 states and 416 transitions. [2023-11-29 05:27:53,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 446 flow [2023-11-29 05:27:53,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 98 transitions, 422 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 05:27:53,164 INFO L231 Difference]: Finished difference. Result has 109 places, 89 transitions, 296 flow [2023-11-29 05:27:53,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=109, PETRI_TRANSITIONS=89} [2023-11-29 05:27:53,165 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -24 predicate places. [2023-11-29 05:27:53,165 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 89 transitions, 296 flow [2023-11-29 05:27:53,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 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:27:53,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:53,166 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:27:53,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:27:53,166 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:53,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:53,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2104762953, now seen corresponding path program 1 times [2023-11-29 05:27:53,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:53,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438547967] [2023-11-29 05:27:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:53,508 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:27:53,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:53,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438547967] [2023-11-29 05:27:53,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438547967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:53,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:53,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:27:53,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026706525] [2023-11-29 05:27:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:53,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:27:53,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:53,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:27:53,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:27:53,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 131 [2023-11-29 05:27:53,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 89 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:53,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:53,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 131 [2023-11-29 05:27:53,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:54,005 INFO L124 PetriNetUnfolderBase]: 82/332 cut-off events. [2023-11-29 05:27:54,006 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-11-29 05:27:54,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 332 events. 82/332 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1447 event pairs, 18 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 675. Up to 161 conditions per place. [2023-11-29 05:27:54,009 INFO L140 encePairwiseOnDemand]: 114/131 looper letters, 49 selfloop transitions, 15 changer transitions 0/96 dead transitions. [2023-11-29 05:27:54,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 96 transitions, 442 flow [2023-11-29 05:27:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:27:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:27:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 436 transitions. [2023-11-29 05:27:54,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.665648854961832 [2023-11-29 05:27:54,011 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 436 transitions. [2023-11-29 05:27:54,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 436 transitions. [2023-11-29 05:27:54,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:54,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 436 transitions. [2023-11-29 05:27:54,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 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:27:54,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:54,014 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:54,014 INFO L175 Difference]: Start difference. First operand has 109 places, 89 transitions, 296 flow. Second operand 5 states and 436 transitions. [2023-11-29 05:27:54,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 96 transitions, 442 flow [2023-11-29 05:27:54,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 96 transitions, 408 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:27:54,019 INFO L231 Difference]: Finished difference. Result has 107 places, 87 transitions, 288 flow [2023-11-29 05:27:54,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=107, PETRI_TRANSITIONS=87} [2023-11-29 05:27:54,020 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -26 predicate places. [2023-11-29 05:27:54,020 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 87 transitions, 288 flow [2023-11-29 05:27:54,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:54,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:54,021 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] [2023-11-29 05:27:54,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:27:54,021 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:54,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash -693714554, now seen corresponding path program 1 times [2023-11-29 05:27:54,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:54,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274698196] [2023-11-29 05:27:54,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:54,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:54,878 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:27:54,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:54,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274698196] [2023-11-29 05:27:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274698196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:27:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276329250] [2023-11-29 05:27:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:54,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:27:54,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:54,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:27:54,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:27:55,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 131 [2023-11-29 05:27:55,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 87 transitions, 288 flow. Second operand has 12 states, 12 states have (on average 73.66666666666667) internal successors, (884), 12 states have internal predecessors, (884), 0 states have call successors, (0), 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:27:55,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:55,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 131 [2023-11-29 05:27:55,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:55,991 INFO L124 PetriNetUnfolderBase]: 73/326 cut-off events. [2023-11-29 05:27:55,991 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-11-29 05:27:55,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 326 events. 73/326 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1459 event pairs, 45 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 638. Up to 125 conditions per place. [2023-11-29 05:27:55,993 INFO L140 encePairwiseOnDemand]: 119/131 looper letters, 61 selfloop transitions, 11 changer transitions 0/94 dead transitions. [2023-11-29 05:27:55,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 94 transitions, 448 flow [2023-11-29 05:27:55,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:27:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:27:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2023-11-29 05:27:55,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545801526717557 [2023-11-29 05:27:55,995 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 343 transitions. [2023-11-29 05:27:55,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 343 transitions. [2023-11-29 05:27:55,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:55,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 343 transitions. [2023-11-29 05:27:55,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 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:27:55,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 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:27:55,999 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 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:27:55,999 INFO L175 Difference]: Start difference. First operand has 107 places, 87 transitions, 288 flow. Second operand 4 states and 343 transitions. [2023-11-29 05:27:55,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 94 transitions, 448 flow [2023-11-29 05:27:56,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 94 transitions, 418 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:27:56,003 INFO L231 Difference]: Finished difference. Result has 105 places, 86 transitions, 278 flow [2023-11-29 05:27:56,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=105, PETRI_TRANSITIONS=86} [2023-11-29 05:27:56,004 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -28 predicate places. [2023-11-29 05:27:56,004 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 86 transitions, 278 flow [2023-11-29 05:27:56,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 73.66666666666667) internal successors, (884), 12 states have internal predecessors, (884), 0 states have call successors, (0), 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:27:56,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:56,005 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] [2023-11-29 05:27:56,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:27:56,005 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:56,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash -693714553, now seen corresponding path program 1 times [2023-11-29 05:27:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:56,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361051647] [2023-11-29 05:27:56,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:56,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:56,608 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:27:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361051647] [2023-11-29 05:27:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361051647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:27:56,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207360198] [2023-11-29 05:27:56,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:56,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:27:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:56,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:27:56,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:27:56,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 131 [2023-11-29 05:27:56,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 86 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 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:27:56,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:56,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 131 [2023-11-29 05:27:56,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:57,159 INFO L124 PetriNetUnfolderBase]: 73/325 cut-off events. [2023-11-29 05:27:57,159 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 05:27:57,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 325 events. 73/325 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1451 event pairs, 45 based on Foata normal form. 1/272 useless extension candidates. Maximal degree in co-relation 627. Up to 116 conditions per place. [2023-11-29 05:27:57,162 INFO L140 encePairwiseOnDemand]: 113/131 looper letters, 49 selfloop transitions, 17 changer transitions 0/93 dead transitions. [2023-11-29 05:27:57,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 93 transitions, 426 flow [2023-11-29 05:27:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:27:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:27:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2023-11-29 05:27:57,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.683969465648855 [2023-11-29 05:27:57,165 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 448 transitions. [2023-11-29 05:27:57,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 448 transitions. [2023-11-29 05:27:57,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:57,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 448 transitions. [2023-11-29 05:27:57,167 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:27:57,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:57,169 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 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:27:57,169 INFO L175 Difference]: Start difference. First operand has 105 places, 86 transitions, 278 flow. Second operand 5 states and 448 transitions. [2023-11-29 05:27:57,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 93 transitions, 426 flow [2023-11-29 05:27:57,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 93 transitions, 404 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:27:57,174 INFO L231 Difference]: Finished difference. Result has 105 places, 85 transitions, 288 flow [2023-11-29 05:27:57,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=105, PETRI_TRANSITIONS=85} [2023-11-29 05:27:57,175 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -28 predicate places. [2023-11-29 05:27:57,175 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 85 transitions, 288 flow [2023-11-29 05:27:57,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 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:27:57,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:57,176 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] [2023-11-29 05:27:57,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:27:57,176 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:57,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1007675416, now seen corresponding path program 1 times [2023-11-29 05:27:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:57,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64668116] [2023-11-29 05:27:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:57,335 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:27:57,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:57,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64668116] [2023-11-29 05:27:57,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64668116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:57,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:57,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:57,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756665368] [2023-11-29 05:27:57,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:57,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:57,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 131 [2023-11-29 05:27:57,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 85 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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:27:57,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:57,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 131 [2023-11-29 05:27:57,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:57,570 INFO L124 PetriNetUnfolderBase]: 84/343 cut-off events. [2023-11-29 05:27:57,570 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2023-11-29 05:27:57,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 343 events. 84/343 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1543 event pairs, 55 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 687. Up to 198 conditions per place. [2023-11-29 05:27:57,573 INFO L140 encePairwiseOnDemand]: 125/131 looper letters, 62 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-11-29 05:27:57,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 95 transitions, 455 flow [2023-11-29 05:27:57,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-11-29 05:27:57,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8142493638676844 [2023-11-29 05:27:57,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-11-29 05:27:57,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-11-29 05:27:57,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:57,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-11-29 05:27:57,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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:27:57,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:27:57,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:27:57,576 INFO L175 Difference]: Start difference. First operand has 105 places, 85 transitions, 288 flow. Second operand 3 states and 320 transitions. [2023-11-29 05:27:57,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 95 transitions, 455 flow [2023-11-29 05:27:57,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 95 transitions, 419 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:27:57,581 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 296 flow [2023-11-29 05:27:57,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, 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:27:57,582 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -28 predicate places. [2023-11-29 05:27:57,582 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 296 flow [2023-11-29 05:27:57,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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:27:57,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:57,583 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] [2023-11-29 05:27:57,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:27:57,583 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:57,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:57,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1007675415, now seen corresponding path program 1 times [2023-11-29 05:27:57,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:57,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251993344] [2023-11-29 05:27:57,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:57,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:57,836 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:27:57,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:57,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251993344] [2023-11-29 05:27:57,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251993344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:57,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:57,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:57,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847749653] [2023-11-29 05:27:57,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:57,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:57,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:57,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:57,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:57,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 131 [2023-11-29 05:27:57,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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:27:57,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:57,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 131 [2023-11-29 05:27:57,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:58,081 INFO L124 PetriNetUnfolderBase]: 75/315 cut-off events. [2023-11-29 05:27:58,081 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2023-11-29 05:27:58,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 315 events. 75/315 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1354 event pairs, 53 based on Foata normal form. 21/297 useless extension candidates. Maximal degree in co-relation 666. Up to 189 conditions per place. [2023-11-29 05:27:58,084 INFO L140 encePairwiseOnDemand]: 127/131 looper letters, 59 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2023-11-29 05:27:58,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 437 flow [2023-11-29 05:27:58,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-11-29 05:27:58,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8091603053435115 [2023-11-29 05:27:58,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-11-29 05:27:58,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-11-29 05:27:58,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:58,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-11-29 05:27:58,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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:27:58,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:27:58,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:27:58,087 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 296 flow. Second operand 3 states and 318 transitions. [2023-11-29 05:27:58,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 93 transitions, 437 flow [2023-11-29 05:27:58,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 93 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:58,092 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 290 flow [2023-11-29 05:27:58,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2023-11-29 05:27:58,093 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -30 predicate places. [2023-11-29 05:27:58,093 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 290 flow [2023-11-29 05:27:58,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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:27:58,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:58,093 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] [2023-11-29 05:27:58,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:27:58,094 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:58,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1292074789, now seen corresponding path program 1 times [2023-11-29 05:27:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:58,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373964029] [2023-11-29 05:27:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:58,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:58,460 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:27:58,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:58,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373964029] [2023-11-29 05:27:58,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373964029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:58,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:58,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:27:58,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501579450] [2023-11-29 05:27:58,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:58,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:27:58,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:58,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:27:58,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:27:58,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 131 [2023-11-29 05:27:58,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 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:27:58,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:58,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 131 [2023-11-29 05:27:58,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:59,157 INFO L124 PetriNetUnfolderBase]: 90/363 cut-off events. [2023-11-29 05:27:59,158 INFO L125 PetriNetUnfolderBase]: For 205/209 co-relation queries the response was YES. [2023-11-29 05:27:59,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 363 events. 90/363 cut-off events. For 205/209 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1695 event pairs, 32 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 758. Up to 194 conditions per place. [2023-11-29 05:27:59,161 INFO L140 encePairwiseOnDemand]: 120/131 looper letters, 64 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2023-11-29 05:27:59,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 100 transitions, 493 flow [2023-11-29 05:27:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:27:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:27:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2023-11-29 05:27:59,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6717557251908397 [2023-11-29 05:27:59,163 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 528 transitions. [2023-11-29 05:27:59,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 528 transitions. [2023-11-29 05:27:59,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:59,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 528 transitions. [2023-11-29 05:27:59,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 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:27:59,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 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:27:59,165 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 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:27:59,165 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 290 flow. Second operand 6 states and 528 transitions. [2023-11-29 05:27:59,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 100 transitions, 493 flow [2023-11-29 05:27:59,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:59,169 INFO L231 Difference]: Finished difference. Result has 108 places, 91 transitions, 346 flow [2023-11-29 05:27:59,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=346, PETRI_PLACES=108, PETRI_TRANSITIONS=91} [2023-11-29 05:27:59,169 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -25 predicate places. [2023-11-29 05:27:59,170 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 91 transitions, 346 flow [2023-11-29 05:27:59,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 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:27:59,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:59,170 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] [2023-11-29 05:27:59,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 05:27:59,170 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:59,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:59,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1292074790, now seen corresponding path program 1 times [2023-11-29 05:27:59,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:59,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766703056] [2023-11-29 05:27:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:59,339 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:27:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:59,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766703056] [2023-11-29 05:27:59,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766703056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:59,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:59,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:27:59,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210369429] [2023-11-29 05:27:59,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:59,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:27:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:59,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:27:59,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:27:59,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 131 [2023-11-29 05:27:59,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 91 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 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:27:59,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:59,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 131 [2023-11-29 05:27:59,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:59,834 INFO L124 PetriNetUnfolderBase]: 84/332 cut-off events. [2023-11-29 05:27:59,835 INFO L125 PetriNetUnfolderBase]: For 189/196 co-relation queries the response was YES. [2023-11-29 05:27:59,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 332 events. 84/332 cut-off events. For 189/196 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1428 event pairs, 38 based on Foata normal form. 11/306 useless extension candidates. Maximal degree in co-relation 757. Up to 112 conditions per place. [2023-11-29 05:27:59,837 INFO L140 encePairwiseOnDemand]: 120/131 looper letters, 68 selfloop transitions, 13 changer transitions 0/105 dead transitions. [2023-11-29 05:27:59,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 105 transitions, 542 flow [2023-11-29 05:27:59,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:27:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:27:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2023-11-29 05:27:59,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6755725190839694 [2023-11-29 05:27:59,839 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 531 transitions. [2023-11-29 05:27:59,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 531 transitions. [2023-11-29 05:27:59,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:59,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 531 transitions. [2023-11-29 05:27:59,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 0 states have call successors, (0), 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:27:59,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 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:27:59,843 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 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:27:59,843 INFO L175 Difference]: Start difference. First operand has 108 places, 91 transitions, 346 flow. Second operand 6 states and 531 transitions. [2023-11-29 05:27:59,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 105 transitions, 542 flow [2023-11-29 05:27:59,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 105 transitions, 532 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:59,849 INFO L231 Difference]: Finished difference. Result has 110 places, 90 transitions, 360 flow [2023-11-29 05:27:59,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=110, PETRI_TRANSITIONS=90} [2023-11-29 05:27:59,850 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -23 predicate places. [2023-11-29 05:27:59,850 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 90 transitions, 360 flow [2023-11-29 05:27:59,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 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:27:59,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:59,850 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:27:59,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 05:27:59,851 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:27:59,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2008411799, now seen corresponding path program 1 times [2023-11-29 05:27:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:59,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920639260] [2023-11-29 05:27:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:59,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:00,952 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:28:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:00,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920639260] [2023-11-29 05:28:00,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920639260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:00,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:00,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:28:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271550291] [2023-11-29 05:28:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:00,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:28:00,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:28:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:28:01,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 131 [2023-11-29 05:28:01,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 90 transitions, 360 flow. Second operand has 8 states, 8 states have (on average 84.625) internal successors, (677), 8 states have internal predecessors, (677), 0 states have call successors, (0), 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:28:01,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:01,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 131 [2023-11-29 05:28:01,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:01,846 INFO L124 PetriNetUnfolderBase]: 84/325 cut-off events. [2023-11-29 05:28:01,846 INFO L125 PetriNetUnfolderBase]: For 271/280 co-relation queries the response was YES. [2023-11-29 05:28:01,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 325 events. 84/325 cut-off events. For 271/280 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1395 event pairs, 24 based on Foata normal form. 14/298 useless extension candidates. Maximal degree in co-relation 772. Up to 117 conditions per place. [2023-11-29 05:28:01,848 INFO L140 encePairwiseOnDemand]: 125/131 looper letters, 70 selfloop transitions, 7 changer transitions 0/103 dead transitions. [2023-11-29 05:28:01,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 103 transitions, 568 flow [2023-11-29 05:28:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:28:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:28:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2023-11-29 05:28:01,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6946564885496184 [2023-11-29 05:28:01,850 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 546 transitions. [2023-11-29 05:28:01,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 546 transitions. [2023-11-29 05:28:01,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:01,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 546 transitions. [2023-11-29 05:28:01,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 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:28:01,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 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:28:01,852 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 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:28:01,852 INFO L175 Difference]: Start difference. First operand has 110 places, 90 transitions, 360 flow. Second operand 6 states and 546 transitions. [2023-11-29 05:28:01,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 103 transitions, 568 flow [2023-11-29 05:28:01,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 103 transitions, 532 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 05:28:01,855 INFO L231 Difference]: Finished difference. Result has 107 places, 90 transitions, 350 flow [2023-11-29 05:28:01,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=107, PETRI_TRANSITIONS=90} [2023-11-29 05:28:01,856 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -26 predicate places. [2023-11-29 05:28:01,856 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 90 transitions, 350 flow [2023-11-29 05:28:01,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.625) internal successors, (677), 8 states have internal predecessors, (677), 0 states have call successors, (0), 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:28:01,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:01,856 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:28:01,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 05:28:01,857 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:28:01,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1399612102, now seen corresponding path program 1 times [2023-11-29 05:28:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:01,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295990599] [2023-11-29 05:28:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:05,390 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:28:05,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295990599] [2023-11-29 05:28:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295990599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:05,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:05,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-11-29 05:28:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773127312] [2023-11-29 05:28:05,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:05,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 05:28:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 05:28:05,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2023-11-29 05:28:11,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 131 [2023-11-29 05:28:11,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 90 transitions, 350 flow. Second operand has 24 states, 24 states have (on average 58.541666666666664) internal successors, (1405), 24 states have internal predecessors, (1405), 0 states have call successors, (0), 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:28:11,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:11,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 131 [2023-11-29 05:28:11,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:13,070 INFO L124 PetriNetUnfolderBase]: 142/467 cut-off events. [2023-11-29 05:28:13,070 INFO L125 PetriNetUnfolderBase]: For 381/388 co-relation queries the response was YES. [2023-11-29 05:28:13,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 467 events. 142/467 cut-off events. For 381/388 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2277 event pairs, 13 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 1119. Up to 61 conditions per place. [2023-11-29 05:28:13,073 INFO L140 encePairwiseOnDemand]: 105/131 looper letters, 93 selfloop transitions, 45 changer transitions 3/154 dead transitions. [2023-11-29 05:28:13,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 154 transitions, 864 flow [2023-11-29 05:28:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 05:28:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-29 05:28:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1599 transitions. [2023-11-29 05:28:13,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46946564885496184 [2023-11-29 05:28:13,076 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1599 transitions. [2023-11-29 05:28:13,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1599 transitions. [2023-11-29 05:28:13,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:13,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1599 transitions. [2023-11-29 05:28:13,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 61.5) internal successors, (1599), 26 states have internal predecessors, (1599), 0 states have call successors, (0), 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:28:13,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 131.0) internal successors, (3537), 27 states have internal predecessors, (3537), 0 states have call successors, (0), 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:28:13,083 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 131.0) internal successors, (3537), 27 states have internal predecessors, (3537), 0 states have call successors, (0), 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:28:13,083 INFO L175 Difference]: Start difference. First operand has 107 places, 90 transitions, 350 flow. Second operand 26 states and 1599 transitions. [2023-11-29 05:28:13,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 154 transitions, 864 flow [2023-11-29 05:28:13,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 154 transitions, 861 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 05:28:13,088 INFO L231 Difference]: Finished difference. Result has 135 places, 105 transitions, 564 flow [2023-11-29 05:28:13,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=564, PETRI_PLACES=135, PETRI_TRANSITIONS=105} [2023-11-29 05:28:13,089 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 2 predicate places. [2023-11-29 05:28:13,089 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 105 transitions, 564 flow [2023-11-29 05:28:13,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 58.541666666666664) internal successors, (1405), 24 states have internal predecessors, (1405), 0 states have call successors, (0), 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:28:13,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:13,090 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:28:13,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 05:28:13,090 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:28:13,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1399612103, now seen corresponding path program 1 times [2023-11-29 05:28:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649216275] [2023-11-29 05:28:13,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:28:15,774 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:28:15,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:28:15,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649216275] [2023-11-29 05:28:15,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649216275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:28:15,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:28:15,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2023-11-29 05:28:15,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839761072] [2023-11-29 05:28:15,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:28:15,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:28:15,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:28:15,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:28:15,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:28:22,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 131 [2023-11-29 05:28:22,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 105 transitions, 564 flow. Second operand has 26 states, 26 states have (on average 66.42307692307692) internal successors, (1727), 26 states have internal predecessors, (1727), 0 states have call successors, (0), 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:28:22,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:28:22,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 131 [2023-11-29 05:28:22,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:28:23,878 INFO L124 PetriNetUnfolderBase]: 142/463 cut-off events. [2023-11-29 05:28:23,879 INFO L125 PetriNetUnfolderBase]: For 609/616 co-relation queries the response was YES. [2023-11-29 05:28:23,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 463 events. 142/463 cut-off events. For 609/616 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2239 event pairs, 13 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 1276. Up to 70 conditions per place. [2023-11-29 05:28:23,882 INFO L140 encePairwiseOnDemand]: 104/131 looper letters, 86 selfloop transitions, 44 changer transitions 3/146 dead transitions. [2023-11-29 05:28:23,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 146 transitions, 944 flow [2023-11-29 05:28:23,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:28:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-29 05:28:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1666 transitions. [2023-11-29 05:28:23,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5298982188295165 [2023-11-29 05:28:23,884 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1666 transitions. [2023-11-29 05:28:23,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1666 transitions. [2023-11-29 05:28:23,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:28:23,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1666 transitions. [2023-11-29 05:28:23,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 69.41666666666667) internal successors, (1666), 24 states have internal predecessors, (1666), 0 states have call successors, (0), 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:28:23,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 131.0) internal successors, (3275), 25 states have internal predecessors, (3275), 0 states have call successors, (0), 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:28:23,892 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 131.0) internal successors, (3275), 25 states have internal predecessors, (3275), 0 states have call successors, (0), 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:28:23,892 INFO L175 Difference]: Start difference. First operand has 135 places, 105 transitions, 564 flow. Second operand 24 states and 1666 transitions. [2023-11-29 05:28:23,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 146 transitions, 944 flow [2023-11-29 05:28:23,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 146 transitions, 910 flow, removed 2 selfloop flow, removed 15 redundant places. [2023-11-29 05:28:23,898 INFO L231 Difference]: Finished difference. Result has 146 places, 106 transitions, 640 flow [2023-11-29 05:28:23,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=640, PETRI_PLACES=146, PETRI_TRANSITIONS=106} [2023-11-29 05:28:23,899 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 13 predicate places. [2023-11-29 05:28:23,899 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 106 transitions, 640 flow [2023-11-29 05:28:23,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 66.42307692307692) internal successors, (1727), 26 states have internal predecessors, (1727), 0 states have call successors, (0), 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:28:23,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:28:23,900 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:28:23,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 05:28:23,900 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-11-29 05:28:23,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2131222891, now seen corresponding path program 1 times [2023-11-29 05:28:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:28:23,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507854233] [2023-11-29 05:28:23,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:28:23,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:28:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:28:24,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:28:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:28:24,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:28:24,126 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:28:24,126 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 90 remaining) [2023-11-29 05:28:24,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 90 remaining) [2023-11-29 05:28:24,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 90 remaining) [2023-11-29 05:28:24,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 90 remaining) [2023-11-29 05:28:24,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 90 remaining) [2023-11-29 05:28:24,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 90 remaining) [2023-11-29 05:28:24,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 90 remaining) [2023-11-29 05:28:24,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 90 remaining) [2023-11-29 05:28:24,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 90 remaining) [2023-11-29 05:28:24,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 90 remaining) [2023-11-29 05:28:24,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 90 remaining) [2023-11-29 05:28:24,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 90 remaining) [2023-11-29 05:28:24,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 90 remaining) [2023-11-29 05:28:24,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 90 remaining) [2023-11-29 05:28:24,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 90 remaining) [2023-11-29 05:28:24,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 90 remaining) [2023-11-29 05:28:24,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 90 remaining) [2023-11-29 05:28:24,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 90 remaining) [2023-11-29 05:28:24,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 90 remaining) [2023-11-29 05:28:24,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 90 remaining) [2023-11-29 05:28:24,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 90 remaining) [2023-11-29 05:28:24,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 90 remaining) [2023-11-29 05:28:24,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 90 remaining) [2023-11-29 05:28:24,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 90 remaining) [2023-11-29 05:28:24,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 90 remaining) [2023-11-29 05:28:24,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 90 remaining) [2023-11-29 05:28:24,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 90 remaining) [2023-11-29 05:28:24,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 90 remaining) [2023-11-29 05:28:24,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 90 remaining) [2023-11-29 05:28:24,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 90 remaining) [2023-11-29 05:28:24,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 90 remaining) [2023-11-29 05:28:24,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 90 remaining) [2023-11-29 05:28:24,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 90 remaining) [2023-11-29 05:28:24,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 90 remaining) [2023-11-29 05:28:24,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 90 remaining) [2023-11-29 05:28:24,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 90 remaining) [2023-11-29 05:28:24,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 90 remaining) [2023-11-29 05:28:24,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 90 remaining) [2023-11-29 05:28:24,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 90 remaining) [2023-11-29 05:28:24,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 90 remaining) [2023-11-29 05:28:24,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 90 remaining) [2023-11-29 05:28:24,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 90 remaining) [2023-11-29 05:28:24,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 90 remaining) [2023-11-29 05:28:24,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 90 remaining) [2023-11-29 05:28:24,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 90 remaining) [2023-11-29 05:28:24,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 90 remaining) [2023-11-29 05:28:24,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 90 remaining) [2023-11-29 05:28:24,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 90 remaining) [2023-11-29 05:28:24,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 90 remaining) [2023-11-29 05:28:24,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 90 remaining) [2023-11-29 05:28:24,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 90 remaining) [2023-11-29 05:28:24,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 90 remaining) [2023-11-29 05:28:24,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 90 remaining) [2023-11-29 05:28:24,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 90 remaining) [2023-11-29 05:28:24,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 90 remaining) [2023-11-29 05:28:24,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 90 remaining) [2023-11-29 05:28:24,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 90 remaining) [2023-11-29 05:28:24,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 90 remaining) [2023-11-29 05:28:24,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 90 remaining) [2023-11-29 05:28:24,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 90 remaining) [2023-11-29 05:28:24,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 90 remaining) [2023-11-29 05:28:24,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 90 remaining) [2023-11-29 05:28:24,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 90 remaining) [2023-11-29 05:28:24,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 90 remaining) [2023-11-29 05:28:24,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 90 remaining) [2023-11-29 05:28:24,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (24 of 90 remaining) [2023-11-29 05:28:24,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 90 remaining) [2023-11-29 05:28:24,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 90 remaining) [2023-11-29 05:28:24,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 90 remaining) [2023-11-29 05:28:24,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 90 remaining) [2023-11-29 05:28:24,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 90 remaining) [2023-11-29 05:28:24,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 90 remaining) [2023-11-29 05:28:24,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 90 remaining) [2023-11-29 05:28:24,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 90 remaining) [2023-11-29 05:28:24,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 90 remaining) [2023-11-29 05:28:24,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 90 remaining) [2023-11-29 05:28:24,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 90 remaining) [2023-11-29 05:28:24,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 90 remaining) [2023-11-29 05:28:24,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 90 remaining) [2023-11-29 05:28:24,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 90 remaining) [2023-11-29 05:28:24,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 90 remaining) [2023-11-29 05:28:24,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 90 remaining) [2023-11-29 05:28:24,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 90 remaining) [2023-11-29 05:28:24,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 90 remaining) [2023-11-29 05:28:24,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 90 remaining) [2023-11-29 05:28:24,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 90 remaining) [2023-11-29 05:28:24,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 90 remaining) [2023-11-29 05:28:24,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 90 remaining) [2023-11-29 05:28:24,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 90 remaining) [2023-11-29 05:28:24,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 90 remaining) [2023-11-29 05:28:24,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 05:28:24,139 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:28:24,145 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:28:24,145 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:28:24,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 05:28:24,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre49 could not be translated [2023-11-29 05:28:24,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:28:24 BasicIcfg [2023-11-29 05:28:24,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:28:24,210 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:28:24,210 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:28:24,211 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:28:24,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:27:31" (3/4) ... [2023-11-29 05:28:24,212 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:28:24,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 05:28:24,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre49 could not be translated [2023-11-29 05:28:24,278 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:28:24,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:28:24,279 INFO L158 Benchmark]: Toolchain (without parser) took 54606.52ms. Allocated memory was 201.3MB in the beginning and 583.0MB in the end (delta: 381.7MB). Free memory was 152.9MB in the beginning and 415.9MB in the end (delta: -263.0MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. [2023-11-29 05:28:24,280 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 63.4MB in the beginning and 63.4MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:28:24,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 830.39ms. Allocated memory is still 201.3MB. Free memory was 152.3MB in the beginning and 112.4MB in the end (delta: 39.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-29 05:28:24,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.61ms. Allocated memory is still 201.3MB. Free memory was 112.4MB in the beginning and 108.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:28:24,281 INFO L158 Benchmark]: Boogie Preprocessor took 81.65ms. Allocated memory is still 201.3MB. Free memory was 108.9MB in the beginning and 104.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:28:24,282 INFO L158 Benchmark]: RCFGBuilder took 1156.88ms. Allocated memory is still 201.3MB. Free memory was 104.7MB in the beginning and 90.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2023-11-29 05:28:24,282 INFO L158 Benchmark]: TraceAbstraction took 52387.88ms. Allocated memory was 201.3MB in the beginning and 583.0MB in the end (delta: 381.7MB). Free memory was 89.8MB in the beginning and 425.3MB in the end (delta: -335.5MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2023-11-29 05:28:24,283 INFO L158 Benchmark]: Witness Printer took 68.38ms. Allocated memory is still 583.0MB. Free memory was 425.3MB in the beginning and 415.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 05:28:24,285 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.15ms. Allocated memory is still 98.6MB. Free memory was 63.4MB in the beginning and 63.4MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 830.39ms. Allocated memory is still 201.3MB. Free memory was 152.3MB in the beginning and 112.4MB in the end (delta: 39.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.61ms. Allocated memory is still 201.3MB. Free memory was 112.4MB in the beginning and 108.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.65ms. Allocated memory is still 201.3MB. Free memory was 108.9MB in the beginning and 104.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1156.88ms. Allocated memory is still 201.3MB. Free memory was 104.7MB in the beginning and 90.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 52387.88ms. Allocated memory was 201.3MB in the beginning and 583.0MB in the end (delta: 381.7MB). Free memory was 89.8MB in the beginning and 425.3MB in the end (delta: -335.5MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * Witness Printer took 68.38ms. Allocated memory is still 583.0MB. Free memory was 425.3MB in the beginning and 415.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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~pre49 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~pre49 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] EXPR 0 slot[k] [L1267] 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 [L1267] RET 0 list_add(p, slot[k]) [L1268] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, k=5, mutex={1:0}, p={-5:0}, slot={2:0}, t1={5: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=0, 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: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1268]: 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, 156 locations, 90 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: 52.2s, OverallIterations: 30, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 33.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14000 SdHoareTripleChecker+Valid, 28.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10753 mSDsluCounter, 8781 SdHoareTripleChecker+Invalid, 25.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8277 mSDsCounter, 686 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42932 IncrementalHoareTripleChecker+Invalid, 43618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 686 mSolverCounterUnsat, 504 mSDtfsCounter, 42932 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=640occurred in iteration=29, InterpolantAutomatonStates: 209, 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, 0.8s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 896 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 825 ConstructedInterpolants, 0 QuantifiedInterpolants, 8735 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:28:24,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da6c7385-0479-4f91-a3d1-3b81fa7248d6/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)