./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.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_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI --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 c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:52:07,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:52:07,817 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:52:07,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:52:07,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:52:07,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:52:07,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:52:07,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:52:07,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:52:07,876 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:52:07,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:52:07,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:52:07,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:52:07,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:52:07,881 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:52:07,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:52:07,882 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:52:07,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:52:07,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:52:07,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:52:07,884 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:52:07,884 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:52:07,885 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:52:07,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:52:07,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:52:07,886 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:52:07,887 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:52:07,887 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:52:07,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:52:07,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:52:07,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:52:07,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:52:07,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:52:07,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:52:07,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:52:07,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:52:07,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:52:07,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:52:07,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:52:07,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:52:07,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:52:07,893 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_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/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_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI 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 -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 [2023-11-24 21:52:08,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:52:08,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:52:08,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:52:08,273 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:52:08,274 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:52:08,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-24 21:52:11,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:52:11,950 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:52:11,951 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-24 21:52:11,975 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/data/add2461b1/4578f82c855f4d4b88b0e59858f0a48b/FLAG186e1a348 [2023-11-24 21:52:11,993 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/data/add2461b1/4578f82c855f4d4b88b0e59858f0a48b [2023-11-24 21:52:11,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:52:11,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:52:11,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:52:11,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:52:12,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:52:12,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:52:11" (1/1) ... [2023-11-24 21:52:12,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a97a43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12, skipping insertion in model container [2023-11-24 21:52:12,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:52:11" (1/1) ... [2023-11-24 21:52:12,063 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:52:12,588 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:52:12,607 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:52:12,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:52:12,754 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:52:12,754 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:52:12,764 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:52:12,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12 WrapperNode [2023-11-24 21:52:12,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:52:12,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:52:12,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:52:12,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:52:12,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:12,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:12,891 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2023-11-24 21:52:12,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:52:12,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:52:12,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:52:12,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:52:12,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:12,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:12,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:12,953 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-24 21:52:12,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:12,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:12,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:12,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:12,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:12,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:13,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:52:13,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:52:13,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:52:13,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:52:13,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (1/1) ... [2023-11-24 21:52:13,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:52:13,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:13,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:52:13,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:52:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:52:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:52:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:52:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:52:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:52:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:52:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:52:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:52:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:52:13,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:52:13,112 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:52:13,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:52:13,113 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:52:13,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:52:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:52:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:52:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:52:13,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:52:13,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:52:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:52:13,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:52:13,119 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:52:13,292 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:52:13,296 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:52:13,747 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:52:13,996 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:52:13,997 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:52:13,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:52:13 BoogieIcfgContainer [2023-11-24 21:52:13,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:52:14,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:52:14,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:52:14,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:52:14,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:52:11" (1/3) ... [2023-11-24 21:52:14,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453b54f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:52:14, skipping insertion in model container [2023-11-24 21:52:14,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:12" (2/3) ... [2023-11-24 21:52:14,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453b54f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:52:14, skipping insertion in model container [2023-11-24 21:52:14,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:52:13" (3/3) ... [2023-11-24 21:52:14,020 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-24 21:52:14,042 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:52:14,042 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 21:52:14,042 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:52:14,104 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:52:14,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 118 flow [2023-11-24 21:52:14,197 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2023-11-24 21:52:14,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:52:14,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-24 21:52:14,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 118 flow [2023-11-24 21:52:14,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 50 transitions, 109 flow [2023-11-24 21:52:14,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:52:14,242 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;@161ccb64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:52:14,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 21:52:14,246 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:52:14,246 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:52:14,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:52:14,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:14,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:52:14,248 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:14,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:14,260 INFO L85 PathProgramCache]: Analyzing trace with hash 13238, now seen corresponding path program 1 times [2023-11-24 21:52:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:14,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563782300] [2023-11-24 21:52:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:14,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:14,580 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-24 21:52:14,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:14,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563782300] [2023-11-24 21:52:14,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563782300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:14,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:14,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:52:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879978106] [2023-11-24 21:52:14,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:14,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:14,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:14,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-24 21:52:14,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:14,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:14,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-24 21:52:14,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:15,412 INFO L124 PetriNetUnfolderBase]: 941/1842 cut-off events. [2023-11-24 21:52:15,412 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-24 21:52:15,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3308 conditions, 1842 events. 941/1842 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12813 event pairs, 707 based on Foata normal form. 108/1810 useless extension candidates. Maximal degree in co-relation 3294. Up to 1075 conditions per place. [2023-11-24 21:52:15,437 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-24 21:52:15,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 183 flow [2023-11-24 21:52:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:52:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-24 21:52:15,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-24 21:52:15,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-24 21:52:15,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-24 21:52:15,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:15,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-24 21:52:15,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:15,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:15,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:15,473 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 109 flow. Second operand 3 states and 113 transitions. [2023-11-24 21:52:15,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 183 flow [2023-11-24 21:52:15,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:52:15,486 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-24 21:52:15,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-24 21:52:15,492 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-24 21:52:15,492 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-24 21:52:15,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:15,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:15,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:52:15,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:52:15,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:15,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash 13239, now seen corresponding path program 1 times [2023-11-24 21:52:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:15,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409822050] [2023-11-24 21:52:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:15,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:15,707 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-24 21:52:15,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:15,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409822050] [2023-11-24 21:52:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409822050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:15,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:15,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:52:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162588534] [2023-11-24 21:52:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:15,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:15,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:15,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:15,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-24 21:52:15,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:15,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:15,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-24 21:52:15,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:16,161 INFO L124 PetriNetUnfolderBase]: 941/1841 cut-off events. [2023-11-24 21:52:16,161 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-24 21:52:16,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 1841 events. 941/1841 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12801 event pairs, 707 based on Foata normal form. 1/1702 useless extension candidates. Maximal degree in co-relation 3348. Up to 1074 conditions per place. [2023-11-24 21:52:16,179 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-24 21:52:16,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 180 flow [2023-11-24 21:52:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:52:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-24 21:52:16,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-24 21:52:16,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-24 21:52:16,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-24 21:52:16,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:16,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-24 21:52:16,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:16,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:16,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:16,195 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 113 transitions. [2023-11-24 21:52:16,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 180 flow [2023-11-24 21:52:16,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:52:16,203 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-24 21:52:16,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-24 21:52:16,205 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-24 21:52:16,206 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-24 21:52:16,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:16,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:16,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:52:16,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:52:16,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:16,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 394774135, now seen corresponding path program 1 times [2023-11-24 21:52:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:16,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654993872] [2023-11-24 21:52:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:16,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:16,293 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-24 21:52:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:16,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654993872] [2023-11-24 21:52:16,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654993872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:16,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:16,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:52:16,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143128329] [2023-11-24 21:52:16,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:16,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:16,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:16,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:16,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-24 21:52:16,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:16,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:16,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-24 21:52:16,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:16,781 INFO L124 PetriNetUnfolderBase]: 943/1840 cut-off events. [2023-11-24 21:52:16,781 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-24 21:52:16,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 1840 events. 943/1840 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12741 event pairs, 537 based on Foata normal form. 0/1706 useless extension candidates. Maximal degree in co-relation 3352. Up to 1075 conditions per place. [2023-11-24 21:52:16,800 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 30 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-24 21:52:16,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 180 flow [2023-11-24 21:52:16,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:52:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-24 21:52:16,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2023-11-24 21:52:16,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-24 21:52:16,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-24 21:52:16,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:16,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-24 21:52:16,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:16,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:16,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:16,809 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 111 transitions. [2023-11-24 21:52:16,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 180 flow [2023-11-24 21:52:16,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:52:16,815 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-24 21:52:16,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-24 21:52:16,817 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2023-11-24 21:52:16,818 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-24 21:52:16,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:16,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:16,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:52:16,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:52:16,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:16,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:16,819 INFO L85 PathProgramCache]: Analyzing trace with hash 394774136, now seen corresponding path program 1 times [2023-11-24 21:52:16,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:16,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249724067] [2023-11-24 21:52:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:16,957 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-24 21:52:16,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:16,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249724067] [2023-11-24 21:52:16,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249724067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:16,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:16,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:52:16,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783429750] [2023-11-24 21:52:16,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:16,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:16,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:16,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:16,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:16,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-24 21:52:16,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:16,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:16,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-24 21:52:16,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:17,340 INFO L124 PetriNetUnfolderBase]: 941/1821 cut-off events. [2023-11-24 21:52:17,341 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-24 21:52:17,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3341 conditions, 1821 events. 941/1821 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12464 event pairs, 723 based on Foata normal form. 3/1687 useless extension candidates. Maximal degree in co-relation 3331. Up to 1070 conditions per place. [2023-11-24 21:52:17,358 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 29 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-24 21:52:17,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 176 flow [2023-11-24 21:52:17,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:52:17,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-24 21:52:17,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.710691823899371 [2023-11-24 21:52:17,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-24 21:52:17,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-24 21:52:17,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:17,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-24 21:52:17,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:17,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:17,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:17,365 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 113 transitions. [2023-11-24 21:52:17,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 176 flow [2023-11-24 21:52:17,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:52:17,371 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-24 21:52:17,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-24 21:52:17,373 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2023-11-24 21:52:17,373 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-24 21:52:17,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:17,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:17,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:17,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:52:17,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:17,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1096199068, now seen corresponding path program 1 times [2023-11-24 21:52:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:17,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258027495] [2023-11-24 21:52:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:17,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:17,582 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-24 21:52:17,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:17,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258027495] [2023-11-24 21:52:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258027495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:52:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325198982] [2023-11-24 21:52:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:17,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:17,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:17,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:17,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 53 [2023-11-24 21:52:17,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:17,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:17,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 53 [2023-11-24 21:52:17,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:17,904 INFO L124 PetriNetUnfolderBase]: 772/1411 cut-off events. [2023-11-24 21:52:17,904 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-24 21:52:17,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 1411 events. 772/1411 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8556 event pairs, 240 based on Foata normal form. 0/1394 useless extension candidates. Maximal degree in co-relation 2659. Up to 989 conditions per place. [2023-11-24 21:52:17,916 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 30 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2023-11-24 21:52:17,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 192 flow [2023-11-24 21:52:17,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:52:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-24 21:52:17,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7484276729559748 [2023-11-24 21:52:17,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-24 21:52:17,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-24 21:52:17,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:17,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-24 21:52:17,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:17,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:17,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:17,921 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 119 transitions. [2023-11-24 21:52:17,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 192 flow [2023-11-24 21:52:17,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:52:17,923 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-24 21:52:17,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-24 21:52:17,924 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2023-11-24 21:52:17,925 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-24 21:52:17,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:17,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:17,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:17,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:52:17,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:17,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1096197985, now seen corresponding path program 1 times [2023-11-24 21:52:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:17,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910061822] [2023-11-24 21:52:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:17,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:17,981 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-24 21:52:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910061822] [2023-11-24 21:52:17,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910061822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:52:17,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249383715] [2023-11-24 21:52:17,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:17,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:17,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:17,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:17,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:17,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-24 21:52:18,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:18,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:18,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-24 21:52:18,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:18,301 INFO L124 PetriNetUnfolderBase]: 698/1394 cut-off events. [2023-11-24 21:52:18,301 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-24 21:52:18,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2573 conditions, 1394 events. 698/1394 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9233 event pairs, 324 based on Foata normal form. 0/1371 useless extension candidates. Maximal degree in co-relation 2562. Up to 890 conditions per place. [2023-11-24 21:52:18,315 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 27 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-24 21:52:18,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 166 flow [2023-11-24 21:52:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:52:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2023-11-24 21:52:18,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2023-11-24 21:52:18,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 108 transitions. [2023-11-24 21:52:18,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 108 transitions. [2023-11-24 21:52:18,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:18,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 108 transitions. [2023-11-24 21:52:18,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:18,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:18,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:18,319 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 3 states and 108 transitions. [2023-11-24 21:52:18,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 166 flow [2023-11-24 21:52:18,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:52:18,322 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-24 21:52:18,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-24 21:52:18,325 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2023-11-24 21:52:18,325 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-24 21:52:18,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:18,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:18,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:18,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:52:18,326 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:18,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1096197986, now seen corresponding path program 1 times [2023-11-24 21:52:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:18,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22465725] [2023-11-24 21:52:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:18,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:18,397 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-24 21:52:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22465725] [2023-11-24 21:52:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22465725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:18,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:18,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:52:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376362607] [2023-11-24 21:52:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:18,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:52:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:52:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:52:18,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 53 [2023-11-24 21:52:18,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:18,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:18,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 53 [2023-11-24 21:52:18,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:18,688 INFO L124 PetriNetUnfolderBase]: 676/1342 cut-off events. [2023-11-24 21:52:18,688 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-24 21:52:18,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2471 conditions, 1342 events. 676/1342 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8980 event pairs, 408 based on Foata normal form. 15/1328 useless extension candidates. Maximal degree in co-relation 2461. Up to 853 conditions per place. [2023-11-24 21:52:18,703 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-24 21:52:18,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 160 flow [2023-11-24 21:52:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:52:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:52:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-24 21:52:18,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6918238993710691 [2023-11-24 21:52:18,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-24 21:52:18,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-24 21:52:18,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:18,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-24 21:52:18,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:18,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:18,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:18,710 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 3 states and 110 transitions. [2023-11-24 21:52:18,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 160 flow [2023-11-24 21:52:18,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:52:18,714 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 88 flow [2023-11-24 21:52:18,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-24 21:52:18,717 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2023-11-24 21:52:18,717 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 88 flow [2023-11-24 21:52:18,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:18,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:18,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:18,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:52:18,718 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:18,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1002153647, now seen corresponding path program 1 times [2023-11-24 21:52:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:18,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727838525] [2023-11-24 21:52:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:19,322 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-24 21:52:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727838525] [2023-11-24 21:52:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727838525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:19,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:19,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:52:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88375646] [2023-11-24 21:52:19,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:19,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:52:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:19,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:52:19,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:52:19,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-24 21:52:19,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 88 flow. Second operand has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:19,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:19,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-24 21:52:19,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:20,176 INFO L124 PetriNetUnfolderBase]: 1095/2090 cut-off events. [2023-11-24 21:52:20,177 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-24 21:52:20,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3911 conditions, 2090 events. 1095/2090 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14823 event pairs, 342 based on Foata normal form. 45/2102 useless extension candidates. Maximal degree in co-relation 3901. Up to 667 conditions per place. [2023-11-24 21:52:20,194 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 46 selfloop transitions, 5 changer transitions 10/78 dead transitions. [2023-11-24 21:52:20,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 298 flow [2023-11-24 21:52:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:52:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:52:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2023-11-24 21:52:20,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6576819407008087 [2023-11-24 21:52:20,196 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 244 transitions. [2023-11-24 21:52:20,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 244 transitions. [2023-11-24 21:52:20,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:20,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 244 transitions. [2023-11-24 21:52:20,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:20,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:20,199 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:20,200 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 88 flow. Second operand 7 states and 244 transitions. [2023-11-24 21:52:20,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 298 flow [2023-11-24 21:52:20,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 78 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:52:20,203 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 112 flow [2023-11-24 21:52:20,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=112, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-11-24 21:52:20,204 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2023-11-24 21:52:20,204 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 112 flow [2023-11-24 21:52:20,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:20,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:20,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:20,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:52:20,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:20,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1002154029, now seen corresponding path program 1 times [2023-11-24 21:52:20,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:20,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835371571] [2023-11-24 21:52:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:20,434 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-24 21:52:20,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835371571] [2023-11-24 21:52:20,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835371571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:20,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:20,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:52:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322060237] [2023-11-24 21:52:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:20,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:52:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:20,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:52:20,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:52:20,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-24 21:52:20,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:20,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:20,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-24 21:52:20,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:21,383 INFO L124 PetriNetUnfolderBase]: 2575/4389 cut-off events. [2023-11-24 21:52:21,383 INFO L125 PetriNetUnfolderBase]: For 465/465 co-relation queries the response was YES. [2023-11-24 21:52:21,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8771 conditions, 4389 events. 2575/4389 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 30981 event pairs, 1412 based on Foata normal form. 0/4221 useless extension candidates. Maximal degree in co-relation 8756. Up to 2793 conditions per place. [2023-11-24 21:52:21,416 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 41 selfloop transitions, 6 changer transitions 37/99 dead transitions. [2023-11-24 21:52:21,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 434 flow [2023-11-24 21:52:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:52:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:52:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 275 transitions. [2023-11-24 21:52:21,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6485849056603774 [2023-11-24 21:52:21,419 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 275 transitions. [2023-11-24 21:52:21,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 275 transitions. [2023-11-24 21:52:21,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:21,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 275 transitions. [2023-11-24 21:52:21,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:21,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:21,423 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:21,423 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 112 flow. Second operand 8 states and 275 transitions. [2023-11-24 21:52:21,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 434 flow [2023-11-24 21:52:21,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 99 transitions, 426 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-24 21:52:21,429 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 158 flow [2023-11-24 21:52:21,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2023-11-24 21:52:21,431 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-24 21:52:21,432 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 158 flow [2023-11-24 21:52:21,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:21,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:21,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:21,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:52:21,433 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:21,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 586343058, now seen corresponding path program 1 times [2023-11-24 21:52:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920088749] [2023-11-24 21:52:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:21,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:21,653 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-24 21:52:21,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920088749] [2023-11-24 21:52:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920088749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:21,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:21,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:52:21,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820231348] [2023-11-24 21:52:21,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:21,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:21,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:21,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2023-11-24 21:52:21,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:21,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:21,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2023-11-24 21:52:21,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:23,521 INFO L124 PetriNetUnfolderBase]: 4648/7526 cut-off events. [2023-11-24 21:52:23,522 INFO L125 PetriNetUnfolderBase]: For 5795/5795 co-relation queries the response was YES. [2023-11-24 21:52:23,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18205 conditions, 7526 events. 4648/7526 cut-off events. For 5795/5795 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 52414 event pairs, 323 based on Foata normal form. 148/7651 useless extension candidates. Maximal degree in co-relation 18186. Up to 3152 conditions per place. [2023-11-24 21:52:23,593 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 119 selfloop transitions, 52 changer transitions 20/205 dead transitions. [2023-11-24 21:52:23,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 205 transitions, 1138 flow [2023-11-24 21:52:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-24 21:52:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-24 21:52:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 579 transitions. [2023-11-24 21:52:23,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6426193118756937 [2023-11-24 21:52:23,598 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 579 transitions. [2023-11-24 21:52:23,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 579 transitions. [2023-11-24 21:52:23,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:23,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 579 transitions. [2023-11-24 21:52:23,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 34.05882352941177) internal successors, (579), 17 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:23,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:23,605 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:23,605 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 158 flow. Second operand 17 states and 579 transitions. [2023-11-24 21:52:23,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 205 transitions, 1138 flow [2023-11-24 21:52:23,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 205 transitions, 1076 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-24 21:52:23,647 INFO L231 Difference]: Finished difference. Result has 87 places, 91 transitions, 607 flow [2023-11-24 21:52:23,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=607, PETRI_PLACES=87, PETRI_TRANSITIONS=91} [2023-11-24 21:52:23,648 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2023-11-24 21:52:23,649 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 91 transitions, 607 flow [2023-11-24 21:52:23,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:23,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:23,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:23,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:52:23,650 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:23,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash -596313917, now seen corresponding path program 1 times [2023-11-24 21:52:23,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:23,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829800254] [2023-11-24 21:52:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:23,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:23,917 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-24 21:52:23,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:23,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829800254] [2023-11-24 21:52:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829800254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:23,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:52:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326723334] [2023-11-24 21:52:23,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:23,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:52:23,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:23,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:52:23,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:52:23,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2023-11-24 21:52:23,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 91 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:23,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:23,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2023-11-24 21:52:23,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:26,298 INFO L124 PetriNetUnfolderBase]: 6055/10156 cut-off events. [2023-11-24 21:52:26,298 INFO L125 PetriNetUnfolderBase]: For 58164/58167 co-relation queries the response was YES. [2023-11-24 21:52:26,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39526 conditions, 10156 events. 6055/10156 cut-off events. For 58164/58167 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 76950 event pairs, 581 based on Foata normal form. 248/10338 useless extension candidates. Maximal degree in co-relation 39493. Up to 2116 conditions per place. [2023-11-24 21:52:26,396 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 127 selfloop transitions, 39 changer transitions 14/194 dead transitions. [2023-11-24 21:52:26,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 194 transitions, 1773 flow [2023-11-24 21:52:26,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:52:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 21:52:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 376 transitions. [2023-11-24 21:52:26,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6449399656946827 [2023-11-24 21:52:26,401 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 376 transitions. [2023-11-24 21:52:26,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 376 transitions. [2023-11-24 21:52:26,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:26,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 376 transitions. [2023-11-24 21:52:26,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 34.18181818181818) internal successors, (376), 11 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-24 21:52:26,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:26,405 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:26,406 INFO L175 Difference]: Start difference. First operand has 87 places, 91 transitions, 607 flow. Second operand 11 states and 376 transitions. [2023-11-24 21:52:26,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 194 transitions, 1773 flow [2023-11-24 21:52:26,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 194 transitions, 1747 flow, removed 13 selfloop flow, removed 0 redundant places. [2023-11-24 21:52:26,547 INFO L231 Difference]: Finished difference. Result has 101 places, 103 transitions, 805 flow [2023-11-24 21:52:26,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=805, PETRI_PLACES=101, PETRI_TRANSITIONS=103} [2023-11-24 21:52:26,548 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 43 predicate places. [2023-11-24 21:52:26,548 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 103 transitions, 805 flow [2023-11-24 21:52:26,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:26,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:26,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:26,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:52:26,549 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:26,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:26,550 INFO L85 PathProgramCache]: Analyzing trace with hash 129631231, now seen corresponding path program 1 times [2023-11-24 21:52:26,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:26,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184058150] [2023-11-24 21:52:26,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:26,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:27,223 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-24 21:52:27,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:27,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184058150] [2023-11-24 21:52:27,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184058150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:27,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:27,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:52:27,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941742265] [2023-11-24 21:52:27,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:27,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:52:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:27,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:52:27,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:52:27,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-24 21:52:27,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 103 transitions, 805 flow. Second operand has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:27,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:27,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-24 21:52:27,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:28,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([393] L860-->L863: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_3 0) (= v_~__unbuffered_p1_EBX~0_3 0) (= v_~__unbuffered_p1_EAX~0_3 1) (= v_~__unbuffered_p0_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_3, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_3, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][81], [42#L763true, 192#true, 124#true, 49#L820true, Black: 139#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 145#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 131#(and (= ~x~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 133#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 149#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 151#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 147#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 143#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 141#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 127#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))), 16#L803true, Black: 101#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t1740~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t1741~0#1.base|) 0)) (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0))), Black: 126#(= ~x~0 0), Black: 98#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1742~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1741~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|))), Black: 97#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1742~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1741~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= ~__unbuffered_p1_EAX~0 1))), 182#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 113#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 115#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), P0Thread1of1ForFork1InUse, 13#L863true, Black: 109#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))), Black: 180#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 168#true, Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork2InUse, Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:52:28,824 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-24 21:52:28,824 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-24 21:52:28,825 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-24 21:52:28,825 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-24 21:52:29,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([393] L860-->L863: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_3 0) (= v_~__unbuffered_p1_EBX~0_3 0) (= v_~__unbuffered_p1_EAX~0_3 1) (= v_~__unbuffered_p0_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_3, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_3, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][81], [18#P0EXITtrue, 192#true, 124#true, 49#L820true, Black: 139#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 145#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 131#(and (= ~x~0 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 133#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 149#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 151#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 147#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 143#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 141#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 127#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))), 16#L803true, Black: 101#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t1740~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t1741~0#1.base|) 0)) (= ~__unbuffered_p1_EAX~0 0) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0))), Black: 126#(= ~x~0 0), Black: 98#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1742~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1741~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|))), Black: 97#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t1741~0#1.base| 0) |ULTIMATE.start_main_~#t1742~0#1.base| 0) |ULTIMATE.start_main_~#t1740~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1741~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1741~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1742~0#1.base| |ULTIMATE.start_main_~#t1740~0#1.base|)) (not (= ~__unbuffered_p1_EAX~0 1))), 182#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 113#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 115#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 13#L863true, Black: 109#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))), P0Thread1of1ForFork1InUse, Black: 180#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P1Thread1of1ForFork0InUse, Black: 168#true, Black: 186#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P2Thread1of1ForFork2InUse, Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:52:29,501 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 21:52:29,502 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:52:29,502 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:52:29,502 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:52:30,170 INFO L124 PetriNetUnfolderBase]: 6009/11089 cut-off events. [2023-11-24 21:52:30,170 INFO L125 PetriNetUnfolderBase]: For 66567/67689 co-relation queries the response was YES. [2023-11-24 21:52:30,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42940 conditions, 11089 events. 6009/11089 cut-off events. For 66567/67689 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 96847 event pairs, 2159 based on Foata normal form. 253/10880 useless extension candidates. Maximal degree in co-relation 42900. Up to 4694 conditions per place. [2023-11-24 21:52:30,291 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 72 selfloop transitions, 10 changer transitions 51/169 dead transitions. [2023-11-24 21:52:30,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 169 transitions, 1501 flow [2023-11-24 21:52:30,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:52:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:52:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 236 transitions. [2023-11-24 21:52:30,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6361185983827493 [2023-11-24 21:52:30,294 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 236 transitions. [2023-11-24 21:52:30,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 236 transitions. [2023-11-24 21:52:30,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:30,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 236 transitions. [2023-11-24 21:52:30,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.714285714285715) internal successors, (236), 7 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:30,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:30,297 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:30,297 INFO L175 Difference]: Start difference. First operand has 101 places, 103 transitions, 805 flow. Second operand 7 states and 236 transitions. [2023-11-24 21:52:30,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 169 transitions, 1501 flow [2023-11-24 21:52:30,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 169 transitions, 1429 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-11-24 21:52:31,006 INFO L231 Difference]: Finished difference. Result has 108 places, 90 transitions, 697 flow [2023-11-24 21:52:31,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=697, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2023-11-24 21:52:31,008 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 50 predicate places. [2023-11-24 21:52:31,008 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 697 flow [2023-11-24 21:52:31,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:31,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:31,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:31,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:52:31,010 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:31,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:31,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1854980049, now seen corresponding path program 1 times [2023-11-24 21:52:31,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:31,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314186217] [2023-11-24 21:52:31,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:31,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:31,224 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-24 21:52:31,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:31,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314186217] [2023-11-24 21:52:31,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314186217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:31,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:31,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:52:31,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402370736] [2023-11-24 21:52:31,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:31,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:31,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:31,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:31,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-24 21:52:31,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:31,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:31,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-24 21:52:31,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:32,516 INFO L124 PetriNetUnfolderBase]: 3490/5997 cut-off events. [2023-11-24 21:52:32,516 INFO L125 PetriNetUnfolderBase]: For 34741/34767 co-relation queries the response was YES. [2023-11-24 21:52:32,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24221 conditions, 5997 events. 3490/5997 cut-off events. For 34741/34767 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 43794 event pairs, 1898 based on Foata normal form. 72/5945 useless extension candidates. Maximal degree in co-relation 24179. Up to 3805 conditions per place. [2023-11-24 21:52:32,601 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 69 selfloop transitions, 16 changer transitions 33/141 dead transitions. [2023-11-24 21:52:32,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 141 transitions, 1273 flow [2023-11-24 21:52:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:52:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:52:32,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 266 transitions. [2023-11-24 21:52:32,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6273584905660378 [2023-11-24 21:52:32,603 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 266 transitions. [2023-11-24 21:52:32,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 266 transitions. [2023-11-24 21:52:32,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:32,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 266 transitions. [2023-11-24 21:52:32,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.25) internal successors, (266), 8 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:32,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:32,606 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:32,607 INFO L175 Difference]: Start difference. First operand has 108 places, 90 transitions, 697 flow. Second operand 8 states and 266 transitions. [2023-11-24 21:52:32,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 141 transitions, 1273 flow [2023-11-24 21:52:32,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 141 transitions, 1171 flow, removed 46 selfloop flow, removed 6 redundant places. [2023-11-24 21:52:32,706 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 658 flow [2023-11-24 21:52:32,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=658, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2023-11-24 21:52:32,707 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 52 predicate places. [2023-11-24 21:52:32,707 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 658 flow [2023-11-24 21:52:32,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:32,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:32,708 INFO L208 CegarLoopForPetriNet]: trace histogram [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-24 21:52:32,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:52:32,708 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:32,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:32,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1809295678, now seen corresponding path program 1 times [2023-11-24 21:52:32,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:32,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81285311] [2023-11-24 21:52:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:32,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:33,286 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-24 21:52:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81285311] [2023-11-24 21:52:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81285311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:33,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:33,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:52:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807137291] [2023-11-24 21:52:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:33,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:52:33,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:52:33,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:52:33,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2023-11-24 21:52:33,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 658 flow. Second operand has 9 states, 9 states have (on average 23.88888888888889) internal successors, (215), 9 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:33,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:33,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2023-11-24 21:52:33,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:35,084 INFO L124 PetriNetUnfolderBase]: 3003/5479 cut-off events. [2023-11-24 21:52:35,085 INFO L125 PetriNetUnfolderBase]: For 21067/21823 co-relation queries the response was YES. [2023-11-24 21:52:35,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19754 conditions, 5479 events. 3003/5479 cut-off events. For 21067/21823 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 41626 event pairs, 1432 based on Foata normal form. 107/5426 useless extension candidates. Maximal degree in co-relation 19724. Up to 2520 conditions per place. [2023-11-24 21:52:35,143 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 28 selfloop transitions, 4 changer transitions 88/136 dead transitions. [2023-11-24 21:52:35,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 136 transitions, 1158 flow [2023-11-24 21:52:35,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:52:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:52:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2023-11-24 21:52:35,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5636792452830188 [2023-11-24 21:52:35,146 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 239 transitions. [2023-11-24 21:52:35,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 239 transitions. [2023-11-24 21:52:35,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:35,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 239 transitions. [2023-11-24 21:52:35,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:35,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:35,150 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 53.0) internal successors, (477), 9 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:35,151 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 658 flow. Second operand 8 states and 239 transitions. [2023-11-24 21:52:35,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 136 transitions, 1158 flow [2023-11-24 21:52:35,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 1088 flow, removed 6 selfloop flow, removed 10 redundant places. [2023-11-24 21:52:35,242 INFO L231 Difference]: Finished difference. Result has 100 places, 45 transitions, 282 flow [2023-11-24 21:52:35,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=282, PETRI_PLACES=100, PETRI_TRANSITIONS=45} [2023-11-24 21:52:35,243 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 42 predicate places. [2023-11-24 21:52:35,243 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 45 transitions, 282 flow [2023-11-24 21:52:35,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.88888888888889) internal successors, (215), 9 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:35,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:35,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 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-24 21:52:35,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:52:35,245 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:35,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash 213137461, now seen corresponding path program 1 times [2023-11-24 21:52:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783944344] [2023-11-24 21:52:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:35,506 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-24 21:52:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:35,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783944344] [2023-11-24 21:52:35,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783944344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:35,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:35,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:52:35,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034415925] [2023-11-24 21:52:35,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:35,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:52:35,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:35,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:52:35,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:52:35,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-24 21:52:35,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 45 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:35,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:35,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-24 21:52:35,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:36,455 INFO L124 PetriNetUnfolderBase]: 2935/4818 cut-off events. [2023-11-24 21:52:36,455 INFO L125 PetriNetUnfolderBase]: For 16258/16898 co-relation queries the response was YES. [2023-11-24 21:52:36,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15020 conditions, 4818 events. 2935/4818 cut-off events. For 16258/16898 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 30220 event pairs, 399 based on Foata normal form. 208/4898 useless extension candidates. Maximal degree in co-relation 14996. Up to 2526 conditions per place. [2023-11-24 21:52:36,504 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 47 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-11-24 21:52:36,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 70 transitions, 526 flow [2023-11-24 21:52:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:52:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:52:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-11-24 21:52:36,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2023-11-24 21:52:36,506 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 144 transitions. [2023-11-24 21:52:36,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions. [2023-11-24 21:52:36,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:36,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions. [2023-11-24 21:52:36,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:36,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:36,509 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:36,509 INFO L175 Difference]: Start difference. First operand has 100 places, 45 transitions, 282 flow. Second operand 4 states and 144 transitions. [2023-11-24 21:52:36,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 70 transitions, 526 flow [2023-11-24 21:52:36,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 426 flow, removed 18 selfloop flow, removed 19 redundant places. [2023-11-24 21:52:36,531 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 251 flow [2023-11-24 21:52:36,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2023-11-24 21:52:36,532 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-11-24 21:52:36,532 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 251 flow [2023-11-24 21:52:36,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:36,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:36,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 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-24 21:52:36,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:52:36,533 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:36,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1012661220, now seen corresponding path program 1 times [2023-11-24 21:52:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672373416] [2023-11-24 21:52:36,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:36,785 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-24 21:52:36,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:36,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672373416] [2023-11-24 21:52:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672373416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:36,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:52:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862130141] [2023-11-24 21:52:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:36,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:52:36,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:36,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:52:36,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:52:36,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-24 21:52:36,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:36,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:36,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-24 21:52:36,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:37,539 INFO L124 PetriNetUnfolderBase]: 2161/3612 cut-off events. [2023-11-24 21:52:37,540 INFO L125 PetriNetUnfolderBase]: For 6578/6860 co-relation queries the response was YES. [2023-11-24 21:52:37,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10895 conditions, 3612 events. 2161/3612 cut-off events. For 6578/6860 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 21565 event pairs, 236 based on Foata normal form. 182/3699 useless extension candidates. Maximal degree in co-relation 10879. Up to 1149 conditions per place. [2023-11-24 21:52:37,574 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 56 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2023-11-24 21:52:37,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 519 flow [2023-11-24 21:52:37,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:52:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:52:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2023-11-24 21:52:37,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6830188679245283 [2023-11-24 21:52:37,576 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 181 transitions. [2023-11-24 21:52:37,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 181 transitions. [2023-11-24 21:52:37,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:37,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 181 transitions. [2023-11-24 21:52:37,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:37,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 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-24 21:52:37,580 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 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-24 21:52:37,583 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 251 flow. Second operand 5 states and 181 transitions. [2023-11-24 21:52:37,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 519 flow [2023-11-24 21:52:37,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 80 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:52:37,593 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 285 flow [2023-11-24 21:52:37,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2023-11-24 21:52:37,594 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2023-11-24 21:52:37,594 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 285 flow [2023-11-24 21:52:37,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:37,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:37,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 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-24 21:52:37,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:52:37,595 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:37,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1637578540, now seen corresponding path program 1 times [2023-11-24 21:52:37,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:37,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007941768] [2023-11-24 21:52:37,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:37,870 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-24 21:52:37,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007941768] [2023-11-24 21:52:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007941768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:37,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:37,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:52:37,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506368632] [2023-11-24 21:52:37,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:37,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:37,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2023-11-24 21:52:37,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:37,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:37,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2023-11-24 21:52:37,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:38,413 INFO L124 PetriNetUnfolderBase]: 1637/2680 cut-off events. [2023-11-24 21:52:38,413 INFO L125 PetriNetUnfolderBase]: For 6894/7156 co-relation queries the response was YES. [2023-11-24 21:52:38,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9037 conditions, 2680 events. 1637/2680 cut-off events. For 6894/7156 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15103 event pairs, 206 based on Foata normal form. 108/2701 useless extension candidates. Maximal degree in co-relation 9019. Up to 968 conditions per place. [2023-11-24 21:52:38,426 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 49 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2023-11-24 21:52:38,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 76 transitions, 507 flow [2023-11-24 21:52:38,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:52:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:52:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2023-11-24 21:52:38,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6352201257861635 [2023-11-24 21:52:38,428 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 202 transitions. [2023-11-24 21:52:38,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 202 transitions. [2023-11-24 21:52:38,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:38,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 202 transitions. [2023-11-24 21:52:38,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:38,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:38,431 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:38,431 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 285 flow. Second operand 6 states and 202 transitions. [2023-11-24 21:52:38,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 76 transitions, 507 flow [2023-11-24 21:52:38,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 467 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-24 21:52:38,438 INFO L231 Difference]: Finished difference. Result has 75 places, 50 transitions, 275 flow [2023-11-24 21:52:38,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=75, PETRI_TRANSITIONS=50} [2023-11-24 21:52:38,439 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2023-11-24 21:52:38,439 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 50 transitions, 275 flow [2023-11-24 21:52:38,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:38,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:38,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 21:52:38,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:52:38,440 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:38,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash 393894116, now seen corresponding path program 1 times [2023-11-24 21:52:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:38,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450757280] [2023-11-24 21:52:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:38,744 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-24 21:52:38,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:38,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450757280] [2023-11-24 21:52:38,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450757280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:38,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:38,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:52:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053313702] [2023-11-24 21:52:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:38,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:38,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:38,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2023-11-24 21:52:38,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 50 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:38,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:38,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2023-11-24 21:52:38,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:39,328 INFO L124 PetriNetUnfolderBase]: 1524/2949 cut-off events. [2023-11-24 21:52:39,328 INFO L125 PetriNetUnfolderBase]: For 5792/6154 co-relation queries the response was YES. [2023-11-24 21:52:39,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8741 conditions, 2949 events. 1524/2949 cut-off events. For 5792/6154 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 20636 event pairs, 538 based on Foata normal form. 61/2729 useless extension candidates. Maximal degree in co-relation 8723. Up to 1301 conditions per place. [2023-11-24 21:52:39,359 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 34 selfloop transitions, 10 changer transitions 11/76 dead transitions. [2023-11-24 21:52:39,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 470 flow [2023-11-24 21:52:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:52:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:52:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2023-11-24 21:52:39,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5795148247978437 [2023-11-24 21:52:39,362 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 215 transitions. [2023-11-24 21:52:39,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 215 transitions. [2023-11-24 21:52:39,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:39,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 215 transitions. [2023-11-24 21:52:39,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:39,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:39,365 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:39,365 INFO L175 Difference]: Start difference. First operand has 75 places, 50 transitions, 275 flow. Second operand 7 states and 215 transitions. [2023-11-24 21:52:39,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 470 flow [2023-11-24 21:52:39,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 404 flow, removed 20 selfloop flow, removed 8 redundant places. [2023-11-24 21:52:39,386 INFO L231 Difference]: Finished difference. Result has 77 places, 53 transitions, 282 flow [2023-11-24 21:52:39,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=77, PETRI_TRANSITIONS=53} [2023-11-24 21:52:39,387 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2023-11-24 21:52:39,387 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 282 flow [2023-11-24 21:52:39,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:39,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:39,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 21:52:39,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 21:52:39,388 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:39,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash -432247248, now seen corresponding path program 2 times [2023-11-24 21:52:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:39,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169936100] [2023-11-24 21:52:39,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:39,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:40,982 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-24 21:52:40,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:40,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169936100] [2023-11-24 21:52:40,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169936100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:40,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:40,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 21:52:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114819609] [2023-11-24 21:52:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:40,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 21:52:40,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:40,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 21:52:40,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-24 21:52:41,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-24 21:52:41,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 53 transitions, 282 flow. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:41,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:41,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-24 21:52:41,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:41,888 INFO L124 PetriNetUnfolderBase]: 1827/3703 cut-off events. [2023-11-24 21:52:41,888 INFO L125 PetriNetUnfolderBase]: For 4110/4807 co-relation queries the response was YES. [2023-11-24 21:52:41,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9780 conditions, 3703 events. 1827/3703 cut-off events. For 4110/4807 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 29200 event pairs, 582 based on Foata normal form. 86/3383 useless extension candidates. Maximal degree in co-relation 9762. Up to 1470 conditions per place. [2023-11-24 21:52:41,925 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 35 selfloop transitions, 13 changer transitions 39/115 dead transitions. [2023-11-24 21:52:41,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 692 flow [2023-11-24 21:52:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 21:52:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-24 21:52:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 393 transitions. [2023-11-24 21:52:41,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6179245283018868 [2023-11-24 21:52:41,928 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 393 transitions. [2023-11-24 21:52:41,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 393 transitions. [2023-11-24 21:52:41,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:41,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 393 transitions. [2023-11-24 21:52:41,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 32.75) internal successors, (393), 12 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:41,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 53.0) internal successors, (689), 13 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:41,932 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 53.0) internal successors, (689), 13 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:41,932 INFO L175 Difference]: Start difference. First operand has 77 places, 53 transitions, 282 flow. Second operand 12 states and 393 transitions. [2023-11-24 21:52:41,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 692 flow [2023-11-24 21:52:41,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 115 transitions, 672 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-24 21:52:41,941 INFO L231 Difference]: Finished difference. Result has 91 places, 60 transitions, 389 flow [2023-11-24 21:52:41,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=389, PETRI_PLACES=91, PETRI_TRANSITIONS=60} [2023-11-24 21:52:41,942 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 33 predicate places. [2023-11-24 21:52:41,942 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 60 transitions, 389 flow [2023-11-24 21:52:41,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:41,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:41,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 21:52:41,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 21:52:41,943 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:41,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash -431898152, now seen corresponding path program 3 times [2023-11-24 21:52:41,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:41,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994805838] [2023-11-24 21:52:41,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:43,734 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-24 21:52:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:43,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994805838] [2023-11-24 21:52:43,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994805838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:43,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:43,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 21:52:43,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832660393] [2023-11-24 21:52:43,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:43,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 21:52:43,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 21:52:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-24 21:52:43,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2023-11-24 21:52:43,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 60 transitions, 389 flow. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:43,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:52:43,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2023-11-24 21:52:43,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:52:44,699 INFO L124 PetriNetUnfolderBase]: 1394/2883 cut-off events. [2023-11-24 21:52:44,699 INFO L125 PetriNetUnfolderBase]: For 6219/6741 co-relation queries the response was YES. [2023-11-24 21:52:44,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8523 conditions, 2883 events. 1394/2883 cut-off events. For 6219/6741 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 21659 event pairs, 416 based on Foata normal form. 81/2584 useless extension candidates. Maximal degree in co-relation 8498. Up to 1306 conditions per place. [2023-11-24 21:52:44,733 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 37 selfloop transitions, 19 changer transitions 20/104 dead transitions. [2023-11-24 21:52:44,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 104 transitions, 751 flow [2023-11-24 21:52:44,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:52:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 21:52:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 350 transitions. [2023-11-24 21:52:44,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6003430531732419 [2023-11-24 21:52:44,735 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 350 transitions. [2023-11-24 21:52:44,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 350 transitions. [2023-11-24 21:52:44,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:52:44,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 350 transitions. [2023-11-24 21:52:44,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 31.818181818181817) internal successors, (350), 11 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:44,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:44,742 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:44,743 INFO L175 Difference]: Start difference. First operand has 91 places, 60 transitions, 389 flow. Second operand 11 states and 350 transitions. [2023-11-24 21:52:44,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 104 transitions, 751 flow [2023-11-24 21:52:44,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 104 transitions, 704 flow, removed 13 selfloop flow, removed 7 redundant places. [2023-11-24 21:52:44,754 INFO L231 Difference]: Finished difference. Result has 94 places, 69 transitions, 504 flow [2023-11-24 21:52:44,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=504, PETRI_PLACES=94, PETRI_TRANSITIONS=69} [2023-11-24 21:52:44,755 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 36 predicate places. [2023-11-24 21:52:44,755 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 69 transitions, 504 flow [2023-11-24 21:52:44,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:52:44,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:52:44,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 21:52:44,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-24 21:52:44,756 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:52:44,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2116193814, now seen corresponding path program 4 times [2023-11-24 21:52:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383749550] [2023-11-24 21:52:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:52:44,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:52:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:52:44,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:52:44,953 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:52:44,954 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-24 21:52:44,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-24 21:52:44,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-24 21:52:44,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-24 21:52:44,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-24 21:52:44,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-24 21:52:44,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-24 21:52:44,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-24 21:52:44,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-24 21:52:44,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-24 21:52:44,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-24 21:52:44,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-24 21:52:44,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-24 21:52:44,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-24 21:52:44,960 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:44,969 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:52:44,969 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:52:45,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:52:45,062 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:52:45,064 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-24 21:52:45,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:52:45,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:52:45,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:52:45 BasicIcfg [2023-11-24 21:52:45,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:52:45,111 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:52:45,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:52:45,112 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:52:45,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:52:13" (3/4) ... [2023-11-24 21:52:45,115 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:52:45,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:52:45,117 INFO L158 Benchmark]: Toolchain (without parser) took 33120.09ms. Allocated memory was 163.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 114.4MB in the beginning and 1.1GB in the end (delta: -975.8MB). Peak memory consumption was 822.5MB. Max. memory is 16.1GB. [2023-11-24 21:52:45,118 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 100.7MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:52:45,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 767.08ms. Allocated memory is still 163.6MB. Free memory was 114.4MB in the beginning and 89.6MB in the end (delta: 24.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 21:52:45,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.63ms. Allocated memory is still 163.6MB. Free memory was 89.6MB in the beginning and 87.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:52:45,119 INFO L158 Benchmark]: Boogie Preprocessor took 108.61ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 82.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:52:45,119 INFO L158 Benchmark]: RCFGBuilder took 995.47ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 82.9MB in the beginning and 141.8MB in the end (delta: -58.9MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2023-11-24 21:52:45,120 INFO L158 Benchmark]: TraceAbstraction took 31109.49ms. Allocated memory was 218.1MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 140.8MB in the beginning and 1.1GB in the end (delta: -949.4MB). Peak memory consumption was 792.3MB. Max. memory is 16.1GB. [2023-11-24 21:52:45,120 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 2.0GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:52:45,122 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.31ms. Allocated memory is still 100.7MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 767.08ms. Allocated memory is still 163.6MB. Free memory was 114.4MB in the beginning and 89.6MB in the end (delta: 24.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.63ms. Allocated memory is still 163.6MB. Free memory was 89.6MB in the beginning and 87.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.61ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 82.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 995.47ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 82.9MB in the beginning and 141.8MB in the end (delta: -58.9MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31109.49ms. Allocated memory was 218.1MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 140.8MB in the beginning and 1.1GB in the end (delta: -949.4MB). Peak memory consumption was 792.3MB. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 2.0GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740; [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1741; [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1742; [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L802] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L819] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 __assert_fail ("0", "rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 847]: 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: 849]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 77 locations, 13 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: 30.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1264 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1107 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 210 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3681 IncrementalHoareTripleChecker+Invalid, 3740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 29 mSDtfsCounter, 3681 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=805occurred in iteration=11, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 3683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2023-11-24 21:52:45,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI --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 c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:52:47,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:52:48,026 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:52:48,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:52:48,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:52:48,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:52:48,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:52:48,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:52:48,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:52:48,099 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:52:48,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:52:48,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:52:48,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:52:48,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:52:48,103 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:52:48,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:52:48,104 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:52:48,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:52:48,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:52:48,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:52:48,107 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:52:48,107 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:52:48,108 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:52:48,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:52:48,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:52:48,109 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:52:48,110 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:52:48,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:52:48,111 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:52:48,111 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:52:48,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:52:48,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:52:48,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:52:48,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:52:48,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:52:48,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:52:48,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:52:48,116 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:52:48,116 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:52:48,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:52:48,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:52:48,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:52:48,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:52:48,118 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:52:48,118 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_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/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_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI 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 -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 [2023-11-24 21:52:48,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:52:48,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:52:48,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:52:48,547 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:52:48,547 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:52:48,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-24 21:52:51,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:52:52,375 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:52:52,376 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-24 21:52:52,399 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/data/ec9d4c26b/cc7f9ffd98a34ef99c11b73d41cf3c74/FLAG5dfeab6a4 [2023-11-24 21:52:52,414 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d81980ac-5e17-4831-a451-15b9538825aa/bin/uautomizer-verify-NlZe1sFDwI/data/ec9d4c26b/cc7f9ffd98a34ef99c11b73d41cf3c74 [2023-11-24 21:52:52,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:52:52,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:52:52,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:52:52,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:52:52,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:52:52,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:52:52" (1/1) ... [2023-11-24 21:52:52,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff6b228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:52:52, skipping insertion in model container [2023-11-24 21:52:52,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:52:52" (1/1) ... [2023-11-24 21:52:52,494 INFO L177 MainTranslator]: Built tables and reachable declarations